About the Execution of LTSMin+red for BridgeAndVehicles-PT-V50P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 655.191 | 121071.00 | 173562.00 | 118.60 | F?FF?FTFT??TTT?T | 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-167813694400227.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-V50P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694400227
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 20K Feb 25 12:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 12:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 455K Feb 25 12:07 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 9.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 12:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 12:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Feb 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 856K Feb 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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.1M 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-V50P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678615389825
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-V50P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:03:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 10:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:03:11] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-12 10:03:11] [INFO ] Transformed 128 places.
[2023-03-12 10:03:11] [INFO ] Transformed 1328 transitions.
[2023-03-12 10:03:11] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 59 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:03:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2023-03-12 10:03:12] [INFO ] Computed 7 place invariants in 16 ms
[2023-03-12 10:03:12] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
[2023-03-12 10:03:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:12] [INFO ] Invariant cache hit.
[2023-03-12 10:03:13] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-12 10:03:13] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:13] [INFO ] Invariant cache hit.
[2023-03-12 10:03:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:13] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2023-03-12 10:03:13] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:13] [INFO ] Invariant cache hit.
[2023-03-12 10:03:14] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2676 ms. Remains : 128/128 places, 1328/1328 transitions.
Support contains 15 out of 128 places after structural reductions.
[2023-03-12 10:03:14] [INFO ] Flatten gal took : 112 ms
[2023-03-12 10:03:15] [INFO ] Flatten gal took : 105 ms
[2023-03-12 10:03:15] [INFO ] Input system was already deterministic with 1328 transitions.
Support contains 14 out of 128 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 582 ms. (steps per millisecond=17 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 10:03:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:16] [INFO ] Invariant cache hit.
[2023-03-12 10:03:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 10:03:16] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-12 10:03:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 10:03:17] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-12 10:03:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:17] [INFO ] After 166ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-12 10:03:17] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-12 10:03:17] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 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 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 311 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:03:17] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:03:18] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 10:03:18] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1013 ms. Remains : 125/128 places, 1327/1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 346889 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346889 steps, saw 95081 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:03:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:21] [INFO ] Invariant cache hit.
[2023-03-12 10:03:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:03:22] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:03:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:03:22] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:03:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:22] [INFO ] After 682ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:03:23] [INFO ] After 870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-12 10:03:23] [INFO ] After 1183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 69 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 92 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:03:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:23] [INFO ] Invariant cache hit.
[2023-03-12 10:03:23] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-12 10:03:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:23] [INFO ] Invariant cache hit.
[2023-03-12 10:03:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:24] [INFO ] Implicit Places using invariants and state equation in 690 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1077 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1232 ms. Remains : 123/125 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 389164 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389164 steps, saw 106615 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:03:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:03:27] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:03:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:03:28] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:03:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:03:28] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:03:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:28] [INFO ] After 139ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:03:28] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-12 10:03:28] [INFO ] After 686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 123 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 88 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:03:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:28] [INFO ] Invariant cache hit.
[2023-03-12 10:03:29] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 10:03:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:29] [INFO ] Invariant cache hit.
[2023-03-12 10:03:29] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-12 10:03:29] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-12 10:03:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:29] [INFO ] Invariant cache hit.
[2023-03-12 10:03:30] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1313 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 122 transition count 248
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1082 place count 122 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1084 place count 120 transition count 246
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1085 place count 120 transition count 246
Applied a total of 1085 rules in 29 ms. Remains 120 /123 variables (removed 3) and now considering 246/1327 (removed 1081) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 246 rows 120 cols
[2023-03-12 10:03:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:03:30] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:03:30] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:03:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:03:30] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:03:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:03:30] [INFO ] After 76ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:03:30] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 10:03:30] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)&&F(!p1)))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 21 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:03:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:03:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:03:31] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
[2023-03-12 10:03:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:31] [INFO ] Invariant cache hit.
[2023-03-12 10:03:31] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-12 10:03:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:31] [INFO ] Invariant cache hit.
[2023-03-12 10:03:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:32] [INFO ] Implicit Places using invariants and state equation in 985 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1277 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1822 ms. Remains : 125/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, true, true, (NOT p1), p1]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s52 s53), p0:(LEQ 3 s110)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-00 finished in 2199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 325 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:03:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:03:33] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:03:34] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
[2023-03-12 10:03:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:34] [INFO ] Invariant cache hit.
[2023-03-12 10:03:34] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 10:03:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:34] [INFO ] Invariant cache hit.
[2023-03-12 10:03:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:34] [INFO ] Implicit Places using invariants and state equation in 589 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 781 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 102 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1734 ms. Remains : 123/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s106 s107)), p1:(LEQ s108 (ADD s106 s107))], nbAcceptance=2, 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 268 reset in 641 ms.
Product exploration explored 100000 steps with 268 reset in 664 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 192 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 449 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 106 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:03:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:03:37] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:03:37] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
[2023-03-12 10:03:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:37] [INFO ] Invariant cache hit.
[2023-03-12 10:03:38] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-12 10:03:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:38] [INFO ] Invariant cache hit.
[2023-03-12 10:03:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:38] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-12 10:03:38] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 10:03:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:38] [INFO ] Invariant cache hit.
[2023-03-12 10:03:39] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1927 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 82 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 344 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 268 reset in 491 ms.
Product exploration explored 100000 steps with 268 reset in 582 ms.
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 79 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:03:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:41] [INFO ] Invariant cache hit.
[2023-03-12 10:03:41] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
[2023-03-12 10:03:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:41] [INFO ] Invariant cache hit.
[2023-03-12 10:03:41] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-12 10:03:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:41] [INFO ] Invariant cache hit.
[2023-03-12 10:03:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:42] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2023-03-12 10:03:42] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 10:03:42] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:42] [INFO ] Invariant cache hit.
[2023-03-12 10:03:42] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1850 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01 finished in 9834 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 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 127 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1327
Applied a total of 3 rules in 72 ms. Remains 126 /128 variables (removed 2) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:03:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 126 cols
[2023-03-12 10:03:43] [INFO ] Computed 6 place invariants in 10 ms
[2023-03-12 10:03:43] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
[2023-03-12 10:03:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:43] [INFO ] Invariant cache hit.
[2023-03-12 10:03:43] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-12 10:03:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:43] [INFO ] Invariant cache hit.
[2023-03-12 10:03:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:44] [INFO ] Implicit Places using invariants and state equation in 670 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 862 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 63 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1451 ms. Remains : 125/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s108 s53)], 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 268 reset in 626 ms.
Product exploration explored 100000 steps with 268 reset in 694 ms.
Computed a total of 108 stabilizing places and 203 stable transitions
Graph (complete) has 2643 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/125 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 184 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 40 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 244 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 75 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:03:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:03:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:03:47] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
[2023-03-12 10:03:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:47] [INFO ] Invariant cache hit.
[2023-03-12 10:03:47] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-12 10:03:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:47] [INFO ] Invariant cache hit.
[2023-03-12 10:03:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:47] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2023-03-12 10:03:47] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-12 10:03:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:47] [INFO ] Invariant cache hit.
[2023-03-12 10:03:48] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1736 ms. Remains : 125/125 places, 1327/1327 transitions.
Computed a total of 108 stabilizing places and 203 stable transitions
Graph (complete) has 2643 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/125 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 120 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 29 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 175 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)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 268 reset in 609 ms.
Product exploration explored 100000 steps with 268 reset in 667 ms.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 77 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:03:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:50] [INFO ] Invariant cache hit.
[2023-03-12 10:03:50] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2023-03-12 10:03:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:50] [INFO ] Invariant cache hit.
[2023-03-12 10:03:50] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-12 10:03:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:50] [INFO ] Invariant cache hit.
[2023-03-12 10:03:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:51] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-12 10:03:51] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 10:03:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:03:51] [INFO ] Invariant cache hit.
[2023-03-12 10:03:51] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1932 ms. Remains : 125/125 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-04 finished in 8992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&F(G(p1)))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 13 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:03:52] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2023-03-12 10:03:52] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 10:03:52] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
[2023-03-12 10:03:52] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:52] [INFO ] Invariant cache hit.
[2023-03-12 10:03:53] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-12 10:03:53] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:53] [INFO ] Invariant cache hit.
[2023-03-12 10:03:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:53] [INFO ] Implicit Places using invariants and state equation in 617 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 959 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1552 ms. Remains : 126/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(GT s114 s107), p1:(LEQ s113 (ADD s54 s55))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-05 finished in 1754 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||X(X(p1)))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 8 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:03:53] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:53] [INFO ] Invariant cache hit.
[2023-03-12 10:03:54] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
[2023-03-12 10:03:54] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:54] [INFO ] Invariant cache hit.
[2023-03-12 10:03:54] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-12 10:03:54] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:54] [INFO ] Invariant cache hit.
[2023-03-12 10:03:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:55] [INFO ] Implicit Places using invariants and state equation in 555 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 755 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1225 ms. Remains : 126/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s113 (ADD s108 s109)), p1:(AND (GT s107 s113) (GT 1 s110))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-07 finished in 1411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(X(F(p2)))))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 65 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:03:55] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:03:55] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:03:56] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
[2023-03-12 10:03:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:56] [INFO ] Invariant cache hit.
[2023-03-12 10:03:56] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-12 10:03:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:03:56] [INFO ] Invariant cache hit.
[2023-03-12 10:03:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:56] [INFO ] Implicit Places using invariants and state equation in 497 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 728 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 64 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1646 ms. Remains : 124/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s53 s108), p1:(GT s0 s109), p2:(GT 1 s109)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 541 reset in 394 ms.
Product exploration explored 100000 steps with 542 reset in 395 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 366 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:03:58] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:03:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:03:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:03:58] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:03:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:03:58] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:03:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:03:58] [INFO ] After 71ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:03:58] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-12 10:03:58] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 1327
Applied a total of 2 rules in 107 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:03:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:03:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:03:59] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 839 ms. Remains : 123/124 places, 1327/1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 519124 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 519124 steps, saw 141820 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:04:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:02] [INFO ] Invariant cache hit.
[2023-03-12 10:04:02] [INFO ] [Real]Absence check using 5 positive place invariants in 24 ms returned sat
[2023-03-12 10:04:03] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:04:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:04:03] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:03] [INFO ] After 60ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:03] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-12 10:04:03] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 108 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 84 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:04:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:03] [INFO ] Invariant cache hit.
[2023-03-12 10:04:03] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-12 10:04:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:03] [INFO ] Invariant cache hit.
[2023-03-12 10:04:04] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-12 10:04:04] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 10:04:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:04] [INFO ] Invariant cache hit.
[2023-03-12 10:04:04] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1224 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 122 transition count 248
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1082 place count 122 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1084 place count 120 transition count 246
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1085 place count 120 transition count 246
Applied a total of 1085 rules in 14 ms. Remains 120 /123 variables (removed 3) and now considering 246/1327 (removed 1081) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 120 cols
[2023-03-12 10:04:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:04:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:04] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:04:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:05] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:04:05] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:05] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 10:04:05] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 9 factoid took 301 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 60 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:04:05] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:04:05] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:04:06] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
[2023-03-12 10:04:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:06] [INFO ] Invariant cache hit.
[2023-03-12 10:04:06] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-12 10:04:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:06] [INFO ] Invariant cache hit.
[2023-03-12 10:04:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:06] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2023-03-12 10:04:06] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 10:04:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:06] [INFO ] Invariant cache hit.
[2023-03-12 10:04:07] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1571 ms. Remains : 124/124 places, 1328/1328 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 366 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:04:07] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:07] [INFO ] Invariant cache hit.
[2023-03-12 10:04:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:04:07] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:04:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:08] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:08] [INFO ] After 39ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:08] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 10:04:08] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 1327
Applied a total of 2 rules in 124 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:04:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:04:08] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:04:08] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 652 ms. Remains : 123/124 places, 1327/1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 527896 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 527896 steps, saw 144176 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:04:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:12] [INFO ] Invariant cache hit.
[2023-03-12 10:04:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:04:12] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:04:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:12] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:12] [INFO ] After 61ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:12] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-12 10:04:12] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:04:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:12] [INFO ] Invariant cache hit.
[2023-03-12 10:04:12] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-12 10:04:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:12] [INFO ] Invariant cache hit.
[2023-03-12 10:04:13] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2023-03-12 10:04:13] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 10:04:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:13] [INFO ] Invariant cache hit.
[2023-03-12 10:04:13] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1185 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 122 transition count 248
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1082 place count 122 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1084 place count 120 transition count 246
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1085 place count 120 transition count 246
Applied a total of 1085 rules in 12 ms. Remains 120 /123 variables (removed 3) and now considering 246/1327 (removed 1081) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 120 cols
[2023-03-12 10:04:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:04:13] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:04:13] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:04:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:04:13] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:04:13] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:04:14] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 10:04:14] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 378 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 539 reset in 469 ms.
Product exploration explored 100000 steps with 541 reset in 413 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 77 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:04:15] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:04:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:04:16] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
[2023-03-12 10:04:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:16] [INFO ] Invariant cache hit.
[2023-03-12 10:04:16] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-12 10:04:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:16] [INFO ] Invariant cache hit.
[2023-03-12 10:04:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:16] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-12 10:04:16] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 10:04:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:16] [INFO ] Invariant cache hit.
[2023-03-12 10:04:17] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1363 ms. Remains : 124/124 places, 1328/1328 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-09 finished in 21947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 90 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:04:17] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:04:17] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:04:17] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
[2023-03-12 10:04:17] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:17] [INFO ] Invariant cache hit.
[2023-03-12 10:04:17] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-12 10:04:17] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:17] [INFO ] Invariant cache hit.
[2023-03-12 10:04:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:18] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2023-03-12 10:04:18] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 10:04:18] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:18] [INFO ] Invariant cache hit.
[2023-03-12 10:04:18] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1327/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1721 ms. Remains : 125/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s52), p1:(GT s108 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1008 reset in 443 ms.
Product exploration explored 100000 steps with 1016 reset in 455 ms.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/125 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 55 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 445 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 10:04:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:21] [INFO ] Invariant cache hit.
[2023-03-12 10:04:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:21] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2023-03-12 10:04:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:04:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:04:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:22] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-03-12 10:04:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:22] [INFO ] [Nat]Added 22 Read/Feed constraints in 26 ms returned sat
[2023-03-12 10:04:22] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 96 ms.
[2023-03-12 10:04:23] [INFO ] Added : 70 causal constraints over 15 iterations in 745 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 72 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:04:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:23] [INFO ] Invariant cache hit.
[2023-03-12 10:04:23] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
[2023-03-12 10:04:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:23] [INFO ] Invariant cache hit.
[2023-03-12 10:04:23] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-12 10:04:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:23] [INFO ] Invariant cache hit.
[2023-03-12 10:04:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:24] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-12 10:04:24] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 10:04:24] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:24] [INFO ] Invariant cache hit.
[2023-03-12 10:04:24] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1643 ms. Remains : 125/125 places, 1327/1327 transitions.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/125 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 92 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 10:04:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:25] [INFO ] Invariant cache hit.
[2023-03-12 10:04:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:26] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-12 10:04:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:04:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:26] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-12 10:04:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 41 ms returned sat
[2023-03-12 10:04:26] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 49 ms.
[2023-03-12 10:04:27] [INFO ] Added : 70 causal constraints over 15 iterations in 731 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1006 reset in 582 ms.
Product exploration explored 100000 steps with 969 reset in 522 ms.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 75 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:04:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:28] [INFO ] Invariant cache hit.
[2023-03-12 10:04:29] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
[2023-03-12 10:04:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:29] [INFO ] Invariant cache hit.
[2023-03-12 10:04:29] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-12 10:04:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:29] [INFO ] Invariant cache hit.
[2023-03-12 10:04:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:30] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2023-03-12 10:04:30] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 10:04:30] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:30] [INFO ] Invariant cache hit.
[2023-03-12 10:04:30] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1689 ms. Remains : 125/125 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-10 finished in 13424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1327
Applied a total of 4 rules in 14 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:04:30] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:30] [INFO ] Invariant cache hit.
[2023-03-12 10:04:31] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2023-03-12 10:04:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:31] [INFO ] Invariant cache hit.
[2023-03-12 10:04:31] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-12 10:04:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:31] [INFO ] Invariant cache hit.
[2023-03-12 10:04:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:31] [INFO ] Implicit Places using invariants and state equation in 583 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 798 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1305 ms. Remains : 123/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s13) (LEQ 3 s53))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 561 ms.
Product exploration explored 100000 steps with 50000 reset in 759 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 60 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-V50P20N10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-11 finished in 2808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 9 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:04:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2023-03-12 10:04:33] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 10:04:33] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
[2023-03-12 10:04:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:33] [INFO ] Invariant cache hit.
[2023-03-12 10:04:34] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 10:04:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:04:34] [INFO ] Invariant cache hit.
[2023-03-12 10:04:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:34] [INFO ] Implicit Places using invariants and state equation in 551 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 741 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1177 ms. Remains : 126/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT 3 s113) (LEQ s110 s52))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 695 ms.
Product exploration explored 100000 steps with 50000 reset in 673 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/126 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 152 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-V50P20N10-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-12 finished in 2869 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 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1327
Applied a total of 4 rules in 17 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:04:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:04:36] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:04:36] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
[2023-03-12 10:04:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:36] [INFO ] Invariant cache hit.
[2023-03-12 10:04:37] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-12 10:04:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:37] [INFO ] Invariant cache hit.
[2023-03-12 10:04:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:37] [INFO ] Implicit Places using invariants and state equation in 872 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1688 ms. Remains : 124/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14 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 s53 s107)], 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 1321 reset in 459 ms.
Product exploration explored 100000 steps with 1320 reset in 435 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/124 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 115 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=115 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 10:04:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:04:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:04:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:40] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2023-03-12 10:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:04:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:40] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-12 10:04:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 37 ms returned sat
[2023-03-12 10:04:40] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 32 ms.
[2023-03-12 10:04:41] [INFO ] Added : 28 causal constraints over 6 iterations in 1017 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:04:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:41] [INFO ] Invariant cache hit.
[2023-03-12 10:04:42] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
[2023-03-12 10:04:42] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:42] [INFO ] Invariant cache hit.
[2023-03-12 10:04:42] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-12 10:04:42] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:42] [INFO ] Invariant cache hit.
[2023-03-12 10:04:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:43] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2023-03-12 10:04:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:43] [INFO ] Invariant cache hit.
[2023-03-12 10:04:43] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1942 ms. Remains : 124/124 places, 1327/1327 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/124 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 104 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=52 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 10:04:44] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:44] [INFO ] Invariant cache hit.
[2023-03-12 10:04:44] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:45] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-03-12 10:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:04:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:46] [INFO ] [Nat]Absence check using state equation in 1171 ms returned sat
[2023-03-12 10:04:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 51 ms returned sat
[2023-03-12 10:04:46] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 81 ms.
[2023-03-12 10:04:48] [INFO ] Added : 58 causal constraints over 12 iterations in 1304 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1330 reset in 605 ms.
Product exploration explored 100000 steps with 1334 reset in 496 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 86 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:04:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:49] [INFO ] Invariant cache hit.
[2023-03-12 10:04:50] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
[2023-03-12 10:04:50] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 10:04:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:50] [INFO ] Invariant cache hit.
[2023-03-12 10:04:50] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1054 ms. Remains : 124/124 places, 1327/1327 transitions.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:04:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:50] [INFO ] Invariant cache hit.
[2023-03-12 10:04:51] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
[2023-03-12 10:04:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:51] [INFO ] Invariant cache hit.
[2023-03-12 10:04:51] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-12 10:04:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:51] [INFO ] Invariant cache hit.
[2023-03-12 10:04:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:52] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2023-03-12 10:04:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:52] [INFO ] Invariant cache hit.
[2023-03-12 10:04:52] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1892 ms. Remains : 124/124 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14 finished in 16472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(X(F(p2)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 22 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:04:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:04:53] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:04:53] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
[2023-03-12 10:04:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:53] [INFO ] Invariant cache hit.
[2023-03-12 10:04:54] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-12 10:04:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:54] [INFO ] Invariant cache hit.
[2023-03-12 10:04:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:54] [INFO ] Implicit Places using invariants and state equation in 500 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 681 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 15 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1186 ms. Remains : 124/128 places, 1327/1328 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14 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 s53 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1296 reset in 449 ms.
Product exploration explored 100000 steps with 1308 reset in 456 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/124 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 92 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 10:04:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:04:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:04:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:56] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2023-03-12 10:04:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:04:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:04:57] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-12 10:04:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:04:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 48 ms returned sat
[2023-03-12 10:04:57] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 38 ms.
[2023-03-12 10:04:58] [INFO ] Added : 28 causal constraints over 6 iterations in 1101 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:04:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:58] [INFO ] Invariant cache hit.
[2023-03-12 10:04:58] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
[2023-03-12 10:04:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:59] [INFO ] Invariant cache hit.
[2023-03-12 10:04:59] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 10:04:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:04:59] [INFO ] Invariant cache hit.
[2023-03-12 10:04:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:00] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
[2023-03-12 10:05:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:00] [INFO ] Invariant cache hit.
[2023-03-12 10:05:00] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2062 ms. Remains : 124/124 places, 1327/1327 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/124 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 10:05:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:01] [INFO ] Invariant cache hit.
[2023-03-12 10:05:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:05:01] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-12 10:05:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:05:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:05:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:05:02] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2023-03-12 10:05:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 65 ms returned sat
[2023-03-12 10:05:03] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 53 ms.
[2023-03-12 10:05:04] [INFO ] Added : 58 causal constraints over 12 iterations in 1097 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1312 reset in 422 ms.
Product exploration explored 100000 steps with 1324 reset in 441 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 103 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:05:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:05] [INFO ] Invariant cache hit.
[2023-03-12 10:05:05] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
[2023-03-12 10:05:05] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 10:05:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:06] [INFO ] Invariant cache hit.
[2023-03-12 10:05:06] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1078 ms. Remains : 124/124 places, 1327/1327 transitions.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:05:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:06] [INFO ] Invariant cache hit.
[2023-03-12 10:05:06] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
[2023-03-12 10:05:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:06] [INFO ] Invariant cache hit.
[2023-03-12 10:05:07] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-12 10:05:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:07] [INFO ] Invariant cache hit.
[2023-03-12 10:05:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:08] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
[2023-03-12 10:05:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:08] [INFO ] Invariant cache hit.
[2023-03-12 10:05:08] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2073 ms. Remains : 124/124 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14 finished in 15324 ms.
[2023-03-12 10:05:08] [INFO ] Flatten gal took : 71 ms
[2023-03-12 10:05:08] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 10:05:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 1328 transitions and 10010 arcs took 13 ms.
Total runtime 117168 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2156/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2156/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2156/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2156/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2156/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-09
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14
BK_STOP 1678615510896
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01
ltl formula formula --ltl=/tmp/2156/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 128 places, 1328 transitions and 10010 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.040 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2156/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2156/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2156/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2156/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLCardinality-04
ltl formula formula --ltl=/tmp/2156/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 128 places, 1328 transitions and 10010 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.280 real 0.020 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2156/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2156/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2156/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2156/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLCardinality-09
ltl formula formula --ltl=/tmp/2156/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 128 places, 1328 transitions and 10010 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.270 real 0.040 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2156/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2156/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2156/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2156/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 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:
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLCardinality-10
ltl formula formula --ltl=/tmp/2156/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 128 places, 1328 transitions and 10010 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.050 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2156/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2156/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2156/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2156/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14
ltl formula formula --ltl=/tmp/2156/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 128 places, 1328 transitions and 10010 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2156/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2156/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2156/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.060 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2156/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P20N10"
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-V50P20N10, 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-167813694400227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 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 ;