About the Execution of LTSMin+red for BridgeAndVehicles-PT-V80P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1003.155 | 186140.00 | 279044.00 | 238.70 | T?FTFF?FFFF?FFFF | 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-167813694500299.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V80P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694500299
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 21K Feb 25 12:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 12:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 180K Feb 25 12:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 696K Feb 25 12:17 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 13K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 123K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 352K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K Feb 25 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 357K Feb 25 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 791K Feb 25 12:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 25 12:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678623060886
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-PT-V80P50N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 12:11:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 12:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:11:03] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2023-03-12 12:11:03] [INFO ] Transformed 188 places.
[2023-03-12 12:11:03] [INFO ] Transformed 2108 transitions.
[2023-03-12 12:11:03] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 115 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:11:03] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-12 12:11:03] [INFO ] Computed 7 place invariants in 20 ms
[2023-03-12 12:11:07] [INFO ] Dead Transitions using invariants and state equation in 3259 ms found 0 transitions.
[2023-03-12 12:11:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:07] [INFO ] Invariant cache hit.
[2023-03-12 12:11:07] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-12 12:11:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:07] [INFO ] Invariant cache hit.
[2023-03-12 12:11:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:11:08] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
[2023-03-12 12:11:08] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:08] [INFO ] Invariant cache hit.
[2023-03-12 12:11:09] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5867 ms. Remains : 188/188 places, 2108/2108 transitions.
Support contains 17 out of 188 places after structural reductions.
[2023-03-12 12:11:10] [INFO ] Flatten gal took : 243 ms
[2023-03-12 12:11:10] [INFO ] Flatten gal took : 255 ms
[2023-03-12 12:11:10] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 23) seen :17
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10002 steps, including 5 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10006 steps, including 5 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 12:11:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:12] [INFO ] Invariant cache hit.
[2023-03-12 12:11:12] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2023-03-12 12:11:12] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-12 12:11:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 12:11:13] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-12 12:11:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:11:13] [INFO ] After 312ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-12 12:11:14] [INFO ] After 1042ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 473 ms.
[2023-03-12 12:11:15] [INFO ] After 2363ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 5 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.29 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 401 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:11:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 12:11:15] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:11:17] [INFO ] Dead Transitions using invariants and state equation in 2127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2530 ms. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 134993 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134993 steps, saw 38249 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 12:11:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:11:21] [INFO ] Invariant cache hit.
[2023-03-12 12:11:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:11:21] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 12:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:11:22] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 12:11:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:11:22] [INFO ] After 480ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 12:11:24] [INFO ] After 1788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2831 ms.
[2023-03-12 12:11:27] [INFO ] After 5136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 65 ms.
Support contains 5 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 220 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 221 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 755 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 12:11:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:11:28] [INFO ] Invariant cache hit.
[2023-03-12 12:11:28] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-12 12:11:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:11:28] [INFO ] Invariant cache hit.
[2023-03-12 12:11:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:11:30] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2028 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 203 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 2988 ms. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 189703 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189703 steps, saw 52632 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 12:11:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 12:11:34] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-12 12:11:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:11:34] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 12:11:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:11:34] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 12:11:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:11:35] [INFO ] After 342ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 12:11:35] [INFO ] After 941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-12 12:11:36] [INFO ] After 1651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 106 ms.
Support contains 5 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 185 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 187 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 204 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 12:11:36] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:11:36] [INFO ] Invariant cache hit.
[2023-03-12 12:11:37] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 12:11:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:11:37] [INFO ] Invariant cache hit.
[2023-03-12 12:11:37] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2023-03-12 12:11:37] [INFO ] Redundant transitions in 177 ms returned []
[2023-03-12 12:11:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:11:37] [INFO ] Invariant cache hit.
[2023-03-12 12:11:38] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2238 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
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1740 place count 183 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1742 place count 181 transition count 367
Applied a total of 1742 rules in 23 ms. Remains 181 /183 variables (removed 2) and now considering 367/2107 (removed 1740) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 367 rows 181 cols
[2023-03-12 12:11:38] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:11:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:11:38] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 12:11:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:11:39] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 12:11:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 12:11:39] [INFO ] After 228ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 12:11:39] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-12 12:11:39] [INFO ] After 875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.22 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((p0 U p1))))'
Support contains 5 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 16 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:11:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-12 12:11:40] [INFO ] Computed 7 place invariants in 10 ms
[2023-03-12 12:11:41] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
[2023-03-12 12:11:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:41] [INFO ] Invariant cache hit.
[2023-03-12 12:11:41] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-12 12:11:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:41] [INFO ] Invariant cache hit.
[2023-03-12 12:11:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:11:43] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1992 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 17 ms. Remains 187 /187 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3069 ms. Remains : 187/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 395 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(LEQ s174 s168), p0:(OR (LEQ 2 s83) (AND (LEQ s82 s0) (LEQ s174 s168)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1114 ms.
Product exploration explored 100000 steps with 33333 reset in 1120 ms.
Computed a total of 170 stabilizing places and 324 stable transitions
Graph (complete) has 4146 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.36 ms
Computed a total of 170 stabilizing places and 324 stable transitions
Detected a total of 170/187 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 p0), (X (X (NOT (AND (NOT p1) 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 : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-00 finished in 6168 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))||G(p1))))))'
Support contains 2 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 46 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:11:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 12:11:46] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 12:11:47] [INFO ] Dead Transitions using invariants and state equation in 1338 ms found 0 transitions.
[2023-03-12 12:11:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:47] [INFO ] Invariant cache hit.
[2023-03-12 12:11:48] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-12 12:11:48] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:48] [INFO ] Invariant cache hit.
[2023-03-12 12:11:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:11:49] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1918 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 17 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 3327 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s84), p1:(GT 3 s82)], 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 4189 reset in 789 ms.
Product exploration explored 100000 steps with 4851 reset in 884 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 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1412 steps, including 2 resets, run visited all 4 properties in 12 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 506 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 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 16 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:11:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 12:11:53] [INFO ] Computed 6 place invariants in 17 ms
[2023-03-12 12:11:55] [INFO ] Dead Transitions using invariants and state equation in 2373 ms found 0 transitions.
[2023-03-12 12:11:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:55] [INFO ] Invariant cache hit.
[2023-03-12 12:11:55] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-12 12:11:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:55] [INFO ] Invariant cache hit.
[2023-03-12 12:11:56] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2023-03-12 12:11:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:11:56] [INFO ] Invariant cache hit.
[2023-03-12 12:11:57] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4721 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.84 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 p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 707 steps, including 1 resets, run visited all 4 properties in 23 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 610 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4850 reset in 795 ms.
Product exploration explored 100000 steps with 4352 reset in 676 ms.
Support contains 2 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 27 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:12:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:01] [INFO ] Invariant cache hit.
[2023-03-12 12:12:06] [INFO ] Dead Transitions using invariants and state equation in 4592 ms found 0 transitions.
[2023-03-12 12:12:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:06] [INFO ] Invariant cache hit.
[2023-03-12 12:12:06] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-12 12:12:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:06] [INFO ] Invariant cache hit.
[2023-03-12 12:12:07] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2023-03-12 12:12:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:07] [INFO ] Invariant cache hit.
[2023-03-12 12:12:08] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6680 ms. Remains : 186/186 places, 2108/2108 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 finished in 22538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 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 26 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:12:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 12:12:08] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 12:12:12] [INFO ] Dead Transitions using invariants and state equation in 3909 ms found 0 transitions.
[2023-03-12 12:12:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:12] [INFO ] Invariant cache hit.
[2023-03-12 12:12:13] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-12 12:12:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:13] [INFO ] Invariant cache hit.
[2023-03-12 12:12:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:14] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2312 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6294 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 853 ms.
Product exploration explored 100000 steps with 33333 reset in 884 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-03 finished in 8598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!p1))))'
Support contains 5 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 28 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:12:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 12:12:17] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:12:18] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
[2023-03-12 12:12:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:18] [INFO ] Invariant cache hit.
[2023-03-12 12:12:19] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-12 12:12:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:19] [INFO ] Invariant cache hit.
[2023-03-12 12:12:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:20] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2023-03-12 12:12:20] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:20] [INFO ] Invariant cache hit.
[2023-03-12 12:12:21] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3930 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 213 ms :[p1, p1, p1, true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ 1 s168) (LEQ s83 (ADD s172 s173))), p1:(GT 3 s82)], 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]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-04 finished in 4167 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)) U G(p1)))'
Support contains 3 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.10 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 5 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 655 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:12:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-12 12:12:22] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-12 12:12:23] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
[2023-03-12 12:12:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:23] [INFO ] Invariant cache hit.
[2023-03-12 12:12:23] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-12 12:12:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:23] [INFO ] Invariant cache hit.
[2023-03-12 12:12:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:25] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned [82, 169]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2456 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 265 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 4584 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s0 1), p0:(GT s82 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9819 steps with 794 reset in 108 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-05 finished in 5072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&F((p2||X(((p1 U p3) U (p2&&(p1 U p3))))))))'
Support contains 6 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 19 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:12:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 12:12:26] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:12:27] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
[2023-03-12 12:12:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:27] [INFO ] Invariant cache hit.
[2023-03-12 12:12:27] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-12 12:12:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:28] [INFO ] Invariant cache hit.
[2023-03-12 12:12:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:29] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2201 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 26 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 3350 ms. Remains : 184/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s83 (ADD s84 s85)), p2:(LEQ 1 s82), p1:(LEQ (ADD s167 s168) s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8738 reset in 694 ms.
Product exploration explored 100000 steps with 8584 reset in 576 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 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 p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 698 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (NOT p2)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 702 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 39 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2)]
[2023-03-12 12:12:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 12:12:33] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:12:34] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:12:35] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2023-03-12 12:12:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:12:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:12:36] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2023-03-12 12:12:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:36] [INFO ] [Nat]Added 22 Read/Feed constraints in 90 ms returned sat
[2023-03-12 12:12:36] [INFO ] Deduced a trap composed of 14 places in 371 ms of which 1 ms to minimize.
[2023-03-12 12:12:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 699 ms
[2023-03-12 12:12:37] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 98 ms.
[2023-03-12 12:12:37] [INFO ] Added : 11 causal constraints over 5 iterations in 268 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 184 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 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 204 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:12:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:37] [INFO ] Invariant cache hit.
[2023-03-12 12:12:42] [INFO ] Dead Transitions using invariants and state equation in 4928 ms found 0 transitions.
[2023-03-12 12:12:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:42] [INFO ] Invariant cache hit.
[2023-03-12 12:12:42] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 12:12:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:42] [INFO ] Invariant cache hit.
[2023-03-12 12:12:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:43] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2023-03-12 12:12:43] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-12 12:12:43] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:43] [INFO ] Invariant cache hit.
[2023-03-12 12:12:44] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6944 ms. Remains : 184/184 places, 2108/2108 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 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 263 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 53 ms :[(NOT p2)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
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 319 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 57 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2)]
[2023-03-12 12:12:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:12:45] [INFO ] Invariant cache hit.
[2023-03-12 12:12:46] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:12:47] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2023-03-12 12:12:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:12:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 12:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:12:48] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-03-12 12:12:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 120 ms returned sat
[2023-03-12 12:12:49] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 1 ms to minimize.
[2023-03-12 12:12:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 810 ms
[2023-03-12 12:12:49] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 128 ms.
[2023-03-12 12:12:50] [INFO ] Added : 11 causal constraints over 5 iterations in 357 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 82 ms :[(NOT p2)]
Product exploration explored 100000 steps with 4753 reset in 517 ms.
Product exploration explored 100000 steps with 4687 reset in 528 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 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 183 transition count 2107
Applied a total of 2 rules in 223 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:12:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 12:12:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 12:12:52] [INFO ] Dead Transitions using invariants and state equation in 1177 ms found 0 transitions.
[2023-03-12 12:12:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:52] [INFO ] Invariant cache hit.
[2023-03-12 12:12:53] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 12:12:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:53] [INFO ] Invariant cache hit.
[2023-03-12 12:12:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:53] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-12 12:12:54] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-12 12:12:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:54] [INFO ] Invariant cache hit.
[2023-03-12 12:12:55] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/184 places, 2107/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3901 ms. Remains : 183/184 places, 2107/2108 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 finished in 28851 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.15 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 222 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:12:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 12:12:55] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:12:56] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
[2023-03-12 12:12:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:56] [INFO ] Invariant cache hit.
[2023-03-12 12:12:56] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-12 12:12:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:56] [INFO ] Invariant cache hit.
[2023-03-12 12:12:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:12:58] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2196 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 159 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 3406 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-07 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 s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 23 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-07 finished in 3614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 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 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 49 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:12:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:12:59] [INFO ] Invariant cache hit.
[2023-03-12 12:13:00] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
[2023-03-12 12:13:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:00] [INFO ] Invariant cache hit.
[2023-03-12 12:13:01] [INFO ] Implicit Places using invariants in 841 ms returned []
[2023-03-12 12:13:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:01] [INFO ] Invariant cache hit.
[2023-03-12 12:13:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:02] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2032 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 14 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 3201 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 1 s82) (LEQ s172 s86))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-08 finished in 3352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||G(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 14 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:13:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 12:13:02] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 12:13:03] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
[2023-03-12 12:13:03] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:13:03] [INFO ] Invariant cache hit.
[2023-03-12 12:13:03] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-12 12:13:03] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:13:03] [INFO ] Invariant cache hit.
[2023-03-12 12:13:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:05] [INFO ] Implicit Places using invariants and state equation in 1919 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2380 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 14 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 3386 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s83 s35), p0:(GT 1 s168)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 932 steps with 197 reset in 9 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-10 finished in 3807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 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.2 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 3 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 209 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:13:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-12 12:13:06] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-12 12:13:07] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
[2023-03-12 12:13:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:07] [INFO ] Invariant cache hit.
[2023-03-12 12:13:07] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-12 12:13:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:07] [INFO ] Invariant cache hit.
[2023-03-12 12:13:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:15] [INFO ] Implicit Places using invariants and state equation in 7627 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8037 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 187 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 9228 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 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 s172 s171)], 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 770 ms.
Product exploration explored 100000 steps with 168 reset in 818 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.10 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 196 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 32 ms :[(NOT p0)]
Finished random walk after 236 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=78 )
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 228 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
[2023-03-12 12:13:17] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 12:13:17] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:13:18] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 12:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:13:19] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2023-03-12 12:13:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:13:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 12:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:13:21] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-12 12:13:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 12:13:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 6035 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 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 234 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 12:13:27] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:27] [INFO ] Invariant cache hit.
[2023-03-12 12:13:28] [INFO ] Dead Transitions using invariants and state equation in 1037 ms found 0 transitions.
[2023-03-12 12:13:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:28] [INFO ] Invariant cache hit.
[2023-03-12 12:13:28] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-12 12:13:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:28] [INFO ] Invariant cache hit.
[2023-03-12 12:13:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:29] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-03-12 12:13:29] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-12 12:13:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:29] [INFO ] Invariant cache hit.
[2023-03-12 12:13:30] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3658 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.8 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 230 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 47 ms :[(NOT p0)]
Finished random walk after 212 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
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 271 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-12 12:13:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:31] [INFO ] Invariant cache hit.
[2023-03-12 12:13:32] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:13:33] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2023-03-12 12:13:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:13:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 12:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:13:35] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-12 12:13:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 479 ms returned sat
[2023-03-12 12:13:35] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 72 ms.
[2023-03-12 12:13:35] [INFO ] Added : 13 causal constraints over 4 iterations in 406 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0)]
Product exploration explored 100000 steps with 168 reset in 880 ms.
Product exploration explored 100000 steps with 168 reset in 681 ms.
Support contains 2 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 217 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 12:13:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:37] [INFO ] Invariant cache hit.
[2023-03-12 12:13:38] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
[2023-03-12 12:13:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:38] [INFO ] Invariant cache hit.
[2023-03-12 12:13:39] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-12 12:13:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:39] [INFO ] Invariant cache hit.
[2023-03-12 12:13:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:39] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2023-03-12 12:13:40] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-12 12:13:40] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:40] [INFO ] Invariant cache hit.
[2023-03-12 12:13:41] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3420 ms. Remains : 184/184 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 finished in 35063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1))))'
Support contains 5 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 13 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 12:13:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 12:13:41] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 12:13:42] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
[2023-03-12 12:13:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:13:42] [INFO ] Invariant cache hit.
[2023-03-12 12:13:42] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-12 12:13:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:13:42] [INFO ] Invariant cache hit.
[2023-03-12 12:13:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:44] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2023-03-12 12:13:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 12:13:44] [INFO ] Invariant cache hit.
[2023-03-12 12:13:45] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/188 places, 2108/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4166 ms. Remains : 187/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ s170 s168), p0:(OR (AND (GT 3 s174) (GT s82 s171)) (LEQ 3 s174))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-14 finished in 4424 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))))'
Support contains 4 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 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 183 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:13:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-12 12:13:45] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 12:13:46] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
[2023-03-12 12:13:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:46] [INFO ] Invariant cache hit.
[2023-03-12 12:13:47] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-12 12:13:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:47] [INFO ] Invariant cache hit.
[2023-03-12 12:13:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:48] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2023-03-12 12:13:48] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-12 12:13:48] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:48] [INFO ] Invariant cache hit.
[2023-03-12 12:13:48] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/188 places, 2107/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3309 ms. Remains : 186/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-15 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 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s173 s170), p0:(LEQ s167 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 593 steps with 0 reset in 9 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-15 finished in 3450 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))||G(p1))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 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.7 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 4 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 63 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 12:13:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-12 12:13:49] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-12 12:13:50] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
[2023-03-12 12:13:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:50] [INFO ] Invariant cache hit.
[2023-03-12 12:13:50] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-12 12:13:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:50] [INFO ] Invariant cache hit.
[2023-03-12 12:13:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:51] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1504 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 28 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 2434 ms. Remains : 185/188 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s84), p1:(GT 3 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5417 reset in 761 ms.
Product exploration explored 100000 steps with 5366 reset in 728 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.8 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 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 393 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 578 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 543 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 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 22 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 12:13:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 12:13:55] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 12:13:56] [INFO ] Dead Transitions using invariants and state equation in 1011 ms found 0 transitions.
[2023-03-12 12:13:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:56] [INFO ] Invariant cache hit.
[2023-03-12 12:13:56] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-12 12:13:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:56] [INFO ] Invariant cache hit.
[2023-03-12 12:13:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:13:57] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-03-12 12:13:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:13:57] [INFO ] Invariant cache hit.
[2023-03-12 12:13:58] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3022 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.8 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 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 575 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 441 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5131 reset in 888 ms.
Product exploration explored 100000 steps with 4915 reset in 729 ms.
Support contains 2 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 27 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 12:14:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:14:01] [INFO ] Invariant cache hit.
[2023-03-12 12:14:02] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
[2023-03-12 12:14:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:14:02] [INFO ] Invariant cache hit.
[2023-03-12 12:14:02] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-12 12:14:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:14:02] [INFO ] Invariant cache hit.
[2023-03-12 12:14:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:14:03] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2023-03-12 12:14:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 12:14:03] [INFO ] Invariant cache hit.
[2023-03-12 12:14:04] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3363 ms. Remains : 185/185 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 finished in 15835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&F((p2||X(((p1 U p3) U (p2&&(p1 U p3))))))))'
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)))'
[2023-03-12 12:14:05] [INFO ] Flatten gal took : 189 ms
[2023-03-12 12:14:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 12:14:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 2108 transitions and 15950 arcs took 33 ms.
Total runtime 182344 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1780/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1780/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1780/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11
BK_STOP 1678623247026
--------------------
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'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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-PT-V80P50N10-LTLCardinality-01
ltl formula formula --ltl=/tmp/1780/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.300 real 0.120 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1780/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1780/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1780/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1780/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x557a3a4f63f4]
1: pnml2lts-mc(+0xa2496) [0x557a3a4f6496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7faba4edb140]
3: pnml2lts-mc(+0x405be5) [0x557a3a859be5]
4: pnml2lts-mc(+0x16b3f9) [0x557a3a5bf3f9]
5: pnml2lts-mc(+0x164ac4) [0x557a3a5b8ac4]
6: pnml2lts-mc(+0x272e0a) [0x557a3a6c6e0a]
7: pnml2lts-mc(+0xb61f0) [0x557a3a50a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7faba4d2e4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7faba4d2e67a]
10: pnml2lts-mc(+0xa1581) [0x557a3a4f5581]
11: pnml2lts-mc(+0xa1910) [0x557a3a4f5910]
12: pnml2lts-mc(+0xa32a2) [0x557a3a4f72a2]
13: pnml2lts-mc(+0xa50f4) [0x557a3a4f90f4]
14: pnml2lts-mc(+0xa516b) [0x557a3a4f916b]
15: pnml2lts-mc(+0x3f34b3) [0x557a3a8474b3]
16: pnml2lts-mc(+0x7c63d) [0x557a3a4d063d]
17: pnml2lts-mc(+0x67d86) [0x557a3a4bbd86]
18: pnml2lts-mc(+0x60a8a) [0x557a3a4b4a8a]
19: pnml2lts-mc(+0x5eb15) [0x557a3a4b2b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7faba4d16d0a]
21: pnml2lts-mc(+0x6075e) [0x557a3a4b475e]
ltl formula name BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06
ltl formula formula --ltl=/tmp/1780/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.290 real 0.070 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1780/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1780/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1780/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1780/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11
ltl formula formula --ltl=/tmp/1780/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 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.290 real 0.100 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1780/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1780/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1780/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1780/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
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-PT-V80P50N10"
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-PT-V80P50N10, 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-167813694500299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N10.tgz
mv BridgeAndVehicles-PT-V80P50N10 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 ;