fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r039-tajo-167813692300299
Last Updated
May 14, 2023

About the Execution of LoLa+red for BridgeAndVehicles-PT-V80P50N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1368.779 387166.00 435338.00 950.50 T?FTFF?FFFF?FFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692300299.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 lolaxred
Input is BridgeAndVehicles-PT-V80P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692300299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 21K Feb 25 12:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 12:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 180K Feb 25 12:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 696K Feb 25 12:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 123K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 352K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K Feb 25 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 357K Feb 25 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 791K Feb 25 12:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 25 12:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678490248777

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 23:17:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 23:17:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:17:30] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-10 23:17:30] [INFO ] Transformed 188 places.
[2023-03-10 23:17:30] [INFO ] Transformed 2108 transitions.
[2023-03-10 23:17:30] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 218 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 3 formulas.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 65 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:17:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-10 23:17:31] [INFO ] Computed 7 place invariants in 38 ms
[2023-03-10 23:17:31] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
[2023-03-10 23:17:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:17:31] [INFO ] Invariant cache hit.
[2023-03-10 23:17:32] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-10 23:17:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:17:32] [INFO ] Invariant cache hit.
[2023-03-10 23:17:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:17:33] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2023-03-10 23:17:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:17:33] [INFO ] Invariant cache hit.
[2023-03-10 23:17:34] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3811 ms. Remains : 188/188 places, 2108/2108 transitions.
Support contains 17 out of 188 places after structural reductions.
[2023-03-10 23:17:35] [INFO ] Flatten gal took : 153 ms
[2023-03-10 23:17:35] [INFO ] Flatten gal took : 100 ms
[2023-03-10 23:17:35] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 23) seen :17
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 23:17:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:17:36] [INFO ] Invariant cache hit.
[2023-03-10 23:17:36] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-10 23:17:36] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-10 23:17:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-10 23:17:37] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-10 23:17:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:17:37] [INFO ] After 393ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-10 23:17:38] [INFO ] After 1255ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 381 ms.
[2023-03-10 23:17:39] [INFO ] After 2175ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 397 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:17:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 23:17:39] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-10 23:17:40] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1288 ms. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 225184 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225184 steps, saw 62426 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 23:17:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:17:44] [INFO ] Invariant cache hit.
[2023-03-10 23:17:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 23:17:44] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:17:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 23:17:44] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:17:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:17:44] [INFO ] After 433ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 23:17:46] [INFO ] After 1542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2486 ms.
[2023-03-10 23:17:48] [INFO ] After 4301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 37 ms.
Support contains 5 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 144 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 505 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 23:17:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:17:49] [INFO ] Invariant cache hit.
[2023-03-10 23:17:49] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-10 23:17:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:17:49] [INFO ] Invariant cache hit.
[2023-03-10 23:17:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:17:50] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1502 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 177 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2185 ms. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10008 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 246912 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246912 steps, saw 68116 distinct states, run finished after 3003 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 23:17:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-10 23:17:54] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-10 23:17:54] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 23:17:54] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:17:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 23:17:54] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:17:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:17:55] [INFO ] After 368ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 23:17:56] [INFO ] After 1068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-10 23:17:56] [INFO ] After 1806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 75 ms.
Support contains 5 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 179 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 168 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 23:17:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:17:56] [INFO ] Invariant cache hit.
[2023-03-10 23:17:57] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-10 23:17:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:17:57] [INFO ] Invariant cache hit.
[2023-03-10 23:17:57] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
[2023-03-10 23:17:57] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-10 23:17:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:17:57] [INFO ] Invariant cache hit.
[2023-03-10 23:17:58] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2082 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1740 place count 183 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1742 place count 181 transition count 367
Applied a total of 1742 rules in 21 ms. Remains 181 /183 variables (removed 2) and now considering 367/2107 (removed 1740) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 367 rows 181 cols
[2023-03-10 23:17:58] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 23:17:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 23:17:58] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:17:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 23:17:59] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:17:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 23:17:59] [INFO ] After 226ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 23:17:59] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-10 23:17:59] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:18:00] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-10 23:18:00] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-10 23:18:00] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
[2023-03-10 23:18:00] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:00] [INFO ] Invariant cache hit.
[2023-03-10 23:18:01] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-10 23:18:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:01] [INFO ] Invariant cache hit.
[2023-03-10 23:18:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:02] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1628 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 187 /187 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2383 ms. Remains : 187/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(LEQ s174 s168), p0:(OR (LEQ 2 s83) (AND (LEQ s82 s0) (LEQ s174 s168)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 971 ms.
Product exploration explored 100000 steps with 33333 reset in 703 ms.
Computed a total of 170 stabilizing places and 324 stable transitions
Graph (complete) has 4146 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.29 ms
Computed a total of 170 stabilizing places and 324 stable transitions
Detected a total of 170/187 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-00 finished in 4641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p0&&X(p1))||G(p1))))))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 23 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:18:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-10 23:18:04] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-10 23:18:05] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
[2023-03-10 23:18:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:05] [INFO ] Invariant cache hit.
[2023-03-10 23:18:05] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-10 23:18:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:05] [INFO ] Invariant cache hit.
[2023-03-10 23:18:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:06] [INFO ] Implicit Places using invariants and state equation in 987 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1370 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 16 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2183 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s84), p1:(GT 3 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3901 reset in 894 ms.
Product exploration explored 100000 steps with 4749 reset in 788 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 403 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 695 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 526 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 26 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:18:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-10 23:18:10] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-10 23:18:11] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
[2023-03-10 23:18:11] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:11] [INFO ] Invariant cache hit.
[2023-03-10 23:18:11] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-10 23:18:11] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:11] [INFO ] Invariant cache hit.
[2023-03-10 23:18:12] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2023-03-10 23:18:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:12] [INFO ] Invariant cache hit.
[2023-03-10 23:18:13] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2814 ms. Remains : 186/186 places, 2108/2108 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 688 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 452 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4527 reset in 803 ms.
Product exploration explored 100000 steps with 5535 reset in 618 ms.
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:18:16] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:16] [INFO ] Invariant cache hit.
[2023-03-10 23:18:17] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
[2023-03-10 23:18:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:17] [INFO ] Invariant cache hit.
[2023-03-10 23:18:17] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-10 23:18:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:17] [INFO ] Invariant cache hit.
[2023-03-10 23:18:18] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-10 23:18:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:18] [INFO ] Invariant cache hit.
[2023-03-10 23:18:19] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2259 ms. Remains : 186/186 places, 2108/2108 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 finished in 14662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 21 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:18:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 23:18:19] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 23:18:19] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
[2023-03-10 23:18:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:19] [INFO ] Invariant cache hit.
[2023-03-10 23:18:20] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-10 23:18:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:20] [INFO ] Invariant cache hit.
[2023-03-10 23:18:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:22] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2897 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 16 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3561 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 845 ms.
Product exploration explored 100000 steps with 33333 reset in 623 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-03 finished in 5323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!p1))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 25 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:18:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-10 23:18:24] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-10 23:18:25] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2023-03-10 23:18:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:25] [INFO ] Invariant cache hit.
[2023-03-10 23:18:25] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-10 23:18:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:25] [INFO ] Invariant cache hit.
[2023-03-10 23:18:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:26] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2023-03-10 23:18:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:26] [INFO ] Invariant cache hit.
[2023-03-10 23:18:27] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2644 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 789 ms :[p1, p1, p1, true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ 1 s168) (LEQ s83 (ADD s172 s173))), p1:(GT 3 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-04 finished in 3470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 506 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:18:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-10 23:18:28] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-10 23:18:29] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
[2023-03-10 23:18:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:29] [INFO ] Invariant cache hit.
[2023-03-10 23:18:29] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-10 23:18:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:29] [INFO ] Invariant cache hit.
[2023-03-10 23:18:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:31] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned [82, 169]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1768 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 198 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3157 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s0 1), p0:(GT s82 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 36792 steps with 3224 reset in 220 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-05 finished in 3586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&F((p2||X(((p1 U p3) U (p2&&(p1 U p3))))))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 21 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:18:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-10 23:18:31] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 23:18:32] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
[2023-03-10 23:18:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:32] [INFO ] Invariant cache hit.
[2023-03-10 23:18:32] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-10 23:18:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:32] [INFO ] Invariant cache hit.
[2023-03-10 23:18:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:33] [INFO ] Implicit Places using invariants and state equation in 914 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1161 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1943 ms. Remains : 184/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s83 (ADD s84 s85)), p2:(LEQ 1 s82), p1:(LEQ (ADD s167 s168) s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8682 reset in 697 ms.
Product exploration explored 100000 steps with 8860 reset in 552 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 511 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 586 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p2)]
[2023-03-10 23:18:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2023-03-10 23:18:36] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 23:18:37] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 23:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:18:38] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2023-03-10 23:18:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:18:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 23:18:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:18:39] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-10 23:18:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 163 ms returned sat
[2023-03-10 23:18:39] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 1 ms to minimize.
[2023-03-10 23:18:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 669 ms
[2023-03-10 23:18:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 123 ms.
[2023-03-10 23:18:40] [INFO ] Added : 11 causal constraints over 5 iterations in 332 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 196 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:18:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:40] [INFO ] Invariant cache hit.
[2023-03-10 23:18:41] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
[2023-03-10 23:18:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:41] [INFO ] Invariant cache hit.
[2023-03-10 23:18:41] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-10 23:18:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:41] [INFO ] Invariant cache hit.
[2023-03-10 23:18:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:42] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2023-03-10 23:18:42] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-10 23:18:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:42] [INFO ] Invariant cache hit.
[2023-03-10 23:18:43] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2817 ms. Remains : 184/184 places, 2108/2108 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p2)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p2)]
[2023-03-10 23:18:43] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:43] [INFO ] Invariant cache hit.
[2023-03-10 23:18:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 23:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:18:45] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2023-03-10 23:18:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:18:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 23:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:18:46] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-10 23:18:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 95 ms returned sat
[2023-03-10 23:18:46] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 1 ms to minimize.
[2023-03-10 23:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 642 ms
[2023-03-10 23:18:47] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 87 ms.
[2023-03-10 23:18:47] [INFO ] Added : 11 causal constraints over 5 iterations in 252 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Product exploration explored 100000 steps with 4691 reset in 535 ms.
Product exploration explored 100000 steps with 4777 reset in 454 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 2107
Applied a total of 2 rules in 146 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:18:48] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-10 23:18:48] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-10 23:18:49] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
[2023-03-10 23:18:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:49] [INFO ] Invariant cache hit.
[2023-03-10 23:18:49] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-10 23:18:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:49] [INFO ] Invariant cache hit.
[2023-03-10 23:18:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:50] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
[2023-03-10 23:18:50] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-10 23:18:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:50] [INFO ] Invariant cache hit.
[2023-03-10 23:18:51] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/184 places, 2107/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2733 ms. Remains : 183/184 places, 2107/2108 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 finished in 19737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 151 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:18:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 23:18:51] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 23:18:52] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
[2023-03-10 23:18:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:52] [INFO ] Invariant cache hit.
[2023-03-10 23:18:52] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-10 23:18:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:52] [INFO ] Invariant cache hit.
[2023-03-10 23:18:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:53] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1383 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 164 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2465 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-07 finished in 2611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 38 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:18:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:54] [INFO ] Invariant cache hit.
[2023-03-10 23:18:54] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
[2023-03-10 23:18:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:54] [INFO ] Invariant cache hit.
[2023-03-10 23:18:55] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-10 23:18:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:18:55] [INFO ] Invariant cache hit.
[2023-03-10 23:18:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:56] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1414 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2286 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 1 s82) (LEQ s172 s86))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-08 finished in 2441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||G(p1))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 26 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:18:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-10 23:18:56] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-10 23:18:57] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
[2023-03-10 23:18:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:57] [INFO ] Invariant cache hit.
[2023-03-10 23:18:57] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-10 23:18:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:18:57] [INFO ] Invariant cache hit.
[2023-03-10 23:18:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:18:58] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1442 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 30 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2273 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s83 s35), p0:(GT 1 s168)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 287 steps with 58 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-10 finished in 2645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 220 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:18:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-10 23:18:59] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-10 23:19:00] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2023-03-10 23:19:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:00] [INFO ] Invariant cache hit.
[2023-03-10 23:19:00] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-10 23:19:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:00] [INFO ] Invariant cache hit.
[2023-03-10 23:19:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:01] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1763 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 169 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2907 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s172 s171)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 168 reset in 589 ms.
Product exploration explored 100000 steps with 168 reset in 599 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 3979 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 236 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=118 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 209 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-10 23:19:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-10 23:19:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 23:19:04] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 23:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:19:05] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2023-03-10 23:19:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:19:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 23:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:19:06] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-10 23:19:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 23:19:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 6018 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 191 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 23:19:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:12] [INFO ] Invariant cache hit.
[2023-03-10 23:19:13] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
[2023-03-10 23:19:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:13] [INFO ] Invariant cache hit.
[2023-03-10 23:19:13] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-10 23:19:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:13] [INFO ] Invariant cache hit.
[2023-03-10 23:19:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:14] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
[2023-03-10 23:19:14] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-10 23:19:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:14] [INFO ] Invariant cache hit.
[2023-03-10 23:19:15] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2775 ms. Remains : 184/184 places, 2107/2107 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 3979 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 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 58 ms :[(NOT p0)]
Finished random walk after 236 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=59 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 199 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
[2023-03-10 23:19:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:15] [INFO ] Invariant cache hit.
[2023-03-10 23:19:16] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 23:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:19:17] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2023-03-10 23:19:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:19:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 23:19:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:19:18] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-03-10 23:19:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 441 ms returned sat
[2023-03-10 23:19:18] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 85 ms.
[2023-03-10 23:19:19] [INFO ] Added : 13 causal constraints over 4 iterations in 269 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 168 reset in 716 ms.
Product exploration explored 100000 steps with 168 reset in 674 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 142 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 23:19:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:20] [INFO ] Invariant cache hit.
[2023-03-10 23:19:21] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
[2023-03-10 23:19:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:21] [INFO ] Invariant cache hit.
[2023-03-10 23:19:21] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-10 23:19:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:21] [INFO ] Invariant cache hit.
[2023-03-10 23:19:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:22] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2023-03-10 23:19:22] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-10 23:19:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:22] [INFO ] Invariant cache hit.
[2023-03-10 23:19:23] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2511 ms. Remains : 184/184 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 finished in 24052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 27 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 23:19:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-10 23:19:23] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-10 23:19:23] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2023-03-10 23:19:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:19:23] [INFO ] Invariant cache hit.
[2023-03-10 23:19:24] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-10 23:19:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:19:24] [INFO ] Invariant cache hit.
[2023-03-10 23:19:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:27] [INFO ] Implicit Places using invariants and state equation in 3445 ms returned []
Implicit Place search using SMT with State Equation took 3728 ms to find 0 implicit places.
[2023-03-10 23:19:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 23:19:27] [INFO ] Invariant cache hit.
[2023-03-10 23:19:28] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/188 places, 2108/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5029 ms. Remains : 187/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ s170 s168), p0:(OR (AND (GT 3 s174) (GT s82 s171)) (LEQ 3 s174))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 669 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-14 finished in 5248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 161 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:19:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-10 23:19:28] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-10 23:19:29] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
[2023-03-10 23:19:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:29] [INFO ] Invariant cache hit.
[2023-03-10 23:19:29] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-10 23:19:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:29] [INFO ] Invariant cache hit.
[2023-03-10 23:19:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:30] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-10 23:19:31] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-10 23:19:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:31] [INFO ] Invariant cache hit.
[2023-03-10 23:19:31] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/188 places, 2107/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3473 ms. Remains : 186/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s173 s170), p0:(LEQ s167 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 593 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V80P50N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-15 finished in 3583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p0&&X(p1))||G(p1))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 48 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 23:19:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-10 23:19:32] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-10 23:19:33] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
[2023-03-10 23:19:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:33] [INFO ] Invariant cache hit.
[2023-03-10 23:19:33] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-10 23:19:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:33] [INFO ] Invariant cache hit.
[2023-03-10 23:19:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:34] [INFO ] Implicit Places using invariants and state equation in 972 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1252 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 185/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 48 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2133 ms. Remains : 185/188 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s84), p1:(GT 3 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5335 reset in 845 ms.
Product exploration explored 100000 steps with 4466 reset in 695 ms.
Computed a total of 168 stabilizing places and 323 stable transitions
Graph (complete) has 4143 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 449 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 569 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 16 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 23:19:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 23:19:37] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-10 23:19:37] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
[2023-03-10 23:19:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:37] [INFO ] Invariant cache hit.
[2023-03-10 23:19:38] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-10 23:19:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:38] [INFO ] Invariant cache hit.
[2023-03-10 23:19:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:39] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2023-03-10 23:19:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:39] [INFO ] Invariant cache hit.
[2023-03-10 23:19:40] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2782 ms. Remains : 185/185 places, 2107/2107 transitions.
Computed a total of 168 stabilizing places and 323 stable transitions
Graph (complete) has 4143 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 319 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 578 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5615 reset in 607 ms.
Product exploration explored 100000 steps with 4600 reset in 571 ms.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 23 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 23:19:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:42] [INFO ] Invariant cache hit.
[2023-03-10 23:19:43] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
[2023-03-10 23:19:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:43] [INFO ] Invariant cache hit.
[2023-03-10 23:19:43] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-10 23:19:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:43] [INFO ] Invariant cache hit.
[2023-03-10 23:19:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 23:19:44] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2023-03-10 23:19:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 23:19:44] [INFO ] Invariant cache hit.
[2023-03-10 23:19:45] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2599 ms. Remains : 185/185 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 finished in 13190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&F((p2||X(((p1 U p3) U (p2&&(p1 U p3))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-10 23:19:45] [INFO ] Flatten gal took : 74 ms
[2023-03-10 23:19:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-10 23:19:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 2108 transitions and 15950 arcs took 19 ms.
Total runtime 134950 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BridgeAndVehicles-PT-V80P50N10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

BK_STOP 1678490635943

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01
lola: time limit : 899 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/899 2/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 274506 m, 54901 m/sec, 2532984 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/899 5/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 597848 m, 64668 m/sec, 5792423 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/899 7/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 906312 m, 61692 m/sec, 8944820 t fired, .

Time elapsed: 15 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/899 9/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 1216993 m, 62136 m/sec, 12176474 t fired, .

Time elapsed: 20 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/899 11/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 1506026 m, 57806 m/sec, 15169861 t fired, .

Time elapsed: 25 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/899 12/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 1785006 m, 55796 m/sec, 18085586 t fired, .

Time elapsed: 30 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/899 14/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 2067524 m, 56503 m/sec, 21049158 t fired, .

Time elapsed: 35 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/899 16/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 2333689 m, 53233 m/sec, 23839349 t fired, .

Time elapsed: 40 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/899 18/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 2616324 m, 56527 m/sec, 26832304 t fired, .

Time elapsed: 45 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/899 20/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 2900652 m, 56865 m/sec, 29831359 t fired, .

Time elapsed: 50 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/899 22/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 3184082 m, 56686 m/sec, 32815706 t fired, .

Time elapsed: 55 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/899 23/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 3466532 m, 56490 m/sec, 35801789 t fired, .

Time elapsed: 60 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/899 25/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 3752693 m, 57232 m/sec, 38835463 t fired, .

Time elapsed: 65 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/899 27/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 4035030 m, 56467 m/sec, 41823060 t fired, .

Time elapsed: 70 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/899 29/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 4311773 m, 55348 m/sec, 44771943 t fired, .

Time elapsed: 75 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/899 31/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 4594379 m, 56521 m/sec, 47764013 t fired, .

Time elapsed: 80 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 8 (type EXCL) for 3 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06
lola: time limit : 1171 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1171 6/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 611326 m, 122265 m/sec, 2147788 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1171 10/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 1136832 m, 105101 m/sec, 4039790 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1171 15/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 1686594 m, 109952 m/sec, 6001566 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1171 20/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 2254278 m, 113536 m/sec, 7959294 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1171 25/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 2816016 m, 112347 m/sec, 9881235 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1171 30/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 3395029 m, 115802 m/sec, 11789036 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 8 (type EXCL) for BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 6 (type EXCL) for 3 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06
lola: time limit : 1740 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06
lola: result : true
lola: markings : 10
lola: fired transitions : 9
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11
lola: time limit : 3480 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/3480 1/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 120205 m, 24041 m/sec, 271437 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/3480 3/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 272536 m, 30466 m/sec, 652726 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/3480 4/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 421757 m, 29844 m/sec, 1021794 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/3480 5/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 572031 m, 30054 m/sec, 1392089 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/3480 6/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 718565 m, 29306 m/sec, 1752287 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/3480 7/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 854420 m, 27171 m/sec, 2082152 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/3480 8/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 987147 m, 26545 m/sec, 2405771 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 40/3480 9/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 1118161 m, 26202 m/sec, 2724686 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 45/3480 11/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 1253641 m, 27096 m/sec, 3058188 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 50/3480 12/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 1386555 m, 26582 m/sec, 3381655 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 55/3480 13/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 1517278 m, 26144 m/sec, 3698397 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 60/3480 14/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 1647009 m, 25946 m/sec, 4012657 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 65/3480 15/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 1775098 m, 25617 m/sec, 4324224 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 70/3480 16/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 1904007 m, 25781 m/sec, 4639075 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 75/3480 17/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 2047883 m, 28775 m/sec, 4993699 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 80/3480 18/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 2185112 m, 27445 m/sec, 5328653 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 85/3480 19/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 2322272 m, 27432 m/sec, 5663569 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 90/3480 20/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 2458028 m, 27151 m/sec, 5993918 t fired, .

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 95/3480 21/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 2591757 m, 26745 m/sec, 6341976 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 100/3480 22/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 2764921 m, 34632 m/sec, 6887310 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 105/3480 24/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 3004157 m, 47847 m/sec, 7740175 t fired, .

Time elapsed: 225 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 110/3480 26/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 3249409 m, 49050 m/sec, 8610718 t fired, .

Time elapsed: 230 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 115/3480 28/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 3496202 m, 49358 m/sec, 9486952 t fired, .

Time elapsed: 235 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 120/3480 30/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 3749114 m, 50582 m/sec, 10382508 t fired, .

Time elapsed: 240 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 125/3480 32/32 BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 3938212 m, 37819 m/sec, 11031332 t fired, .

Time elapsed: 245 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 250 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-01: LTL unknown AGGR
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-06: CONJ unknown CONJ
BridgeAndVehicles-PT-V80P50N10-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 250 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P50N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BridgeAndVehicles-PT-V80P50N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692300299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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