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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 20K Feb 25 12:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 12:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 455K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 12:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 12:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Feb 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 856K Feb 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678615525864

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:05:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 10:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:05:28] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-12 10:05:28] [INFO ] Transformed 128 places.
[2023-03-12 10:05:28] [INFO ] Transformed 1328 transitions.
[2023-03-12 10:05:28] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 86 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:05:28] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:05:28] [INFO ] Computed 5 place invariants in 30 ms
[2023-03-12 10:05:29] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
[2023-03-12 10:05:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:29] [INFO ] Invariant cache hit.
[2023-03-12 10:05:29] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 10:05:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:29] [INFO ] Invariant cache hit.
[2023-03-12 10:05:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:30] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-12 10:05:30] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:30] [INFO ] Invariant cache hit.
[2023-03-12 10:05:30] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1328/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1976 ms. Remains : 126/128 places, 1328/1328 transitions.
Support contains 126 out of 126 places after structural reductions.
[2023-03-12 10:05:31] [INFO ] Flatten gal took : 160 ms
[2023-03-12 10:05:31] [INFO ] Flatten gal took : 139 ms
[2023-03-12 10:05:32] [INFO ] Input system was already deterministic with 1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-12 10:05:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:33] [INFO ] Invariant cache hit.
[2023-03-12 10:05:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:05:33] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:05:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-12 10:05:33] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:05:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:33] [INFO ] After 29ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:05:33] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-12 10:05:33] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 121 transition count 1324
Applied a total of 9 rules in 291 ms. Remains 121 /126 variables (removed 5) and now considering 1324/1328 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 121/126 places, 1324/1328 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 456168 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 456168 steps, saw 135674 distinct states, run finished after 3002 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:05:37] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 121 cols
[2023-03-12 10:05:37] [INFO ] Computed 4 place invariants in 21 ms
[2023-03-12 10:05:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:05:37] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:05:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:05:37] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:05:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:37] [INFO ] After 26ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:05:37] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 10:05:37] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1324/1324 transitions.
Applied a total of 0 rules in 80 ms. Remains 121 /121 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 121/121 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1324/1324 transitions.
Applied a total of 0 rules in 78 ms. Remains 121 /121 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2023-03-12 10:05:37] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:05:37] [INFO ] Invariant cache hit.
[2023-03-12 10:05:38] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-12 10:05:38] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:05:38] [INFO ] Invariant cache hit.
[2023-03-12 10:05:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:38] [INFO ] Implicit Places using invariants and state equation in 808 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1295 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/121 places, 1324/1324 transitions.
Applied a total of 0 rules in 84 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1461 ms. Remains : 119/121 places, 1324/1324 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 486169 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486169 steps, saw 143029 distinct states, run finished after 3003 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:05:42] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 119 cols
[2023-03-12 10:05:42] [INFO ] Computed 4 place invariants in 35 ms
[2023-03-12 10:05:42] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-12 10:05:42] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:05:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:05:42] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:05:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:42] [INFO ] After 51ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:05:42] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 10:05:42] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1324/1324 transitions.
Applied a total of 0 rules in 72 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 119/119 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1324/1324 transitions.
Applied a total of 0 rules in 57 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2023-03-12 10:05:42] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:05:42] [INFO ] Invariant cache hit.
[2023-03-12 10:05:42] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 10:05:42] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:05:42] [INFO ] Invariant cache hit.
[2023-03-12 10:05:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:43] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2023-03-12 10:05:43] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-12 10:05:43] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:05:43] [INFO ] Invariant cache hit.
[2023-03-12 10:05:44] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1611 ms. Remains : 119/119 places, 1324/1324 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 119 transition count 246
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 119 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1082 place count 117 transition count 244
Applied a total of 1082 rules in 14 ms. Remains 117 /119 variables (removed 2) and now considering 244/1324 (removed 1080) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 244 rows 117 cols
[2023-03-12 10:05:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 10:05:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:05:44] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:05:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:05:44] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:05:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:05:44] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:05:44] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 10:05:44] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 109 stabilizing places and 204 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((!p0&&F(G(p0))))))))'
Support contains 63 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 13 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:05:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:05:45] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 10:05:45] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
[2023-03-12 10:05:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:45] [INFO ] Invariant cache hit.
[2023-03-12 10:05:45] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-12 10:05:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:45] [INFO ] Invariant cache hit.
[2023-03-12 10:05:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:46] [INFO ] Implicit Places using invariants and state equation in 508 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 697 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 21 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1254 ms. Remains : 123/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 631 ms :[true, true, true, true, true, true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s54 1) (LT s102 1) (LT s118 1)) (OR (LT s1 1) (LT s54 1) (LT s58 1) (LT s119 1)) (OR (LT s1 1) (LT s54 1) (LT s97 1) (LT s113 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 426 steps with 1 reset in 39 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 finished in 2078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 54 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 136 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:05:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:05:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:05:47] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
[2023-03-12 10:05:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:47] [INFO ] Invariant cache hit.
[2023-03-12 10:05:47] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-12 10:05:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:47] [INFO ] Invariant cache hit.
[2023-03-12 10:05:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:48] [INFO ] Implicit Places using invariants and state equation in 473 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 678 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 167 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1517 ms. Remains : 125/126 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s52 1), p0:(OR (AND (GEQ s53 1) (GEQ s55 1) (GEQ s64 1) (GEQ s107 1)) (AND (GEQ s53 1) (GEQ s55 1) (GEQ s103 1) (GEQ s107 1)) (AND (GEQ s53 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 10 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 finished in 1787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((!p0 U p1))))))'
Support contains 64 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:05:48] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:48] [INFO ] Invariant cache hit.
[2023-03-12 10:05:49] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
[2023-03-12 10:05:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:49] [INFO ] Invariant cache hit.
[2023-03-12 10:05:49] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-12 10:05:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:49] [INFO ] Invariant cache hit.
[2023-03-12 10:05:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:50] [INFO ] Implicit Places using invariants and state equation in 700 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 885 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1567 ms. Remains : 124/126 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s109 1), p0:(OR (AND (GEQ s33 1) (GEQ s55 1) (GEQ s56 1) (GEQ s116 1)) (AND (GEQ s36 1) (GEQ s55 1) (GEQ s56 1) (GEQ s117 1)) (AND (GEQ s35 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13023 steps with 165 reset in 189 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 finished in 2140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(((X(p1)||p0) U G(!p2)))) U G((p3 U !p2))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:05:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:50] [INFO ] Invariant cache hit.
[2023-03-12 10:05:51] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
[2023-03-12 10:05:51] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:51] [INFO ] Invariant cache hit.
[2023-03-12 10:05:51] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-12 10:05:51] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:51] [INFO ] Invariant cache hit.
[2023-03-12 10:05:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:52] [INFO ] Implicit Places using invariants and state equation in 634 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 885 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1521 ms. Remains : 124/126 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 687 ms :[p2, p2, p2, p2, p2, p2, (NOT p1), (AND p2 (NOT p1)), true, (AND (NOT p0) (NOT p1) p2), p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p3), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) p3), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(OR (NOT p2) p3), acceptance={} source=2 dest: 9}, { cond=(AND p2 p3), acceptance={} source=2 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p3), acceptance={} source=3 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p3), acceptance={} source=4 dest: 3}, { cond=(AND p2 p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=9 dest: 12}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=10 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND p2 p3), acceptance={0} source=10 dest: 10}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=10 dest: 13}], [{ cond=p2, acceptance={} source=11 dest: 8}, { cond=(NOT p2), acceptance={} source=11 dest: 11}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=12 dest: 8}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=12 dest: 14}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND p3 (NOT p1))), acceptance={} source=12 dest: 15}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=13 dest: 8}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=13 dest: 14}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=14 dest: 8}, { cond=(AND p2 p3), acceptance={0} source=14 dest: 14}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=15 dest: 8}, { cond=(AND p2 p3), acceptance={} source=15 dest: 14}, { cond=(OR (NOT p2) p3), acceptance={} source=15 dest: 15}]], initial=0, aps=[p2:(LT s109 1), p3:(OR (AND (GEQ s107 1) (GEQ s123 1)) (AND (GEQ s108 1) (GEQ s123 1))), p0:(OR (AND (GEQ s53 20) (GEQ s111 1)) (AND (GEQ s53 20) (GEQ s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-05 finished in 2266 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((F(p1) U !(p1 U !p0)))))'
Support contains 104 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 14 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:05:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:05:53] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:05:53] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
[2023-03-12 10:05:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:53] [INFO ] Invariant cache hit.
[2023-03-12 10:05:53] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-12 10:05:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:53] [INFO ] Invariant cache hit.
[2023-03-12 10:05:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:54] [INFO ] Implicit Places using invariants and state equation in 418 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 582 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 975 ms. Remains : 123/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s98 1) (GEQ s111 1)) (AND (GEQ s59 1) (GEQ s111 1)) (AND (GEQ s69 1) (GEQ s111 1)) (AND (GEQ s88 1) (GEQ s111 1)) (AND (GEQ s79 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 779 steps with 2 reset in 9 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-06 finished in 1114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X((X((!p1||X((!p0||G(p0))))) U (!p0&&X((!p1||X((!p0||G(p0)))))))))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:05:54] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:05:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:05:54] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
[2023-03-12 10:05:54] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:54] [INFO ] Invariant cache hit.
[2023-03-12 10:05:55] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-12 10:05:55] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:05:55] [INFO ] Invariant cache hit.
[2023-03-12 10:05:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:55] [INFO ] Implicit Places using invariants and state equation in 584 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 821 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1284 ms. Remains : 124/126 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, p0, p0, false, false, (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s52 1), p1:(LT s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 613 ms.
Product exploration explored 100000 steps with 50000 reset in 701 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 finished in 2952 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)&&X(F(p2))))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 17 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:05:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:05:57] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 10:05:57] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
[2023-03-12 10:05:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:57] [INFO ] Invariant cache hit.
[2023-03-12 10:05:57] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-12 10:05:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:05:58] [INFO ] Invariant cache hit.
[2023-03-12 10:05:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:05:58] [INFO ] Implicit Places using invariants and state equation in 456 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 675 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1210 ms. Remains : 124/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)), p1:(AND (GEQ s109 1) (GEQ s121 1)), p2:(AND (GEQ s109 1) (GEQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 823 reset in 362 ms.
Product exploration explored 100000 steps with 824 reset in 532 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 425 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Finished random walk after 150 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 10 factoid took 466 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
[2023-03-12 10:06:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:06:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:06:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:01] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-12 10:06:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:02] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-12 10:06:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 138 ms returned sat
[2023-03-12 10:06:02] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 114 ms.
[2023-03-12 10:06:03] [INFO ] Added : 42 causal constraints over 9 iterations in 530 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-12 10:06:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:03] [INFO ] Invariant cache hit.
[2023-03-12 10:06:03] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:03] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-12 10:06:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:04] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-12 10:06:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 437 ms returned sat
[2023-03-12 10:06:05] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 57 ms.
[2023-03-12 10:06:05] [INFO ] Added : 42 causal constraints over 9 iterations in 867 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:05] [INFO ] Invariant cache hit.
[2023-03-12 10:06:06] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
[2023-03-12 10:06:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:06] [INFO ] Invariant cache hit.
[2023-03-12 10:06:06] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-12 10:06:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:06] [INFO ] Invariant cache hit.
[2023-03-12 10:06:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:06] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-12 10:06:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:06] [INFO ] Invariant cache hit.
[2023-03-12 10:06:07] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1572 ms. Remains : 124/124 places, 1327/1327 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Finished random walk after 137 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
[2023-03-12 10:06:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:08] [INFO ] Invariant cache hit.
[2023-03-12 10:06:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:08] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2023-03-12 10:06:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:09] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-12 10:06:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 102 ms returned sat
[2023-03-12 10:06:09] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 55 ms.
[2023-03-12 10:06:10] [INFO ] Added : 42 causal constraints over 10 iterations in 369 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-12 10:06:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:10] [INFO ] Invariant cache hit.
[2023-03-12 10:06:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:10] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2023-03-12 10:06:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:11] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-12 10:06:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 368 ms returned sat
[2023-03-12 10:06:11] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 52 ms.
[2023-03-12 10:06:12] [INFO ] Added : 42 causal constraints over 9 iterations in 840 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 826 reset in 537 ms.
Product exploration explored 100000 steps with 820 reset in 534 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 1327
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 104 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:14] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:06:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:06:15] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
[2023-03-12 10:06:15] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 10:06:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:15] [INFO ] Invariant cache hit.
[2023-03-12 10:06:15] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1327/1327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1357 ms. Remains : 124/124 places, 1327/1327 transitions.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:06:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:06:15] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
[2023-03-12 10:06:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:15] [INFO ] Invariant cache hit.
[2023-03-12 10:06:16] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-12 10:06:16] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:16] [INFO ] Invariant cache hit.
[2023-03-12 10:06:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:16] [INFO ] Implicit Places using invariants and state equation in 662 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 850 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1258 ms. Remains : 123/124 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 finished in 19770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(X(F(p2))||p1))))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 12 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:06:17] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:06:17] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:06:17] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
[2023-03-12 10:06:17] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:17] [INFO ] Invariant cache hit.
[2023-03-12 10:06:17] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 10:06:17] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:17] [INFO ] Invariant cache hit.
[2023-03-12 10:06:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:18] [INFO ] Implicit Places using invariants and state equation in 638 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 940 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1547 ms. Remains : 124/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s53 1) (LT s55 1) (LT s66 1) (LT s107 1)), p0:(AND (GEQ s108 1) (GEQ s113 1)), p2:(AND (GEQ s53 1) (GEQ s55 1) (GEQ s66 1) (GEQ s107 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1493 reset in 525 ms.
Product exploration explored 100000 steps with 1367 reset in 469 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 257 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 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:06:20] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:06:21] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
[2023-03-12 10:06:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:21] [INFO ] Invariant cache hit.
[2023-03-12 10:06:21] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-12 10:06:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:21] [INFO ] Invariant cache hit.
[2023-03-12 10:06:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:22] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-12 10:06:22] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:22] [INFO ] Invariant cache hit.
[2023-03-12 10:06:22] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1803 ms. Remains : 124/124 places, 1327/1327 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 117 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 82 ms :[(NOT p0), (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 : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1388 reset in 465 ms.
Product exploration explored 100000 steps with 1376 reset in 423 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 1327
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 1 rules in 139 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:24] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:06:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:06:25] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
[2023-03-12 10:06:25] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 10:06:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:25] [INFO ] Invariant cache hit.
[2023-03-12 10:06:25] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1327/1327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1195 ms. Remains : 124/124 places, 1327/1327 transitions.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:06:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:06:26] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
[2023-03-12 10:06:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:26] [INFO ] Invariant cache hit.
[2023-03-12 10:06:26] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-12 10:06:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:26] [INFO ] Invariant cache hit.
[2023-03-12 10:06:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:26] [INFO ] Implicit Places using invariants and state equation in 686 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 903 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1290 ms. Remains : 123/124 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 finished in 10081 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(p0))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 95 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:06:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:06:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:06:27] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
[2023-03-12 10:06:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:27] [INFO ] Invariant cache hit.
[2023-03-12 10:06:27] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-12 10:06:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:27] [INFO ] Invariant cache hit.
[2023-03-12 10:06:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:28] [INFO ] Implicit Places using invariants and state equation in 600 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 808 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 73 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1462 ms. Remains : 123/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s53 20) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1720 reset in 329 ms.
Product exploration explored 100000 steps with 1760 reset in 350 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-12 10:06:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:06:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:06:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:30] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2023-03-12 10:06:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:31] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2023-03-12 10:06:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 838 ms returned sat
[2023-03-12 10:06:32] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 2 ms to minimize.
[2023-03-12 10:06:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-12 10:06:32] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 36 ms.
[2023-03-12 10:06:32] [INFO ] Added : 11 causal constraints over 3 iterations in 265 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 115 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:32] [INFO ] Invariant cache hit.
[2023-03-12 10:06:32] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
[2023-03-12 10:06:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:32] [INFO ] Invariant cache hit.
[2023-03-12 10:06:33] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-12 10:06:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:33] [INFO ] Invariant cache hit.
[2023-03-12 10:06:33] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-12 10:06:33] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 10:06:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:33] [INFO ] Invariant cache hit.
[2023-03-12 10:06:33] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1613 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 71 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
[2023-03-12 10:06:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:34] [INFO ] Invariant cache hit.
[2023-03-12 10:06:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:34] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2023-03-12 10:06:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:35] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-12 10:06:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 181 ms returned sat
[2023-03-12 10:06:35] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-12 10:06:38] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3184 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1766 reset in 319 ms.
Product exploration explored 100000 steps with 1744 reset in 326 ms.
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 65 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:39] [INFO ] Invariant cache hit.
[2023-03-12 10:06:39] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
[2023-03-12 10:06:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:39] [INFO ] Invariant cache hit.
[2023-03-12 10:06:40] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-12 10:06:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:40] [INFO ] Invariant cache hit.
[2023-03-12 10:06:40] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-12 10:06:40] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 10:06:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:40] [INFO ] Invariant cache hit.
[2023-03-12 10:06:41] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1680 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 finished in 14083 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((G(p1)||p0))))'
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 91 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:06:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:06:41] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:06:41] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
[2023-03-12 10:06:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:41] [INFO ] Invariant cache hit.
[2023-03-12 10:06:41] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-12 10:06:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:41] [INFO ] Invariant cache hit.
[2023-03-12 10:06:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:42] [INFO ] Implicit Places using invariants and state equation in 654 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 845 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 86 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1517 ms. Remains : 123/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s108 1), p0:(OR (LT s1 1) (LT s53 1) (LT s92 1) (LT s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 268 reset in 533 ms.
Product exploration explored 100000 steps with 268 reset in 528 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 378 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 204202 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204202 steps, saw 59550 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:06:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:06:47] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 10:06:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:48] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:06:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:48] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:06:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:48] [INFO ] After 79ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:06:48] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-12 10:06:48] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 109 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:48] [INFO ] Invariant cache hit.
[2023-03-12 10:06:49] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 867 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 353818 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353818 steps, saw 100713 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:06:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:52] [INFO ] Invariant cache hit.
[2023-03-12 10:06:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:52] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:06:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:53] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:06:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:53] [INFO ] After 54ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:06:53] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-12 10:06:53] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 88 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 82 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:53] [INFO ] Invariant cache hit.
[2023-03-12 10:06:53] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-12 10:06:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:53] [INFO ] Invariant cache hit.
[2023-03-12 10:06:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:54] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2023-03-12 10:06:54] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 10:06:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:54] [INFO ] Invariant cache hit.
[2023-03-12 10:06:54] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1477 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1082 place count 121 transition count 247
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1084 place count 121 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1086 place count 119 transition count 245
Applied a total of 1086 rules in 11 ms. Remains 119 /123 variables (removed 4) and now considering 245/1327 (removed 1082) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 245 rows 119 cols
[2023-03-12 10:06:54] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:06:55] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:06:55] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:06:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:06:55] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:06:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:06:55] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:06:55] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-12 10:06:55] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 81 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:06:55] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:06:56] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
[2023-03-12 10:06:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:56] [INFO ] Invariant cache hit.
[2023-03-12 10:06:56] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 10:06:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:56] [INFO ] Invariant cache hit.
[2023-03-12 10:06:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:57] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2023-03-12 10:06:57] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 10:06:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:57] [INFO ] Invariant cache hit.
[2023-03-12 10:06:57] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2017 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 307162 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307162 steps, saw 88148 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:07:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:01] [INFO ] Invariant cache hit.
[2023-03-12 10:07:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:01] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:07:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:07:01] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:07:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:01] [INFO ] After 42ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:07:01] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-12 10:07:01] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 72 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:07:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:01] [INFO ] Invariant cache hit.
[2023-03-12 10:07:02] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 367557 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367557 steps, saw 104531 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:07:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:05] [INFO ] Invariant cache hit.
[2023-03-12 10:07:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:05] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:07:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:05] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:07:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:05] [INFO ] After 63ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:07:06] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-12 10:07:06] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 65 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 77 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:07:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:06] [INFO ] Invariant cache hit.
[2023-03-12 10:07:06] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-12 10:07:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:06] [INFO ] Invariant cache hit.
[2023-03-12 10:07:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:07] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2023-03-12 10:07:07] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 10:07:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:07] [INFO ] Invariant cache hit.
[2023-03-12 10:07:07] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1474 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1082 place count 121 transition count 247
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1084 place count 121 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1086 place count 119 transition count 245
Applied a total of 1086 rules in 8 ms. Remains 119 /123 variables (removed 4) and now considering 245/1327 (removed 1082) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 245 rows 119 cols
[2023-03-12 10:07:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:07:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:07] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:07:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:07] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:07:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:07:08] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:07:08] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-12 10:07:08] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 175 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 268 reset in 444 ms.
Product exploration explored 100000 steps with 268 reset in 423 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 67 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:07:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:07:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:07:09] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
[2023-03-12 10:07:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:09] [INFO ] Invariant cache hit.
[2023-03-12 10:07:10] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-12 10:07:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:10] [INFO ] Invariant cache hit.
[2023-03-12 10:07:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:10] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-03-12 10:07:10] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 10:07:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:10] [INFO ] Invariant cache hit.
[2023-03-12 10:07:11] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1896 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 finished in 30145 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)&&X(F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(X(F(p2))||p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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((G(p1)||p0))))'
[2023-03-12 10:07:11] [INFO ] Flatten gal took : 90 ms
[2023-03-12 10:07:11] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 10:07:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 1328 transitions and 10008 arcs took 12 ms.
Total runtime 103761 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1780/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1780/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1780/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1780/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLFireability-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLFireability-11
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLFireability-15

