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

About the Execution of LTSMin+red for BridgeAndVehicles-PT-V80P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
883.800 160156.00 204718.00 134.20 FFTFFFFF?FFF?FT? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694500307.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-V80P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694500307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 23K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 450K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 12:51 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 47K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 202K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 588K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 25 13:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 25 13:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 818K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.1M Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.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 3.1M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678623858920

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-V80P50N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 12:24:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 12:24:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:24:20] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-12 12:24:20] [INFO ] Transformed 198 places.
[2023-03-12 12:24:20] [INFO ] Transformed 3728 transitions.
[2023-03-12 12:24:20] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 277 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-V80P50N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 3728
Applied a total of 1 rules in 93 ms. Remains 197 /198 variables (removed 1) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:24:21] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2023-03-12 12:24:21] [INFO ] Computed 6 place invariants in 23 ms
[2023-03-12 12:24:22] [INFO ] Dead Transitions using invariants and state equation in 1363 ms found 0 transitions.
[2023-03-12 12:24:22] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:22] [INFO ] Invariant cache hit.
[2023-03-12 12:24:22] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-12 12:24:22] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:22] [INFO ] Invariant cache hit.
[2023-03-12 12:24:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:24:24] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2023-03-12 12:24:24] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:24] [INFO ] Invariant cache hit.
[2023-03-12 12:24:25] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/198 places, 3728/3728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4206 ms. Remains : 197/198 places, 3728/3728 transitions.
Support contains 18 out of 197 places after structural reductions.
[2023-03-12 12:24:25] [INFO ] Flatten gal took : 232 ms
[2023-03-12 12:24:25] [INFO ] Flatten gal took : 144 ms
[2023-03-12 12:24:26] [INFO ] Input system was already deterministic with 3728 transitions.
Support contains 17 out of 197 places (down from 18) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 22) seen :17
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10018 steps, including 4 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 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 12:24:27] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:27] [INFO ] Invariant cache hit.
[2023-03-12 12:24:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 12:24:27] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-12 12:24:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 32 ms returned sat
[2023-03-12 12:24:27] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-12 12:24:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:24:30] [INFO ] After 1983ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-12 12:24:30] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 4 ms to minimize.
[2023-03-12 12:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 514 ms
[2023-03-12 12:24:30] [INFO ] After 2960ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-12 12:24:31] [INFO ] After 3763ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 1961 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 677 ms. Remains 196 /197 variables (removed 1) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:24:32] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2023-03-12 12:24:32] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:24:33] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1746 ms. Remains : 196/197 places, 3728/3728 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 164528 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164528 steps, saw 45084 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 12:24:36] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:36] [INFO ] Invariant cache hit.
[2023-03-12 12:24:36] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:24:36] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:24:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:24:36] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:24:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:24:37] [INFO ] After 361ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:24:37] [INFO ] After 787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 360 ms.
[2023-03-12 12:24:37] [INFO ] After 1472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 477 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 477 ms. Remains : 196/196 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 458 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:24:38] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:38] [INFO ] Invariant cache hit.
[2023-03-12 12:24:39] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-12 12:24:39] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:39] [INFO ] Invariant cache hit.
[2023-03-12 12:24:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:24:40] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2022 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 455 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2937 ms. Remains : 194/196 places, 3728/3728 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10004 steps, including 5 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 154607 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154607 steps, saw 42509 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 12:24:44] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2023-03-12 12:24:44] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-12 12:24:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:24:45] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:24:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:24:45] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:24:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:24:46] [INFO ] After 512ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:24:46] [INFO ] After 988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 637 ms.
[2023-03-12 12:24:47] [INFO ] After 2090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 77 ms.
Support contains 5 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 559 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 194/194 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 452 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:24:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:48] [INFO ] Invariant cache hit.
[2023-03-12 12:24:48] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-12 12:24:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:48] [INFO ] Invariant cache hit.
[2023-03-12 12:24:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:24:49] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1558 ms to find 0 implicit places.
[2023-03-12 12:24:50] [INFO ] Redundant transitions in 230 ms returned []
[2023-03-12 12:24:50] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:50] [INFO ] Invariant cache hit.
[2023-03-12 12:24:51] [INFO ] Dead Transitions using invariants and state equation in 1179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3426 ms. Remains : 194/194 places, 3728/3728 transitions.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 194 transition count 410
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3320 place count 194 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3322 place count 192 transition count 408
Applied a total of 3322 rules in 20 ms. Remains 192 /194 variables (removed 2) and now considering 408/3728 (removed 3320) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 408 rows 192 cols
[2023-03-12 12:24:51] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:24:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:24:51] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:24:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:24:51] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:24:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 12:24:51] [INFO ] After 191ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:24:52] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-12 12:24:52] [INFO ] After 909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 170 stabilizing places and 324 stable transitions
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 ms
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-00 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' '!((p0 U (G(p0)||(F(p2)&&p1))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 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 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 661 ms. Remains 195 /197 variables (removed 2) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:24:53] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:24:53] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:24:54] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
[2023-03-12 12:24:54] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:24:54] [INFO ] Invariant cache hit.
[2023-03-12 12:24:54] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-12 12:24:54] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:24:54] [INFO ] Invariant cache hit.
[2023-03-12 12:24:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:24:56] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1691 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/197 places, 3727/3728 transitions.
Applied a total of 0 rules in 484 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3979 ms. Remains : 194/197 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p2:(AND (LEQ 2 s169) (LEQ 1 s172)), p0:(GT 3 s82), p1:(AND (NOT (OR (GT 2 s169) (LEQ 3 s82))) (GT 3 s82))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-01 finished in 4264 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(G(p0))||F(p1))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 3728
Applied a total of 1 rules in 23 ms. Remains 196 /197 variables (removed 1) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:24:56] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2023-03-12 12:24:56] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:24:57] [INFO ] Dead Transitions using invariants and state equation in 1082 ms found 0 transitions.
[2023-03-12 12:24:57] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:57] [INFO ] Invariant cache hit.
[2023-03-12 12:24:58] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-12 12:24:58] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:24:58] [INFO ] Invariant cache hit.
[2023-03-12 12:24:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:00] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2212 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/197 places, 3728/3728 transitions.
Applied a total of 0 rules in 19 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3339 ms. Remains : 195/197 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s83 1), p0:(LEQ s82 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1633 ms.
Product exploration explored 100000 steps with 50000 reset in 1414 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-02 finished in 6725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p0)))))'
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 3728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 78 ms. Remains 195 /197 variables (removed 2) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:25:03] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:25:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 12:25:04] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
[2023-03-12 12:25:04] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:04] [INFO ] Invariant cache hit.
[2023-03-12 12:25:05] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-12 12:25:05] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:05] [INFO ] Invariant cache hit.
[2023-03-12 12:25:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:06] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2045 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/197 places, 3727/3728 transitions.
Applied a total of 0 rules in 24 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3353 ms. Remains : 194/197 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-03 finished in 3451 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 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 3728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 61 ms. Remains 195 /197 variables (removed 2) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:25:06] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:06] [INFO ] Invariant cache hit.
[2023-03-12 12:25:08] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
[2023-03-12 12:25:08] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:08] [INFO ] Invariant cache hit.
[2023-03-12 12:25:08] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-12 12:25:08] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:08] [INFO ] Invariant cache hit.
[2023-03-12 12:25:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:09] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2023-03-12 12:25:09] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:09] [INFO ] Invariant cache hit.
[2023-03-12 12:25:10] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/197 places, 3727/3728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3856 ms. Remains : 195/197 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-04 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:(AND (LEQ s168 1) (GT 1 s82))], 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 5 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-04 finished in 3940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 661 ms. Remains 195 /197 variables (removed 2) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:25:11] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:11] [INFO ] Invariant cache hit.
[2023-03-12 12:25:12] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
[2023-03-12 12:25:12] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:12] [INFO ] Invariant cache hit.
[2023-03-12 12:25:13] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-12 12:25:13] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:13] [INFO ] Invariant cache hit.
[2023-03-12 12:25:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:14] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2149 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 193/197 places, 3727/3728 transitions.
Applied a total of 0 rules in 748 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4630 ms. Remains : 193/197 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 1 (ADD s169 s170)) (GT 1 s83))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 657 steps with 0 reset in 11 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-05 finished in 4748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 512 ms. Remains 196 /197 variables (removed 1) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:25:16] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2023-03-12 12:25:16] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:25:17] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
[2023-03-12 12:25:17] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:25:17] [INFO ] Invariant cache hit.
[2023-03-12 12:25:17] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-12 12:25:17] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:25:17] [INFO ] Invariant cache hit.
[2023-03-12 12:25:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:19] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2235 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/197 places, 3728/3728 transitions.
Applied a total of 0 rules in 528 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4313 ms. Remains : 194/197 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s169 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 660 steps with 0 reset in 13 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-06 finished in 4413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 3727
Applied a total of 2 rules in 590 ms. Remains 196 /197 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:25:20] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 196 cols
[2023-03-12 12:25:20] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-12 12:25:21] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
[2023-03-12 12:25:21] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:21] [INFO ] Invariant cache hit.
[2023-03-12 12:25:22] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-12 12:25:22] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:22] [INFO ] Invariant cache hit.
[2023-03-12 12:25:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:24] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2394 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/197 places, 3727/3728 transitions.
Applied a total of 0 rules in 454 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4588 ms. Remains : 194/197 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-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:(GT s171 s0)], 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 172 reset in 919 ms.
Product exploration explored 100000 steps with 172 reset in 955 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 5679 edges and 194 vertex of which 193 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/194 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 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 37 ms :[(NOT p0)]
Finished random walk after 229 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=57 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-12 12:25:26] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 194 cols
[2023-03-12 12:25:27] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:25:28] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:25:28] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2023-03-12 12:25:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:25:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:25:36] [INFO ] [Nat]Absence check using state equation in 6171 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 3727/3727 transitions.
Applied a total of 0 rules in 577 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2023-03-12 12:25:36] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:36] [INFO ] Invariant cache hit.
[2023-03-12 12:25:37] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
[2023-03-12 12:25:37] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:37] [INFO ] Invariant cache hit.
[2023-03-12 12:25:38] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-12 12:25:38] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:38] [INFO ] Invariant cache hit.
[2023-03-12 12:25:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:40] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2023-03-12 12:25:40] [INFO ] Redundant transitions in 256 ms returned []
[2023-03-12 12:25:40] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:40] [INFO ] Invariant cache hit.
[2023-03-12 12:25:41] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5267 ms. Remains : 194/194 places, 3727/3727 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 5679 edges and 194 vertex of which 193 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/194 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 213 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=71 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 132 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-12 12:25:42] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:42] [INFO ] Invariant cache hit.
[2023-03-12 12:25:43] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:25:43] [INFO ] [Real]Absence check using state equation in 913 ms returned sat
[2023-03-12 12:25:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:25:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:25:48] [INFO ] [Nat]Absence check using state equation in 3320 ms returned sat
[2023-03-12 12:25:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 29 ms returned sat
[2023-03-12 12:25:48] [INFO ] Deduced a trap composed of 5 places in 421 ms of which 1 ms to minimize.
[2023-03-12 12:25:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2023-03-12 12:25:49] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 124 ms.
[2023-03-12 12:25:50] [INFO ] Added : 113 causal constraints over 36 iterations in 1709 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 172 reset in 1038 ms.
Product exploration explored 100000 steps with 172 reset in 912 ms.
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 3727/3727 transitions.
Applied a total of 0 rules in 449 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2023-03-12 12:25:53] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:53] [INFO ] Invariant cache hit.
[2023-03-12 12:25:54] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
[2023-03-12 12:25:54] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:54] [INFO ] Invariant cache hit.
[2023-03-12 12:25:54] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-12 12:25:54] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:54] [INFO ] Invariant cache hit.
[2023-03-12 12:25:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:25:56] [INFO ] Implicit Places using invariants and state equation in 1971 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
[2023-03-12 12:25:56] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-12 12:25:56] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:56] [INFO ] Invariant cache hit.
[2023-03-12 12:25:57] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5155 ms. Remains : 194/194 places, 3727/3727 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-08 finished in 38103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 3728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 43 ms. Remains 195 /197 variables (removed 2) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:25:58] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:25:58] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:25:59] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
[2023-03-12 12:25:59] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:59] [INFO ] Invariant cache hit.
[2023-03-12 12:25:59] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-12 12:25:59] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:25:59] [INFO ] Invariant cache hit.
[2023-03-12 12:25:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:00] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1821 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/197 places, 3727/3728 transitions.
Applied a total of 0 rules in 40 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2857 ms. Remains : 194/197 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 3 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7486 reset in 1461 ms.
Product exploration explored 100000 steps with 7414 reset in 1280 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/194 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
[2023-03-12 12:26:04] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 194 cols
[2023-03-12 12:26:04] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:26:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:26:05] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-12 12:26:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:26:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:26:07] [INFO ] [Nat]Absence check using state equation in 71 ms returned unsat
Proved EG p0
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-09 finished in 8975 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 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 557 ms. Remains 195 /197 variables (removed 2) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:26:07] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:26:07] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:26:08] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
[2023-03-12 12:26:08] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:26:08] [INFO ] Invariant cache hit.
[2023-03-12 12:26:09] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-12 12:26:09] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:26:09] [INFO ] Invariant cache hit.
[2023-03-12 12:26:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:10] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1891 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 193/197 places, 3727/3728 transitions.
Applied a total of 0 rules in 591 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4126 ms. Remains : 193/197 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s180 s83) (GT 1 s169))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 661 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-11 finished in 4213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 3726
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 192 transition count 3725
Applied a total of 8 rules in 632 ms. Remains 192 /197 variables (removed 5) and now considering 3725/3728 (removed 3) transitions.
[2023-03-12 12:26:11] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
// Phase 1: matrix 407 rows 192 cols
[2023-03-12 12:26:11] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 12:26:12] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-12 12:26:12] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-12 12:26:12] [INFO ] Invariant cache hit.
[2023-03-12 12:26:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:14] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2212 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/197 places, 3725/3728 transitions.
Applied a total of 0 rules in 572 ms. Remains 190 /190 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3417 ms. Remains : 190/197 places, 3725/3728 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s165 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7305 reset in 921 ms.
Product exploration explored 100000 steps with 7241 reset in 844 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
[2023-03-12 12:26:17] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
// Phase 1: matrix 407 rows 190 cols
[2023-03-12 12:26:17] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 12:26:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:26:19] [INFO ] [Real]Absence check using state equation in 976 ms returned sat
[2023-03-12 12:26:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:26:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:26:20] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-12 12:26:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 969 ms returned sat
[2023-03-12 12:26:21] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 224 transitions) in 104 ms.
[2023-03-12 12:26:21] [INFO ] Added : 38 causal constraints over 10 iterations in 433 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 3725/3725 transitions.
Applied a total of 0 rules in 455 ms. Remains 190 /190 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2023-03-12 12:26:22] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-12 12:26:22] [INFO ] Invariant cache hit.
[2023-03-12 12:26:22] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-12 12:26:22] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-12 12:26:22] [INFO ] Invariant cache hit.
[2023-03-12 12:26:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:24] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
[2023-03-12 12:26:24] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-12 12:26:24] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-12 12:26:24] [INFO ] Invariant cache hit.
[2023-03-12 12:26:25] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3408 ms. Remains : 190/190 places, 3725/3725 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
[2023-03-12 12:26:25] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-12 12:26:25] [INFO ] Invariant cache hit.
[2023-03-12 12:26:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:26:27] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2023-03-12 12:26:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:26:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:26:29] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2023-03-12 12:26:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:29] [INFO ] [Nat]Added 42 Read/Feed constraints in 951 ms returned sat
[2023-03-12 12:26:30] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 224 transitions) in 93 ms.
[2023-03-12 12:26:30] [INFO ] Added : 38 causal constraints over 10 iterations in 366 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7043 reset in 849 ms.
Product exploration explored 100000 steps with 7430 reset in 851 ms.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 3725/3725 transitions.
Applied a total of 0 rules in 450 ms. Remains 190 /190 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2023-03-12 12:26:32] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-12 12:26:32] [INFO ] Invariant cache hit.
[2023-03-12 12:26:33] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-12 12:26:33] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-12 12:26:33] [INFO ] Invariant cache hit.
[2023-03-12 12:26:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:34] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2023-03-12 12:26:34] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-12 12:26:34] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-12 12:26:34] [INFO ] Invariant cache hit.
[2023-03-12 12:26:35] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3481 ms. Remains : 190/190 places, 3725/3725 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-12 finished in 24477 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)&&F((p1||G(F(!p0)))))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 3728
Applied a total of 1 rules in 22 ms. Remains 196 /197 variables (removed 1) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:26:35] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2023-03-12 12:26:35] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:26:36] [INFO ] Dead Transitions using invariants and state equation in 941 ms found 0 transitions.
[2023-03-12 12:26:36] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:26:36] [INFO ] Invariant cache hit.
[2023-03-12 12:26:37] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-12 12:26:37] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:26:37] [INFO ] Invariant cache hit.
[2023-03-12 12:26:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:38] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2173 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/197 places, 3728/3728 transitions.
Applied a total of 0 rules in 27 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3177 ms. Remains : 194/197 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s170), p1:(GT s168 s169)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-13 finished in 3332 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||X(X(F((p1&&F(p2)))))))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 3726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 191 transition count 3724
Applied a total of 10 rules in 555 ms. Remains 191 /197 variables (removed 6) and now considering 3724/3728 (removed 4) transitions.
[2023-03-12 12:26:39] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 191 cols
[2023-03-12 12:26:39] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 12:26:40] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-12 12:26:40] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2023-03-12 12:26:40] [INFO ] Invariant cache hit.
[2023-03-12 12:26:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:41] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1770 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/197 places, 3724/3728 transitions.
Applied a total of 0 rules in 454 ms. Remains 190 /190 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2781 ms. Remains : 190/197 places, 3724/3728 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s0), p2:(LEQ s165 s184), p1:(LEQ 2 s165)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 210 reset in 1196 ms.
Product exploration explored 100000 steps with 208 reset in 980 ms.
Computed a total of 165 stabilizing places and 322 stable transitions
Computed a total of 165 stabilizing places and 322 stable transitions
Detected a total of 165/190 stabilizing places and 322/3724 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 434 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 489 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 451 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 3724/3724 transitions.
Applied a total of 0 rules in 472 ms. Remains 190 /190 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
[2023-03-12 12:26:45] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 190 cols
[2023-03-12 12:26:46] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 12:26:46] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-12 12:26:46] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2023-03-12 12:26:46] [INFO ] Invariant cache hit.
[2023-03-12 12:26:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:47] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
[2023-03-12 12:26:47] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-12 12:26:47] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2023-03-12 12:26:47] [INFO ] Invariant cache hit.
[2023-03-12 12:26:48] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3149 ms. Remains : 190/190 places, 3724/3724 transitions.
Computed a total of 165 stabilizing places and 322 stable transitions
Computed a total of 165 stabilizing places and 322 stable transitions
Detected a total of 165/190 stabilizing places and 322/3724 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 8 factoid took 321 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 485 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 366 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 209 reset in 939 ms.
Product exploration explored 100000 steps with 209 reset in 993 ms.
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 3724/3724 transitions.
Applied a total of 0 rules in 470 ms. Remains 190 /190 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
[2023-03-12 12:26:52] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2023-03-12 12:26:52] [INFO ] Invariant cache hit.
[2023-03-12 12:26:52] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-12 12:26:52] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2023-03-12 12:26:52] [INFO ] Invariant cache hit.
[2023-03-12 12:26:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:26:53] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
[2023-03-12 12:26:53] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-12 12:26:53] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2023-03-12 12:26:53] [INFO ] Invariant cache hit.
[2023-03-12 12:26:54] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3307 ms. Remains : 190/190 places, 3724/3724 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLCardinality-15 finished in 16020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(F((p1&&F(p2)))))))))'
[2023-03-12 12:26:55] [INFO ] Flatten gal took : 161 ms
[2023-03-12 12:26:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 12:26:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 3728 transitions and 28829 arcs took 40 ms.
Total runtime 155333 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1490/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1490/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1490/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-08
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-12
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-LTLCardinality-15

BK_STOP 1678624019076

--------------------
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-V80P50N20-LTLCardinality-08
ltl formula formula --ltl=/tmp/1490/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 197 places, 3728 transitions and 28829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1490/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1490/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.730 real 0.140 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1490/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1490/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V80P50N20-LTLCardinality-12
ltl formula formula --ltl=/tmp/1490/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 197 places, 3728 transitions and 28829 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.730 real 0.170 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1490/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1490/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1490/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1490/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 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-V80P50N20-LTLCardinality-15
ltl formula formula --ltl=/tmp/1490/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 197 places, 3728 transitions and 28829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1490/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1490/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.160 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1490/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1490/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 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-V80P50N20"
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-V80P50N20, 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-167813694500307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N20.tgz
mv BridgeAndVehicles-PT-V80P50N20 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 ;