About the Execution of LTSMin+red for BridgeAndVehicles-COL-V80P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 892.892 | 197414.00 | 271196.00 | 183.00 | TFFF?FTFF?FFFFF? | normal |
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-167813694200115.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-V80P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694200115
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.8K Feb 25 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:13 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.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 45K 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-V80P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678607520504
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-V80P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:52:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 07:52:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:52:02] [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:52:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 07:52:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 554 ms
[2023-03-12 07:52:03] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.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:52:03] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 13 ms.
[2023-03-12 07:52:03] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
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.1 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 07:52:04] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 07:52:04] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 07:52:04] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1
[2023-03-12 07:52:04] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 07:52:04] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-12 07:52:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:52:04] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-12 07:52:04] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-12 07:52:04] [INFO ] After 160ms 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 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-12 07:52:05] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-12 07:52:05] [INFO ] Flatten gal took : 68 ms
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 07:52:05] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] 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:52:05] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 161 ms.
[2023-03-12 07:52:05] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 15 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 103 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:52:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-12 07:52:05] [INFO ] Computed 7 place invariants in 27 ms
[2023-03-12 07:52:07] [INFO ] Dead Transitions using invariants and state equation in 1441 ms found 0 transitions.
[2023-03-12 07:52:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:07] [INFO ] Invariant cache hit.
[2023-03-12 07:52:07] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-12 07:52:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:07] [INFO ] Invariant cache hit.
[2023-03-12 07:52:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:09] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
[2023-03-12 07:52:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:09] [INFO ] Invariant cache hit.
[2023-03-12 07:52:10] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4818 ms. Remains : 188/188 places, 2108/2108 transitions.
Support contains 15 out of 188 places after structural reductions.
[2023-03-12 07:52:10] [INFO ] Flatten gal took : 339 ms
[2023-03-12 07:52:10] [INFO ] Flatten gal took : 228 ms
[2023-03-12 07:52:11] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 07:52:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:12] [INFO ] Invariant cache hit.
[2023-03-12 07:52:12] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-12 07:52:12] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 07:52:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 07:52:12] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 07:52:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:13] [INFO ] After 112ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 07:52:13] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-12 07:52:13] [INFO ] After 821ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 410 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:52:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 07:52:13] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 07:52:15] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1568 ms. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 256507 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256507 steps, saw 70654 distinct states, run finished after 3006 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:52:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:52:18] [INFO ] Invariant cache hit.
[2023-03-12 07:52:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:52:18] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:52:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:52:18] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:52:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:18] [INFO ] After 83ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:52:18] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 395 ms.
[2023-03-12 07:52:19] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 251 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 251 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:52:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:52:19] [INFO ] Invariant cache hit.
[2023-03-12 07:52:20] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-12 07:52:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:52:20] [INFO ] Invariant cache hit.
[2023-03-12 07:52:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:22] [INFO ] Implicit Places using invariants and state equation in 2526 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2957 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 231 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3441 ms. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 281342 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281342 steps, saw 77270 distinct states, run finished after 3002 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:52:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:52:26] [INFO ] Computed 5 place invariants in 19 ms
[2023-03-12 07:52:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:52:26] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:52:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:52:26] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:52:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:26] [INFO ] After 102ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:52:26] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 366 ms.
[2023-03-12 07:52:27] [INFO ] After 823ms 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 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 233 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 216 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:52:27] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:52:27] [INFO ] Invariant cache hit.
[2023-03-12 07:52:28] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 07:52:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:52:28] [INFO ] Invariant cache hit.
[2023-03-12 07:52:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:30] [INFO ] Implicit Places using invariants and state equation in 2531 ms returned []
Implicit Place search using SMT with State Equation took 3051 ms to find 0 implicit places.
[2023-03-12 07:52:30] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-12 07:52:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:52:30] [INFO ] Invariant cache hit.
[2023-03-12 07:52:31] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4297 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1744 place count 181 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1746 place count 179 transition count 365
Applied a total of 1746 rules in 27 ms. Remains 179 /183 variables (removed 4) and now considering 365/2107 (removed 1742) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 365 rows 179 cols
[2023-03-12 07:52:31] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:52:31] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2023-03-12 07:52:32] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:52:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:52:32] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:52:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 07:52:32] [INFO ] After 37ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:52:32] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-12 07:52:32] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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((X(F(p0))||(p1&&X(p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 36 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:52:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 07:52:33] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-12 07:52:33] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
[2023-03-12 07:52:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:33] [INFO ] Invariant cache hit.
[2023-03-12 07:52:34] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 07:52:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:34] [INFO ] Invariant cache hit.
[2023-03-12 07:52:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:36] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2286 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 21 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3153 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s168), p0:(GT s84 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1161 ms.
Product exploration explored 100000 steps with 50000 reset in 865 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.37 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00 finished in 6022 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 U (p1&&X(p0))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 15 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:52:38] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:38] [INFO ] Invariant cache hit.
[2023-03-12 07:52:41] [INFO ] Dead Transitions using invariants and state equation in 2522 ms found 0 transitions.
[2023-03-12 07:52:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:41] [INFO ] Invariant cache hit.
[2023-03-12 07:52:41] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-12 07:52:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:41] [INFO ] Invariant cache hit.
[2023-03-12 07:52:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:43] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned [84, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1856 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4412 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p1:(LEQ s82 (ADD s170 s171)), p0:(LEQ 2 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 16664 steps with 5305 reset in 177 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01 finished in 4807 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 U (p1&&F(G(p2)))))))'
Support contains 10 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 647 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:52:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 07:52:44] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-12 07:52:45] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
[2023-03-12 07:52:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:45] [INFO ] Invariant cache hit.
[2023-03-12 07:52:45] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 07:52:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:45] [INFO ] Invariant cache hit.
[2023-03-12 07:52:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:46] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1509 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 295 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3186 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s83), p0:(AND (GT s168 1) (LEQ (ADD s171 s172) s0) (LEQ s84 s82)), p2:(LEQ s166 (ADD s184 s185))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 148 reset in 872 ms.
Product exploration explored 100000 steps with 148 reset in 809 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 708 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 700 steps, including 0 resets, run visited all 6 properties in 11 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (OR p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 1287 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-12 07:52:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 07:52:51] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 07:52:53] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 07:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:52:53] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2023-03-12 07:52:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:52:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:52:54] [INFO ] [Nat]Absence check using state equation in 316 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (OR p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 11 factoid took 716 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03 finished in 11554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(G(p1)&&X(p2))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 45 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:52:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 07:52:55] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-12 07:52:56] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
[2023-03-12 07:52:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:56] [INFO ] Invariant cache hit.
[2023-03-12 07:52:56] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-12 07:52:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:52:56] [INFO ] Invariant cache hit.
[2023-03-12 07:52:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:52:58] [INFO ] Implicit Places using invariants and state equation in 2257 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2584 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 19 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3474 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(GT 3 s83), p1:(LEQ 3 s167), p2:(LEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 396 reset in 738 ms.
Product exploration explored 100000 steps with 404 reset in 582 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 630 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 298 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 739 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-12 07:53:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 07:53:02] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:53:03] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:53:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:53:03] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2023-03-12 07:53:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:53:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:53:04] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-12 07:53:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 147 ms returned sat
[2023-03-12 07:53:05] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 143 ms.
[2023-03-12 07:53:05] [INFO ] Added : 11 causal constraints over 4 iterations in 371 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 19 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:53:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:05] [INFO ] Invariant cache hit.
[2023-03-12 07:53:05] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
[2023-03-12 07:53:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:05] [INFO ] Invariant cache hit.
[2023-03-12 07:53:06] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-12 07:53:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:06] [INFO ] Invariant cache hit.
[2023-03-12 07:53:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:07] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-12 07:53:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:07] [INFO ] Invariant cache hit.
[2023-03-12 07:53:07] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2600 ms. Remains : 186/186 places, 2108/2108 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 783 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 308 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 738 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-12 07:53:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:10] [INFO ] Invariant cache hit.
[2023-03-12 07:53:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:53:11] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-12 07:53:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:53:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:53:12] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-12 07:53:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 175 ms returned sat
[2023-03-12 07:53:13] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 149 ms.
[2023-03-12 07:53:13] [INFO ] Added : 11 causal constraints over 4 iterations in 394 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 396 reset in 517 ms.
Product exploration explored 100000 steps with 391 reset in 527 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 5 ms
Applied a total of 1 rules in 467 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:53:15] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 07:53:15] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:53:17] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
[2023-03-12 07:53:17] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-12 07:53:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:17] [INFO ] Invariant cache hit.
[2023-03-12 07:53:18] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/186 places, 2108/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2788 ms. Remains : 186/186 places, 2108/2108 transitions.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:53:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 07:53:18] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:53:18] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
[2023-03-12 07:53:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:18] [INFO ] Invariant cache hit.
[2023-03-12 07:53:19] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-12 07:53:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:19] [INFO ] Invariant cache hit.
[2023-03-12 07:53:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:20] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2023-03-12 07:53:20] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:20] [INFO ] Invariant cache hit.
[2023-03-12 07:53:20] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2829 ms. Remains : 186/186 places, 2108/2108 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 finished in 25900 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((!p0&&X((!p0 U (p1||G(!p0)))))))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 24 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:53:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 07:53:21] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:53:22] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
[2023-03-12 07:53:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:22] [INFO ] Invariant cache hit.
[2023-03-12 07:53:22] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-12 07:53:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:22] [INFO ] Invariant cache hit.
[2023-03-12 07:53:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:23] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1496 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 23 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2346 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, true, true, true, true, p0, (AND p0 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05 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=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s165 (ADD s167 s168)), p1:(GT (ADD s167 s168) s166)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 510 steps with 2 reset in 7 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05 finished in 2661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(X(p1) U (X(G(p1))||(p2&&X(p1)))))))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 28 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:53:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 07:53:23] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 07:53:24] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
[2023-03-12 07:53:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:24] [INFO ] Invariant cache hit.
[2023-03-12 07:53:25] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-12 07:53:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:53:25] [INFO ] Invariant cache hit.
[2023-03-12 07:53:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:26] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1518 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2455 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ 3 s167) (LEQ 1 s167)), p2:(GT 1 s167), p1:(GT 3 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 874 ms.
Product exploration explored 100000 steps with 25000 reset in 780 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 600 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 07:53:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-12 07:53:29] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:53:29] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1 (NOT p0))), (F (NOT (AND p2 p1 (NOT p0))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 10 factoid took 272 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06 finished in 5843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 203 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:53:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 07:53:29] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-12 07:53:30] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
[2023-03-12 07:53:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:30] [INFO ] Invariant cache hit.
[2023-03-12 07:53:31] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-12 07:53:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:31] [INFO ] Invariant cache hit.
[2023-03-12 07:53:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:32] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1889 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 152 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3079 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-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:(LEQ 1 s83)], 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 593 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08 finished in 3154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 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 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 221 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:53:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-12 07:53:33] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 07:53:33] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
[2023-03-12 07:53:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:33] [INFO ] Invariant cache hit.
[2023-03-12 07:53:34] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 07:53:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:34] [INFO ] Invariant cache hit.
[2023-03-12 07:53:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:35] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned [84, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1512 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 147 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2718 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 168 reset in 663 ms.
Product exploration explored 100000 steps with 168 reset in 674 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 3979 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.28 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-12 07:53:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:53:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:53:38] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:53:38] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2023-03-12 07:53:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:53:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:53:40] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2023-03-12 07:53:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 239 ms returned sat
[2023-03-12 07:53:40] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 0 ms to minimize.
[2023-03-12 07:53:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2023-03-12 07:53:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 70 ms.
[2023-03-12 07:53:41] [INFO ] Added : 79 causal constraints over 19 iterations in 775 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 161 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:53:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:41] [INFO ] Invariant cache hit.
[2023-03-12 07:53:42] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
[2023-03-12 07:53:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:42] [INFO ] Invariant cache hit.
[2023-03-12 07:53:43] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-12 07:53:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:43] [INFO ] Invariant cache hit.
[2023-03-12 07:53:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:45] [INFO ] Implicit Places using invariants and state equation in 2798 ms returned []
Implicit Place search using SMT with State Equation took 3287 ms to find 0 implicit places.
[2023-03-12 07:53:46] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-12 07:53:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:46] [INFO ] Invariant cache hit.
[2023-03-12 07:53:47] [INFO ] Dead Transitions using invariants and state equation in 1358 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5811 ms. Remains : 184/184 places, 2107/2107 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 3979 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-12 07:53:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:47] [INFO ] Invariant cache hit.
[2023-03-12 07:53:49] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-12 07:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:53:50] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2023-03-12 07:53:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:53:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:53:54] [INFO ] [Nat]Absence check using state equation in 3169 ms returned sat
[2023-03-12 07:53:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:53:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 84 ms returned sat
[2023-03-12 07:53:54] [INFO ] Deduced a trap composed of 5 places in 371 ms of which 2 ms to minimize.
[2023-03-12 07:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2023-03-12 07:53:54] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 61 ms.
[2023-03-12 07:53:55] [INFO ] Added : 64 causal constraints over 13 iterations in 997 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Product exploration explored 100000 steps with 168 reset in 1157 ms.
Product exploration explored 100000 steps with 168 reset in 778 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 146 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:53:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:57] [INFO ] Invariant cache hit.
[2023-03-12 07:53:58] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
[2023-03-12 07:53:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:58] [INFO ] Invariant cache hit.
[2023-03-12 07:53:58] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-12 07:53:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:53:58] [INFO ] Invariant cache hit.
[2023-03-12 07:53:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:00] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2023-03-12 07:54:00] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-12 07:54:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:00] [INFO ] Invariant cache hit.
[2023-03-12 07:54:01] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3662 ms. Remains : 184/184 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 finished in 28700 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(X(G(p0))))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 25 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:54:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 07:54:01] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:54:02] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
[2023-03-12 07:54:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:02] [INFO ] Invariant cache hit.
[2023-03-12 07:54:02] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-12 07:54:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:02] [INFO ] Invariant cache hit.
[2023-03-12 07:54:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:05] [INFO ] Implicit Places using invariants and state equation in 3233 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3691 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4409 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11 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: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 3 s0)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11 finished in 4681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 181 transition count 2104
Applied a total of 10 rules in 243 ms. Remains 181 /188 variables (removed 7) and now considering 2104/2108 (removed 4) transitions.
[2023-03-12 07:54:06] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 181 cols
[2023-03-12 07:54:06] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 07:54:06] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-12 07:54:06] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2023-03-12 07:54:06] [INFO ] Invariant cache hit.
[2023-03-12 07:54:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:08] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2148 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/188 places, 2104/2108 transitions.
Applied a total of 0 rules in 159 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2552 ms. Remains : 179/188 places, 2104/2108 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s81)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 498 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13 finished in 2663 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))) U (!p0&&X(X(G(p0)))))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 12 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:54:08] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 07:54:08] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:54:09] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
[2023-03-12 07:54:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:09] [INFO ] Invariant cache hit.
[2023-03-12 07:54:10] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 07:54:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:10] [INFO ] Invariant cache hit.
[2023-03-12 07:54:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:11] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1577 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2583 ms. Remains : 184/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, true, (NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14 finished in 2810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||G(p0)))||F((G(F(p2))||(F(p2)&&X(!p2)))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 23 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:54:11] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 07:54:11] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 07:54:12] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
[2023-03-12 07:54:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:12] [INFO ] Invariant cache hit.
[2023-03-12 07:54:12] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-12 07:54:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:12] [INFO ] Invariant cache hit.
[2023-03-12 07:54:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:15] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned [84, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2496 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3323 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(LEQ 1 s82), p1:(AND (GT 3 s167) (GT 3 s166)), p0:(GT 3 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3975 reset in 663 ms.
Product exploration explored 100000 steps with 3966 reset in 576 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 520 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2)]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 9 factoid took 325 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p2)]
[2023-03-12 07:54:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-12 07:54:17] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:54:18] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-12 07:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:54:19] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2023-03-12 07:54:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:54:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:54:24] [INFO ] [Nat]Absence check using state equation in 3903 ms returned sat
[2023-03-12 07:54:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 628 ms returned sat
[2023-03-12 07:54:25] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 65 ms.
[2023-03-12 07:54:26] [INFO ] Added : 92 causal constraints over 23 iterations in 981 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 247 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:54:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:26] [INFO ] Invariant cache hit.
[2023-03-12 07:54:27] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
[2023-03-12 07:54:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:27] [INFO ] Invariant cache hit.
[2023-03-12 07:54:28] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-12 07:54:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:28] [INFO ] Invariant cache hit.
[2023-03-12 07:54:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:28] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-12 07:54:29] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-12 07:54:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:29] [INFO ] Invariant cache hit.
[2023-03-12 07:54:29] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3664 ms. Remains : 185/185 places, 2108/2108 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p2)]
[2023-03-12 07:54:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:54:30] [INFO ] Invariant cache hit.
[2023-03-12 07:54:31] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:54:31] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2023-03-12 07:54:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:54:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:54:33] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2023-03-12 07:54:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 50 ms returned sat
[2023-03-12 07:54:33] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 1 ms to minimize.
[2023-03-12 07:54:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 728 ms
[2023-03-12 07:54:34] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 96 ms.
[2023-03-12 07:54:34] [INFO ] Added : 67 causal constraints over 16 iterations in 1056 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 76 ms :[(NOT p2)]
Product exploration explored 100000 steps with 3943 reset in 741 ms.
Product exploration explored 100000 steps with 3914 reset in 660 ms.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 182 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:54:36] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:54:36] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:54:37] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
[2023-03-12 07:54:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:37] [INFO ] Invariant cache hit.
[2023-03-12 07:54:37] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-12 07:54:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:38] [INFO ] Invariant cache hit.
[2023-03-12 07:54:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:40] [INFO ] Implicit Places using invariants and state equation in 2873 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
[2023-03-12 07:54:40] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 07:54:40] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:40] [INFO ] Invariant cache hit.
[2023-03-12 07:54:42] [INFO ] Dead Transitions using invariants and state equation in 1156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/185 places, 2107/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5641 ms. Remains : 184/185 places, 2107/2108 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 finished in 30490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(G(p1)&&X(p2))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 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 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 47 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:54:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-12 07:54:42] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 07:54:43] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
[2023-03-12 07:54:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:43] [INFO ] Invariant cache hit.
[2023-03-12 07:54:43] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-12 07:54:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:43] [INFO ] Invariant cache hit.
[2023-03-12 07:54:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:44] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1368 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 185/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 26 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2084 ms. Remains : 185/188 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(GT 3 s83), p1:(LEQ 3 s166), p2:(LEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 411 reset in 633 ms.
Product exploration explored 100000 steps with 415 reset in 521 ms.
Computed a total of 168 stabilizing places and 323 stable transitions
Graph (complete) has 4143 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 677 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 254 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 823 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-12 07:54:48] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 07:54:48] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:54:48] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 07:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:54:49] [INFO ] [Real]Absence check using state equation in 899 ms returned sat
[2023-03-12 07:54:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:54:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:54:56] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-12 07:54:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:56] [INFO ] [Nat]Added 22 Read/Feed constraints in 121 ms returned sat
[2023-03-12 07:54:56] [INFO ] Deduced a trap composed of 16 places in 298 ms of which 1 ms to minimize.
[2023-03-12 07:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-12 07:54:56] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 75 ms.
[2023-03-12 07:54:57] [INFO ] Added : 12 causal constraints over 4 iterations in 263 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 13 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:54:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:57] [INFO ] Invariant cache hit.
[2023-03-12 07:54:57] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
[2023-03-12 07:54:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:57] [INFO ] Invariant cache hit.
[2023-03-12 07:54:58] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 07:54:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:58] [INFO ] Invariant cache hit.
[2023-03-12 07:54:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:54:59] [INFO ] Implicit Places using invariants and state equation in 1870 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
[2023-03-12 07:54:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:54:59] [INFO ] Invariant cache hit.
[2023-03-12 07:55:00] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3629 ms. Remains : 185/185 places, 2107/2107 transitions.
Computed a total of 168 stabilizing places and 323 stable transitions
Graph (complete) has 4143 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1056 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 250 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 727 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-12 07:55:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:03] [INFO ] Invariant cache hit.
[2023-03-12 07:55:04] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 07:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:55:05] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2023-03-12 07:55:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:55:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-12 07:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:55:06] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-12 07:55:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:55:06] [INFO ] [Nat]Added 22 Read/Feed constraints in 125 ms returned sat
[2023-03-12 07:55:07] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 0 ms to minimize.
[2023-03-12 07:55:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-12 07:55:07] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 63 ms.
[2023-03-12 07:55:07] [INFO ] Added : 12 causal constraints over 4 iterations in 315 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 410 reset in 667 ms.
Product exploration explored 100000 steps with 413 reset in 772 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 182 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:55:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:09] [INFO ] Invariant cache hit.
[2023-03-12 07:55:10] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
[2023-03-12 07:55:10] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-12 07:55:10] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:10] [INFO ] Invariant cache hit.
[2023-03-12 07:55:11] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1832 ms. Remains : 185/185 places, 2107/2107 transitions.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 10 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:55:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:11] [INFO ] Invariant cache hit.
[2023-03-12 07:55:12] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
[2023-03-12 07:55:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:12] [INFO ] Invariant cache hit.
[2023-03-12 07:55:12] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-12 07:55:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:12] [INFO ] Invariant cache hit.
[2023-03-12 07:55:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:55:13] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
[2023-03-12 07:55:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:13] [INFO ] Invariant cache hit.
[2023-03-12 07:55:14] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3206 ms. Remains : 185/185 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 finished in 32361 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||G(p0)))||F((G(F(p2))||(F(p2)&&X(!p2)))))))'
[2023-03-12 07:55:14] [INFO ] Flatten gal took : 159 ms
[2023-03-12 07:55:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 07:55:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 2108 transitions and 15950 arcs took 21 ms.
Total runtime 192169 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2210/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2210/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2210/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04
Could not compute solution for formula : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09
Could not compute solution for formula : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15
BK_STOP 1678607717918
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04
ltl formula formula --ltl=/tmp/2210/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 188 places, 2108 transitions and 15950 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.710 real 0.100 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2210/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2210/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2210/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2210/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09
ltl formula formula --ltl=/tmp/2210/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 188 places, 2108 transitions and 15950 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.580 real 0.070 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2210/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2210/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2210/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2210/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15
ltl formula formula --ltl=/tmp/2210/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 188 places, 2108 transitions and 15950 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2210/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2210/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.100 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2210/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2210/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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-V80P20N10"
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-V80P20N10, 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-167813694200115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 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 '
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 ;