BK_STOP 1678615633884

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
ltl formula formula --ltl=/tmp/1780/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1328 transitions and 10008 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1780/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1780/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1780/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1780/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-10
ltl formula formula --ltl=/tmp/1780/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1328 transitions and 10008 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1780/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1780/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.060 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1780/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1780/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-11
ltl formula formula --ltl=/tmp/1780/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1328 transitions and 10008 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.220 real 0.020 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1780/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1780/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1780/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1780/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55a47daf13f4]
1: pnml2lts-mc(+0xa2496) [0x55a47daf1496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f0d29147140]
3: pnml2lts-mc(+0x405be5) [0x55a47de54be5]
4: pnml2lts-mc(+0x16b3f9) [0x55a47dbba3f9]
5: pnml2lts-mc(+0x164ac4) [0x55a47dbb3ac4]
6: pnml2lts-mc(+0x272e0a) [0x55a47dcc1e0a]
7: pnml2lts-mc(+0xb61f0) [0x55a47db051f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f0d28f9a4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f0d28f9a67a]
10: pnml2lts-mc(+0xa1581) [0x55a47daf0581]
11: pnml2lts-mc(+0xa1910) [0x55a47daf0910]
12: pnml2lts-mc(+0xa32a2) [0x55a47daf22a2]
13: pnml2lts-mc(+0xa50f4) [0x55a47daf40f4]
14: pnml2lts-mc(+0x3f34b3) [0x55a47de424b3]
15: pnml2lts-mc(+0x7c63d) [0x55a47dacb63d]
16: pnml2lts-mc(+0x67d86) [0x55a47dab6d86]
17: pnml2lts-mc(+0x60a8a) [0x55a47daafa8a]
18: pnml2lts-mc(+0x5eb15) [0x55a47daadb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f0d28f82d0a]
20: pnml2lts-mc(+0x6075e) [0x55a47daaf75e]
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-15
ltl formula formula --ltl=/tmp/1780/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1328 transitions and 10008 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.190 real 0.050 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1780/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1780/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1780/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1780/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 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-V50P20N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V50P20N10, examination is LTLFireability"
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-167813694400228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;