Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694500275.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V80P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694500275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 29K Feb 25 12:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 12:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 299K Feb 25 12:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 12:14 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 12K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K 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 33K Feb 25 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Feb 25 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 329K Feb 25 12:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 12:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_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-V80P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678620567921

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:29:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 11:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:29:30] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-12 11:29:30] [INFO ] Transformed 188 places.
[2023-03-12 11:29:30] [INFO ] Transformed 2108 transitions.
[2023-03-12 11:29:30] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-07 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 102 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:29:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-12 11:29:30] [INFO ] Computed 7 place invariants in 28 ms
[2023-03-12 11:29:31] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
[2023-03-12 11:29:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:29:31] [INFO ] Invariant cache hit.
[2023-03-12 11:29:31] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 11:29:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:29:31] [INFO ] Invariant cache hit.
[2023-03-12 11:29:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:29:33] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2023-03-12 11:29:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:29:33] [INFO ] Invariant cache hit.
[2023-03-12 11:29:33] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3705 ms. Remains : 188/188 places, 2108/2108 transitions.
Support contains 17 out of 188 places after structural reductions.
[2023-03-12 11:29:34] [INFO ] Flatten gal took : 163 ms
[2023-03-12 11:29:34] [INFO ] Flatten gal took : 123 ms
[2023-03-12 11:29:34] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 29) seen :24
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 11:29:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:29:35] [INFO ] Invariant cache hit.
[2023-03-12 11:29:36] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 11:29:36] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-12 11:29:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-12 11:29:36] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-12 11:29:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:29:36] [INFO ] After 321ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-12 11:29:37] [INFO ] After 827ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 416 ms.
[2023-03-12 11:29:37] [INFO ] After 1529ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 2 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.17 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 466 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 11:29:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 11:29:38] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-12 11:29:39] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1586 ms. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 224913 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224913 steps, saw 62359 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:29:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:29:42] [INFO ] Invariant cache hit.
[2023-03-12 11:29:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:29:43] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:29:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 11:29:43] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:29:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:29:43] [INFO ] After 194ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 11:29:44] [INFO ] After 679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-12 11:29:44] [INFO ] After 1352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 2 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 244 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 245 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 215 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 11:29:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:29:44] [INFO ] Invariant cache hit.
[2023-03-12 11:29:45] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-12 11:29:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:29:45] [INFO ] Invariant cache hit.
[2023-03-12 11:29:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:29:46] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1757 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 214 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 2187 ms. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 253355 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253355 steps, saw 69766 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:29:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 11:29:50] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-12 11:29:50] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:29:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:29:50] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:29:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:29:50] [INFO ] After 291ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 11:29:51] [INFO ] After 701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 361 ms.
[2023-03-12 11:29:51] [INFO ] After 1367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 2 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 186 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 162 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 11:29:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:29:51] [INFO ] Invariant cache hit.
[2023-03-12 11:29:52] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-12 11:29:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:29:52] [INFO ] Invariant cache hit.
[2023-03-12 11:29:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:29:53] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2023-03-12 11:29:53] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-12 11:29:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:29:53] [INFO ] Invariant cache hit.
[2023-03-12 11:29:53] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2127 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1740 place count 182 transition count 368
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1742 place count 182 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1744 place count 180 transition count 366
Applied a total of 1744 rules in 26 ms. Remains 180 /183 variables (removed 3) and now considering 366/2107 (removed 1741) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 366 rows 180 cols
[2023-03-12 11:29:53] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 11:29:54] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:29:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:29:54] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:29:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 11:29:54] [INFO ] After 86ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 11:29:54] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-12 11:29:54] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-13 TRUE 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.14 ms
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||(p1&&X(p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 16 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:29:54] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 11:29:54] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-12 11:29:55] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
[2023-03-12 11:29:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:29:55] [INFO ] Invariant cache hit.
[2023-03-12 11:29:55] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-12 11:29:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:29:55] [INFO ] Invariant cache hit.
[2023-03-12 11:29:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:29:56] [INFO ] Implicit Places using invariants and state equation in 789 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1186 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 12 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 1815 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s174), p0:(GT s82 s84)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1011 ms.
Product exploration explored 100000 steps with 50000 reset in 1010 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.40 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-00 finished in 4360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1&&X(p0))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 16 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:29:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:29:59] [INFO ] Invariant cache hit.
[2023-03-12 11:29:59] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
[2023-03-12 11:29:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:29:59] [INFO ] Invariant cache hit.
[2023-03-12 11:30:00] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 11:30:00] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:00] [INFO ] Invariant cache hit.
[2023-03-12 11:30:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:01] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned [82, 169]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1428 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2160 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p1:(LEQ s83 (ADD s168 s169)), p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6460 steps with 1904 reset in 85 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01 finished in 2428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1&&F(G(p2)))))))'
Support contains 10 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 528 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 11:30:02] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-12 11:30:02] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
[2023-03-12 11:30:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:02] [INFO ] Invariant cache hit.
[2023-03-12 11:30:03] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-12 11:30:03] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:03] [INFO ] Invariant cache hit.
[2023-03-12 11:30:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:03] [INFO ] Implicit Places using invariants and state equation in 798 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1097 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 225 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2544 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s82), p0:(AND (GT s173 1) (LEQ (ADD s168 s169) s84) (LEQ s83 s0)), p2:(LEQ s170 (ADD s171 s172))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 148 reset in 691 ms.
Product exploration explored 100000 steps with 148 reset in 731 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.18 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 586 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 663 steps, including 0 resets, run visited all 6 properties in 15 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (OR p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 713 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-12 11:30:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 11:30:07] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 11:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:08] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-12 11:30:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:09] [INFO ] [Nat]Absence check using state equation in 93 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (OR p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 11 factoid took 369 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-03 finished in 7975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(G(p1)&&X(p2))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 13 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 11:30:09] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 11:30:10] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
[2023-03-12 11:30:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:10] [INFO ] Invariant cache hit.
[2023-03-12 11:30:10] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-12 11:30:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:10] [INFO ] Invariant cache hit.
[2023-03-12 11:30:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:11] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1349 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 25 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 2066 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(GT 3 s0), p1:(LEQ 3 s168), p2:(LEQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 400 reset in 571 ms.
Product exploration explored 100000 steps with 393 reset in 548 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 635 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 194 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 523 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-12 11:30:14] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 11:30:14] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:30:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:15] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2023-03-12 11:30:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:16] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2023-03-12 11:30:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 464 ms returned sat
[2023-03-12 11:30:17] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 132 ms.
[2023-03-12 11:30:17] [INFO ] Added : 11 causal constraints over 3 iterations in 323 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 19 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:17] [INFO ] Invariant cache hit.
[2023-03-12 11:30:18] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
[2023-03-12 11:30:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:18] [INFO ] Invariant cache hit.
[2023-03-12 11:30:18] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 11:30:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:18] [INFO ] Invariant cache hit.
[2023-03-12 11:30:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:19] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-12 11:30:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:19] [INFO ] Invariant cache hit.
[2023-03-12 11:30:20] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2755 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.15 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 516 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 260 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 534 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-12 11:30:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:21] [INFO ] Invariant cache hit.
[2023-03-12 11:30:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:22] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2023-03-12 11:30:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:30:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:30:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:30:23] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2023-03-12 11:30:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 785 ms returned sat
[2023-03-12 11:30:24] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 107 ms.
[2023-03-12 11:30:25] [INFO ] Added : 12 causal constraints over 3 iterations in 477 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 391 reset in 541 ms.
Product exploration explored 100000 steps with 395 reset in 585 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 200 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 11:30:27] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:30:28] [INFO ] Dead Transitions using invariants and state equation in 1208 ms found 0 transitions.
[2023-03-12 11:30:28] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-12 11:30:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:28] [INFO ] Invariant cache hit.
[2023-03-12 11:30:29] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/186 places, 2108/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2365 ms. Remains : 186/186 places, 2108/2108 transitions.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 11:30:29] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:30:29] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
[2023-03-12 11:30:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:29] [INFO ] Invariant cache hit.
[2023-03-12 11:30:30] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-12 11:30:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:30] [INFO ] Invariant cache hit.
[2023-03-12 11:30:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:31] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2023-03-12 11:30:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:31] [INFO ] Invariant cache hit.
[2023-03-12 11:30:31] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2821 ms. Remains : 186/186 places, 2108/2108 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04 finished in 22784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&F((!p0&&X((!p0 U (p1||G(!p0)))))))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 36 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 11:30:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 11:30:32] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:30:33] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
[2023-03-12 11:30:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:30:33] [INFO ] Invariant cache hit.
[2023-03-12 11:30:33] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-12 11:30:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:30:33] [INFO ] Invariant cache hit.
[2023-03-12 11:30:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:34] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1323 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 25 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 2013 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, true, true, true, true, p0, (AND p0 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s167 (ADD s84 s85)), p1:(GT (ADD s84 s85) s172)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 280 steps with 1 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-05 finished in 2245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 15 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 11:30:34] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 11:30:35] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
[2023-03-12 11:30:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:35] [INFO ] Invariant cache hit.
[2023-03-12 11:30:35] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-12 11:30:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:35] [INFO ] Invariant cache hit.
[2023-03-12 11:30:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:36] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1435 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2214 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ 3 s172) (LEQ 1 s172)), p2:(GT 1 s172), p1:(GT 3 s172)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 776 ms.
Product exploration explored 100000 steps with 25000 reset in 835 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 419 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:30:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-12 11:30:39] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 11:30:39] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1 (NOT p0))), (F (NOT (AND p2 p1 (NOT p0))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 10 factoid took 216 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06 finished in 5170 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 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
Applied a total of 1 rules in 218 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 11:30:39] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-12 11:30:40] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
[2023-03-12 11:30:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:40] [INFO ] Invariant cache hit.
[2023-03-12 11:30:40] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-12 11:30:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:40] [INFO ] Invariant cache hit.
[2023-03-12 11:30:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:41] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned [82, 169]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1340 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 242 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2394 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s142 s84) (LEQ s171 s83))], 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 148 reset in 633 ms.
Product exploration explored 100000 steps with 148 reset in 647 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 23 ms :[(NOT p0)]
Finished random walk after 2889 steps, including 4 resets, run visited all 1 properties in 20 ms. (steps per millisecond=144 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 257 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-12 11:30:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:30:44] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
[2023-03-12 11:30:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:44] [INFO ] Invariant cache hit.
[2023-03-12 11:30:45] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-12 11:30:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:45] [INFO ] Invariant cache hit.
[2023-03-12 11:30:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:46] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
[2023-03-12 11:30:46] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-12 11:30:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:46] [INFO ] Invariant cache hit.
[2023-03-12 11:30:47] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3534 ms. Remains : 185/185 places, 2108/2108 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 45 ms :[(NOT p0)]
Finished random walk after 786 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=131 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 148 reset in 648 ms.
Product exploration explored 100000 steps with 148 reset in 642 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 169 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:49] [INFO ] Invariant cache hit.
[2023-03-12 11:30:49] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
[2023-03-12 11:30:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:49] [INFO ] Invariant cache hit.
[2023-03-12 11:30:50] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-12 11:30:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:50] [INFO ] Invariant cache hit.
[2023-03-12 11:30:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:50] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2023-03-12 11:30:50] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-12 11:30:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:50] [INFO ] Invariant cache hit.
[2023-03-12 11:30:51] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2435 ms. Remains : 185/185 places, 2108/2108 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08 finished in 11881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&X(p2)))'
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 12 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 11:30:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-12 11:30:51] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 11:30:52] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
[2023-03-12 11:30:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:52] [INFO ] Invariant cache hit.
[2023-03-12 11:30:52] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-12 11:30:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 11:30:52] [INFO ] Invariant cache hit.
[2023-03-12 11:30:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:53] [INFO ] Implicit Places using invariants and state equation in 803 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1051 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 10 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 1753 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s173), p0:(AND (OR (LEQ s82 s85) (LEQ 1 s173)) (LEQ s84 s86)), p2:(LEQ 3 s84)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-09 finished in 1880 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 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 22 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 11:30:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 11:30:53] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 11:30:54] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
[2023-03-12 11:30:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:30:54] [INFO ] Invariant cache hit.
[2023-03-12 11:30:54] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-12 11:30:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:30:54] [INFO ] Invariant cache hit.
[2023-03-12 11:30:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:55] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1337 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 15 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 1943 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11 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 (GT s167 s169) (GT s137 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11 finished in 2012 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))'
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 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 183 transition count 2106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 182 transition count 2105
Applied a total of 8 rules in 205 ms. Remains 182 /188 variables (removed 6) and now considering 2105/2108 (removed 3) transitions.
[2023-03-12 11:30:55] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
// Phase 1: matrix 367 rows 182 cols
[2023-03-12 11:30:55] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 11:30:56] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-12 11:30:56] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2023-03-12 11:30:56] [INFO ] Invariant cache hit.
[2023-03-12 11:30:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:57] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1549 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/188 places, 2105/2108 transitions.
Applied a total of 0 rules in 154 ms. Remains 181 /181 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1912 ms. Remains : 181/188 places, 2105/2108 transitions.
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GT 1 s140) (OR (GT 2 s167) (GT 3 s82)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 181 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14 finished in 1967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 26 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 11:30:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 11:30:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 11:30:58] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
[2023-03-12 11:30:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:30:58] [INFO ] Invariant cache hit.
[2023-03-12 11:30:58] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 11:30:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:30:58] [INFO ] Invariant cache hit.
[2023-03-12 11:30:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:30:59] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1520 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 2219 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (LEQ 3 s83) (LEQ s83 s169)), p0:(LEQ s83 s171), p2:(LEQ s83 s169)], 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 826 ms.
Product exploration explored 100000 steps with 50000 reset in 846 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/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 9 factoid took 150 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-15 finished in 4226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(G(p1)&&X(p2))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 38 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 11:31:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-12 11:31:01] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 11:31:02] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
[2023-03-12 11:31:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:02] [INFO ] Invariant cache hit.
[2023-03-12 11:31:02] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 11:31:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:02] [INFO ] Invariant cache hit.
[2023-03-12 11:31:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:31:04] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1565 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 43 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 2366 ms. Remains : 185/188 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(GT 3 s0), p1:(LEQ 3 s168), p2:(LEQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 414 reset in 636 ms.
Product exploration explored 100000 steps with 422 reset in 608 ms.
Computed a total of 168 stabilizing places and 323 stable transitions
Graph (complete) has 4143 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 763 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 253 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 882 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-12 11:31:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 11:31:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:31:08] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 11:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:31:09] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2023-03-12 11:31:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:31:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:31:10] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2023-03-12 11:31:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:31:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 242 ms returned sat
[2023-03-12 11:31:11] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 56 ms.
[2023-03-12 11:31:11] [INFO ] Added : 8 causal constraints over 3 iterations in 207 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 12 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 11:31:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:11] [INFO ] Invariant cache hit.
[2023-03-12 11:31:11] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2023-03-12 11:31:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:11] [INFO ] Invariant cache hit.
[2023-03-12 11:31:12] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-12 11:31:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:12] [INFO ] Invariant cache hit.
[2023-03-12 11:31:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:31:12] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2023-03-12 11:31:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:12] [INFO ] Invariant cache hit.
[2023-03-12 11:31:13] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2405 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.9 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 456 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 219 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=73 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 575 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-12 11:31:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:15] [INFO ] Invariant cache hit.
[2023-03-12 11:31:15] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 11:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:31:16] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2023-03-12 11:31:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:31:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:31:17] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2023-03-12 11:31:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:31:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 241 ms returned sat
[2023-03-12 11:31:18] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 71 ms.
[2023-03-12 11:31:18] [INFO ] Added : 8 causal constraints over 3 iterations in 233 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 416 reset in 641 ms.
Product exploration explored 100000 steps with 421 reset in 612 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 184 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 11:31:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:20] [INFO ] Invariant cache hit.
[2023-03-12 11:31:20] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
[2023-03-12 11:31:20] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-12 11:31:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:20] [INFO ] Invariant cache hit.
[2023-03-12 11:31:21] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1656 ms. Remains : 185/185 places, 2107/2107 transitions.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 12 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 11:31:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:21] [INFO ] Invariant cache hit.
[2023-03-12 11:31:22] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
[2023-03-12 11:31:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:22] [INFO ] Invariant cache hit.
[2023-03-12 11:31:22] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 11:31:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:22] [INFO ] Invariant cache hit.
[2023-03-12 11:31:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 11:31:23] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2023-03-12 11:31:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 11:31:23] [INFO ] Invariant cache hit.
[2023-03-12 11:31:24] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2487 ms. Remains : 185/185 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04 finished in 22498 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)))'
[2023-03-12 11:31:24] [INFO ] Flatten gal took : 104 ms
[2023-03-12 11:31:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 11:31:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 2108 transitions and 15950 arcs took 23 ms.
Total runtime 114761 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1974/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1974/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08

BK_STOP 1678620686196

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04
ltl formula formula --ltl=/tmp/1974/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 188 places, 2108 transitions and 15950 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.110 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1974/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1974/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1974/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1974/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08
ltl formula formula --ltl=/tmp/1974/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 188 places, 2108 transitions and 15950 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.110 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1974/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1974/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1974/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1974/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;