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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 12:08 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.3K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 42K 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-V50P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678606072490

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:27:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 07:27:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:27:54] [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 07:27:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 07:27:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 522 ms
[2023-03-12 07:27:54] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 07:27:54] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-12 07:27:54] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 11 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.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 07:27:55] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 07:27:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 07:27:55] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-12 07:27:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:27:55] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-12 07:27:55] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 07:27:55] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 200 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=100 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 07:27:55] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-12 07:27:55] [INFO ] Flatten gal took : 24 ms
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 07:27:55] [INFO ] Flatten gal took : 5 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 07:27:55] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 66 ms.
[2023-03-12 07:27:55] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 14 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 37 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 07:27:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2023-03-12 07:27:56] [INFO ] Computed 7 place invariants in 21 ms
[2023-03-12 07:27:56] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
[2023-03-12 07:27:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:27:56] [INFO ] Invariant cache hit.
[2023-03-12 07:27:56] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-12 07:27:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:27:56] [INFO ] Invariant cache hit.
[2023-03-12 07:27:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:27:57] [INFO ] Implicit Places using invariants and state equation in 587 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 778 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1308 ms. Remains : 127/128 places, 1328/1328 transitions.
Support contains 14 out of 127 places after structural reductions.
[2023-03-12 07:27:57] [INFO ] Flatten gal took : 90 ms
[2023-03-12 07:27:57] [INFO ] Flatten gal took : 81 ms
[2023-03-12 07:27:57] [INFO ] Input system was already deterministic with 1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:27:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2023-03-12 07:27:57] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-12 07:27:57] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-12 07:27:57] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:27:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 07:27:58] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:27:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:27:58] [INFO ] After 54ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:27:58] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 07:27:58] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Graph (complete) has 1118 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 1327
Applied a total of 3 rules in 171 ms. Remains 124 /127 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 07:27:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 07:27:58] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-12 07:27:58] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 683 ms. Remains : 124/127 places, 1327/1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 423993 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423993 steps, saw 115933 distinct states, run finished after 3004 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:28:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:01] [INFO ] Invariant cache hit.
[2023-03-12 07:28:01] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:28:02] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:28:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:02] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:28:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:02] [INFO ] After 52ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:28:02] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-12 07:28:02] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 64 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 124/124 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 71 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:02] [INFO ] Invariant cache hit.
[2023-03-12 07:28:02] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-12 07:28:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:02] [INFO ] Invariant cache hit.
[2023-03-12 07:28:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:03] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1289 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 65 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1427 ms. Remains : 123/124 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 493932 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493932 steps, saw 134828 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:28:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 07:28:06] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-12 07:28:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:07] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:28:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:07] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:28:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:07] [INFO ] After 94ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:28:07] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-12 07:28:07] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 115 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 84 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:07] [INFO ] Invariant cache hit.
[2023-03-12 07:28:07] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-12 07:28:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:07] [INFO ] Invariant cache hit.
[2023-03-12 07:28:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:08] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-12 07:28:08] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-12 07:28:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:08] [INFO ] Invariant cache hit.
[2023-03-12 07:28:08] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1393 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 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 1082 place count 121 transition count 247
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1084 place count 121 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1086 place count 119 transition count 245
Applied a total of 1086 rules in 18 ms. Remains 119 /123 variables (removed 4) and now considering 245/1327 (removed 1082) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 119 cols
[2023-03-12 07:28:08] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:28:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:28:09] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:28:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:09] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:28:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 07:28:09] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:28:09] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 07:28:09] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 110 stabilizing places and 204 stable transitions
Graph (complete) has 2646 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.36 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Graph (complete) has 2646 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 1327
Applied a total of 3 rules in 148 ms. Remains 124 /127 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 07:28:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 07:28:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:28:10] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
[2023-03-12 07:28:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:10] [INFO ] Invariant cache hit.
[2023-03-12 07:28:10] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-12 07:28:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:10] [INFO ] Invariant cache hit.
[2023-03-12 07:28:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:10] [INFO ] Implicit Places using invariants and state equation in 503 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 686 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/127 places, 1327/1328 transitions.
Applied a total of 0 rules in 92 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1279 ms. Remains : 123/127 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s121 s122)), p1:(LEQ s105 s104)], 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 647 reset in 506 ms.
Product exploration explored 100000 steps with 645 reset in 387 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 157 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-12 07:28:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 07:28:12] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:28:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:28:12] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2023-03-12 07:28:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:28:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:28:13] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 07:28:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 07:28:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 4982 ms returned sat
[2023-03-12 07:28:18] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 79 ms.
[2023-03-12 07:28:20] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 1 ms to minimize.
[2023-03-12 07:28:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 593 ms
[2023-03-12 07:28:20] [INFO ] Added : 13 causal constraints over 3 iterations in 2702 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 156 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:20] [INFO ] Invariant cache hit.
[2023-03-12 07:28:21] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
[2023-03-12 07:28:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:21] [INFO ] Invariant cache hit.
[2023-03-12 07:28:21] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-12 07:28:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:21] [INFO ] Invariant cache hit.
[2023-03-12 07:28:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:22] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2023-03-12 07:28:22] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 07:28:22] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:22] [INFO ] Invariant cache hit.
[2023-03-12 07:28:23] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2268 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 162 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-12 07:28:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:23] [INFO ] Invariant cache hit.
[2023-03-12 07:28:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:28:24] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-12 07:28:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:28:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:28:24] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-12 07:28:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 2836 ms returned sat
[2023-03-12 07:28:27] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 54 ms.
[2023-03-12 07:28:27] [INFO ] Added : 14 causal constraints over 5 iterations in 307 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 648 reset in 496 ms.
Product exploration explored 100000 steps with 647 reset in 451 ms.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 104 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:28] [INFO ] Invariant cache hit.
[2023-03-12 07:28:29] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
[2023-03-12 07:28:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:29] [INFO ] Invariant cache hit.
[2023-03-12 07:28:29] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-12 07:28:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:29] [INFO ] Invariant cache hit.
[2023-03-12 07:28:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:29] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2023-03-12 07:28:29] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 07:28:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:29] [INFO ] Invariant cache hit.
[2023-03-12 07:28:30] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1750 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00 finished in 20995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(F(p0))||(p1&&F(p0))))||(F(!p0)&&F(G(p2))))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 07:28:30] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2023-03-12 07:28:30] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 07:28:30] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
[2023-03-12 07:28:30] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:28:30] [INFO ] Invariant cache hit.
[2023-03-12 07:28:31] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-12 07:28:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:28:31] [INFO ] Invariant cache hit.
[2023-03-12 07:28:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:31] [INFO ] Implicit Places using invariants and state equation in 564 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 786 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1189 ms. Remains : 126/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s52 1), p0:(GT 1 s108), p2:(LEQ 1 (ADD s124 s125))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 439 steps with 1 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 finished in 1374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1328
Applied a total of 1 rules in 12 ms. Remains 126 /127 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 07:28:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 07:28:31] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:28:32] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
[2023-03-12 07:28:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:28:32] [INFO ] Invariant cache hit.
[2023-03-12 07:28:32] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 07:28:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:28:32] [INFO ] Invariant cache hit.
[2023-03-12 07:28:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:33] [INFO ] Implicit Places using invariants and state equation in 696 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 939 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1449 ms. Remains : 125/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s107 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 692 ms.
Product exploration explored 100000 steps with 50000 reset in 654 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 2541 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/125 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 finished in 2984 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 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Graph (complete) has 2646 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 1327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 122 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 120 transition count 1324
Applied a total of 10 rules in 124 ms. Remains 120 /127 variables (removed 7) and now considering 1324/1328 (removed 4) transitions.
[2023-03-12 07:28:35] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2023-03-12 07:28:35] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 07:28:35] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 07:28:35] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 07:28:35] [INFO ] Invariant cache hit.
[2023-03-12 07:28:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:35] [INFO ] Implicit Places using invariants and state equation in 528 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 755 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/127 places, 1324/1328 transitions.
Applied a total of 0 rules in 83 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 963 ms. Remains : 119/127 places, 1324/1328 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s104 s105))], 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 313 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08 finished in 1022 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(X(G(p0)))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1328
Applied a total of 1 rules in 7 ms. Remains 126 /127 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 07:28:35] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 07:28:35] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:28:36] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
[2023-03-12 07:28:36] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:28:36] [INFO ] Invariant cache hit.
[2023-03-12 07:28:36] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-12 07:28:36] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:28:36] [INFO ] Invariant cache hit.
[2023-03-12 07:28:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:37] [INFO ] Implicit Places using invariants and state equation in 687 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 887 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1361 ms. Remains : 125/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s0 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 finished in 1540 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((G(F(p0)) U (p1||X(X(p0)))))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 124 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 124 transition count 1327
Applied a total of 4 rules in 15 ms. Remains 124 /127 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 07:28:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 07:28:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:28:37] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2023-03-12 07:28:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:37] [INFO ] Invariant cache hit.
[2023-03-12 07:28:38] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 07:28:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:38] [INFO ] Invariant cache hit.
[2023-03-12 07:28:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:38] [INFO ] Implicit Places using invariants and state equation in 577 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 775 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/127 places, 1327/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1199 ms. Remains : 123/127 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 1 s0), p0:(LEQ (ADD s108 s109) (ADD s121 s122))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 236 reset in 516 ms.
Product exploration explored 100000 steps with 236 reset in 497 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 313 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10007 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 07:28:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 07:28:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:28:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:28:40] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:28:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:28:41] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:41] [INFO ] After 98ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:41] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-12 07:28:41] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 95 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:41] [INFO ] Invariant cache hit.
[2023-03-12 07:28:42] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 407735 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407735 steps, saw 111203 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 07:28:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:45] [INFO ] Invariant cache hit.
[2023-03-12 07:28:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:28:45] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:28:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:45] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:45] [INFO ] After 165ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:45] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-12 07:28:46] [INFO ] After 760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 100 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 79 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:46] [INFO ] Invariant cache hit.
[2023-03-12 07:28:46] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-12 07:28:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:46] [INFO ] Invariant cache hit.
[2023-03-12 07:28:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:47] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-12 07:28:47] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 07:28:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:47] [INFO ] Invariant cache hit.
[2023-03-12 07:28:47] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1352 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 123 transition count 247
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1082 place count 121 transition count 247
Applied a total of 1082 rules in 8 ms. Remains 121 /123 variables (removed 2) and now considering 247/1327 (removed 1080) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 247 rows 121 cols
[2023-03-12 07:28:47] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:28:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:28:47] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:28:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:28:48] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 07:28:48] [INFO ] After 60ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:48] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 07:28:48] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 5 factoid took 428 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 07:28:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:28:49] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
[2023-03-12 07:28:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:49] [INFO ] Invariant cache hit.
[2023-03-12 07:28:49] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 07:28:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:49] [INFO ] Invariant cache hit.
[2023-03-12 07:28:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:50] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-12 07:28:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:50] [INFO ] Invariant cache hit.
[2023-03-12 07:28:50] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1456 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 07:28:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:51] [INFO ] Invariant cache hit.
[2023-03-12 07:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:28:51] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:28:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:51] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:52] [INFO ] After 111ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:52] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-12 07:28:52] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 96 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:52] [INFO ] Invariant cache hit.
[2023-03-12 07:28:53] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 620 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 401554 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401554 steps, saw 109576 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 07:28:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:56] [INFO ] Invariant cache hit.
[2023-03-12 07:28:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:28:56] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:28:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:56] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:56] [INFO ] After 116ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:57] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-12 07:28:57] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 90 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 78 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:28:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:57] [INFO ] Invariant cache hit.
[2023-03-12 07:28:57] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-12 07:28:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:57] [INFO ] Invariant cache hit.
[2023-03-12 07:28:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:28:58] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-12 07:28:58] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 07:28:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:28:58] [INFO ] Invariant cache hit.
[2023-03-12 07:28:58] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1356 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 123 transition count 247
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1082 place count 121 transition count 247
Applied a total of 1082 rules in 9 ms. Remains 121 /123 variables (removed 2) and now considering 247/1327 (removed 1080) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 247 rows 121 cols
[2023-03-12 07:28:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:28:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:28:58] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:28:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:28:59] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 07:28:59] [INFO ] After 78ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:28:59] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-12 07:28:59] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 5 factoid took 367 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 236 reset in 662 ms.
Product exploration explored 100000 steps with 236 reset in 590 ms.
Applying partial POR strategy [false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 128 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:29:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 07:29:02] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:29:02] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
[2023-03-12 07:29:02] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-12 07:29:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:29:02] [INFO ] Invariant cache hit.
[2023-03-12 07:29:03] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1050 ms. Remains : 123/123 places, 1327/1327 transitions.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 07:29:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:29:03] [INFO ] Invariant cache hit.
[2023-03-12 07:29:03] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
[2023-03-12 07:29:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:29:03] [INFO ] Invariant cache hit.
[2023-03-12 07:29:03] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-12 07:29:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:29:03] [INFO ] Invariant cache hit.
[2023-03-12 07:29:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:29:04] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2023-03-12 07:29:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:29:04] [INFO ] Invariant cache hit.
[2023-03-12 07:29:04] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1478 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 finished in 27430 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(X((p0&&F(!p1)&&F(G(p0)))))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 124 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 124 transition count 1327
Applied a total of 4 rules in 10 ms. Remains 124 /127 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 07:29:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 07:29:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:29:05] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
[2023-03-12 07:29:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:29:05] [INFO ] Invariant cache hit.
[2023-03-12 07:29:05] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-12 07:29:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 07:29:05] [INFO ] Invariant cache hit.
[2023-03-12 07:29:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:29:05] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 671 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/127 places, 1327/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1052 ms. Remains : 123/127 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 s105), p1:(GT 1 (ADD s106 s107))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 finished in 1274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((p0&&G(p1)))) U p2))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1328
Applied a total of 2 rules in 6 ms. Remains 125 /127 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 07:29:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2023-03-12 07:29:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:29:06] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
[2023-03-12 07:29:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:29:06] [INFO ] Invariant cache hit.
[2023-03-12 07:29:06] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-12 07:29:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 07:29:06] [INFO ] Invariant cache hit.
[2023-03-12 07:29:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:29:07] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 715 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1095 ms. Remains : 124/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p2), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT s53 1), p2:(LEQ 1 s105), p0:(GT s52 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14 finished in 1211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 1328/1328 transitions.
Graph (complete) has 2646 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 1327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 122 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 120 transition count 1324
Applied a total of 10 rules in 93 ms. Remains 120 /127 variables (removed 7) and now considering 1324/1328 (removed 4) transitions.
[2023-03-12 07:29:07] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2023-03-12 07:29:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 07:29:07] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-12 07:29:07] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 07:29:07] [INFO ] Invariant cache hit.
[2023-03-12 07:29:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:29:08] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-12 07:29:08] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-12 07:29:08] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 07:29:08] [INFO ] Invariant cache hit.
[2023-03-12 07:29:08] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/127 places, 1324/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1010 ms. Remains : 120/127 places, 1324/1328 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT s51 1), p1:(GT s52 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 311 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 finished in 1053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0)) U (p1||X(X(p0)))))))'
[2023-03-12 07:29:08] [INFO ] Flatten gal took : 91 ms
[2023-03-12 07:29:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 07:29:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 1328 transitions and 9909 arcs took 14 ms.
Total runtime 74613 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1420/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1420/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11

BK_STOP 1678606149703

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00
ltl formula formula --ltl=/tmp/1420/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 127 places, 1328 transitions and 9909 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.250 real 0.070 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1420/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1420/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1420/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1420/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
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
ltl formula formula --ltl=/tmp/1420/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 127 places, 1328 transitions and 9909 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.230 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1420/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1420/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1420/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1420/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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