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.r037-tajo-167813690100252.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 itstools
Input is BridgeAndVehicles-PT-V50P50N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690100252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 22K Feb 25 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 247K Feb 25 12:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 950K Feb 25 12:09 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 11K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 335K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 177K Feb 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 714K Feb 25 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K 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-V50P50N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678335573431

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 04:19:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 04:19:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:19:35] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-09 04:19:35] [INFO ] Transformed 128 places.
[2023-03-09 04:19:35] [INFO ] Transformed 1328 transitions.
[2023-03-09 04:19:35] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 125 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 42 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-09 04:19:35] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-09 04:19:35] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-09 04:19:36] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
[2023-03-09 04:19:36] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:19:36] [INFO ] Invariant cache hit.
[2023-03-09 04:19:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 04:19:36] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:19:36] [INFO ] Invariant cache hit.
[2023-03-09 04:19:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:19:36] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 223 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 953 ms. Remains : 125/128 places, 1328/1328 transitions.
Support contains 125 out of 125 places after structural reductions.
[2023-03-09 04:19:37] [INFO ] Flatten gal took : 151 ms
[2023-03-09 04:19:37] [INFO ] Flatten gal took : 96 ms
[2023-03-09 04:19:37] [INFO ] Input system was already deterministic with 1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 24) seen :17
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 04:19:39] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2023-03-09 04:19:39] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 04:19:39] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:19:39] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-09 04:19:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:19:39] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-09 04:19:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:19:40] [INFO ] After 390ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-09 04:19:40] [INFO ] After 801ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 294 ms.
[2023-03-09 04:19:40] [INFO ] After 1315ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 12 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 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 122 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 33 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 120 transition count 1324
Applied a total of 9 rules in 302 ms. Remains 120 /125 variables (removed 5) and now considering 1324/1328 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 120/125 places, 1324/1328 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 339739 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 339739 steps, saw 103303 distinct states, run finished after 3002 ms. (steps per millisecond=113 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-09 04:19:44] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2023-03-09 04:19:44] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 04:19:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 04:19:44] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:19:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 04:19:45] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 04:19:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:19:45] [INFO ] After 176ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 04:19:45] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-09 04:19:45] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 104 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 120/120 places, 1324/1324 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 374674 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 374674 steps, saw 113337 distinct states, run finished after 3002 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 04:19:48] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-09 04:19:48] [INFO ] Invariant cache hit.
[2023-03-09 04:19:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 04:19:49] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:19:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 04:19:49] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 04:19:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:19:49] [INFO ] After 145ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 04:19:49] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-09 04:19:49] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 97 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 120/120 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 67 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2023-03-09 04:19:49] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-09 04:19:49] [INFO ] Invariant cache hit.
[2023-03-09 04:19:50] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-09 04:19:50] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-09 04:19:50] [INFO ] Invariant cache hit.
[2023-03-09 04:19:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:19:50] [INFO ] Implicit Places using invariants and state equation in 559 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 776 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 78 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 924 ms. Remains : 119/120 places, 1324/1324 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 394965 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394965 steps, saw 117829 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 04:19:53] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 119 cols
[2023-03-09 04:19:53] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 04:19:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 04:19:54] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:19:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 04:19:54] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 04:19:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:19:54] [INFO ] After 223ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 04:19:54] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-09 04:19:55] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 8 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 92 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 92 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 67 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2023-03-09 04:19:55] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-09 04:19:55] [INFO ] Invariant cache hit.
[2023-03-09 04:19:55] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-09 04:19:55] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-09 04:19:55] [INFO ] Invariant cache hit.
[2023-03-09 04:19:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:19:55] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-09 04:19:56] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-09 04:19:56] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-09 04:19:56] [INFO ] Invariant cache hit.
[2023-03-09 04:19:56] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1419 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 11 ms. Remains 117 /119 variables (removed 2) and now considering 244/1324 (removed 1080) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 244 rows 117 cols
[2023-03-09 04:19:56] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 04:19:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 04:19:56] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:19:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 04:19:56] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 04:19:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 04:19:56] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 04:19:56] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 04:19:56] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 108 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(G((X(p0)||(p1&&X(G(p2)))))))'
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 12 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:19:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-09 04:19:57] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:19:57] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
[2023-03-09 04:19:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:19:57] [INFO ] Invariant cache hit.
[2023-03-09 04:19:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-09 04:19:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:19:57] [INFO ] Invariant cache hit.
[2023-03-09 04:19:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:19:58] [INFO ] Implicit Places using invariants and state equation in 271 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 886 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s53 50) (GEQ s109 1)) (AND (GEQ s53 50) (GEQ s110 1))), p0:(AND (OR (LT s33 1) (LT s55 1) (LT s56 1) (LT s115 1)) (OR (LT s36 1) (LT s55 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24967 reset in 1268 ms.
Product exploration explored 100000 steps with 25004 reset in 1140 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/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 401 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 04:20:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:20:02] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-09 04:20:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:20:04] [INFO ] After 1489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 04:20:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:20:06] [INFO ] After 1617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 04:20:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:20:07] [INFO ] After 1753ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 04:20:09] [INFO ] After 3359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1533 ms.
[2023-03-09 04:20:10] [INFO ] After 6612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 114 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 119 transition count 1324
Applied a total of 7 rules in 128 ms. Remains 119 /123 variables (removed 4) and now considering 1324/1327 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 119/123 places, 1324/1327 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Finished probabilistic random walk after 694 steps, run visited all 1 properties in 11 ms. (steps per millisecond=63 )
Probabilistic random walk after 694 steps, saw 499 distinct states, run finished after 11 ms. (steps per millisecond=63 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p0))), (F p1), (F (AND (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 658 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 117 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:20:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:12] [INFO ] Invariant cache hit.
[2023-03-09 04:20:13] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
[2023-03-09 04:20:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:13] [INFO ] Invariant cache hit.
[2023-03-09 04:20:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 04:20:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:13] [INFO ] Invariant cache hit.
[2023-03-09 04:20:13] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-09 04:20:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:13] [INFO ] Invariant cache hit.
[2023-03-09 04:20:14] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1261 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/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 321 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 04:20:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:15] [INFO ] Invariant cache hit.
[2023-03-09 04:20:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:20:17] [INFO ] After 1943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 04:20:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:20:19] [INFO ] After 1580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 04:20:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:20:21] [INFO ] After 1421ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 04:20:22] [INFO ] After 2972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1537 ms.
[2023-03-09 04:20:24] [INFO ] After 6167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 114 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 119 transition count 1324
Applied a total of 7 rules in 99 ms. Remains 119 /123 variables (removed 4) and now considering 1324/1327 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 119/123 places, 1324/1327 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Finished probabilistic random walk after 694 steps, run visited all 1 properties in 13 ms. (steps per millisecond=53 )
Probabilistic random walk after 694 steps, saw 499 distinct states, run finished after 13 ms. (steps per millisecond=53 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p0))), (F p1), (F (AND (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 634 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Product exploration explored 100000 steps with 25001 reset in 1264 ms.
Product exploration explored 100000 steps with 25020 reset in 864 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 117 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 366 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:20:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:29] [INFO ] Invariant cache hit.
[2023-03-09 04:20:29] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
[2023-03-09 04:20:29] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-09 04:20:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:29] [INFO ] Invariant cache hit.
[2023-03-09 04:20:29] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1237 ms. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin17531850907313512571
[2023-03-09 04:20:30] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17531850907313512571
Running compilation step : cd /tmp/ltsmin17531850907313512571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17531850907313512571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17531850907313512571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 117 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:20:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:33] [INFO ] Invariant cache hit.
[2023-03-09 04:20:33] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
[2023-03-09 04:20:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:33] [INFO ] Invariant cache hit.
[2023-03-09 04:20:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 04:20:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:33] [INFO ] Invariant cache hit.
[2023-03-09 04:20:33] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-09 04:20:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:20:33] [INFO ] Invariant cache hit.
[2023-03-09 04:20:34] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1119 ms. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin15058688636265755090
[2023-03-09 04:20:34] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15058688636265755090
Running compilation step : cd /tmp/ltsmin15058688636265755090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2636 ms.
Running link step : cd /tmp/ltsmin15058688636265755090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin15058688636265755090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16873423006032900244.hoa' '--buchi-type=spotba'
LTSmin run took 1052 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 finished in 40683 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((G((G(p1)||p0)) U p2)))'
Support contains 67 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 114 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-09 04:20:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2023-03-09 04:20:38] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:20:38] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
[2023-03-09 04:20:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:38] [INFO ] Invariant cache hit.
[2023-03-09 04:20:38] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-09 04:20:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:38] [INFO ] Invariant cache hit.
[2023-03-09 04:20:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:20:38] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-09 04:20:38] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-09 04:20:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:38] [INFO ] Invariant cache hit.
[2023-03-09 04:20:39] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1211 ms. Remains : 125/125 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s110 1), p0:(OR (AND (GEQ s7 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s26 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s45 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 33415 steps with 79 reset in 1659 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-02 finished in 3053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0))||G(!p1)) U G(p2))))'
Support contains 66 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-09 04:20:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:41] [INFO ] Invariant cache hit.
[2023-03-09 04:20:41] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
[2023-03-09 04:20:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:41] [INFO ] Invariant cache hit.
[2023-03-09 04:20:41] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-09 04:20:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:41] [INFO ] Invariant cache hit.
[2023-03-09 04:20:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:20:42] [INFO ] Implicit Places using invariants and state equation in 649 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 795 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 11 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 1231 ms. Remains : 124/125 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s107 1) (GEQ s115 1)) (AND (GEQ s107 1) (GEQ s114 1)) (AND (GEQ s107 1) (GEQ s117 1)) (AND (GEQ s107 1) (GEQ s116 1)) (AND (GEQ s107 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4955 reset in 1286 ms.
Product exploration explored 100000 steps with 4986 reset in 983 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 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 963 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 04:20:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-09 04:20:46] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-09 04:20:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:20:47] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (NOT (AND p2 p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND p2 (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 6 factoid took 1476 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 66 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-09 04:20:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:49] [INFO ] Invariant cache hit.
[2023-03-09 04:20:49] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
[2023-03-09 04:20:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:49] [INFO ] Invariant cache hit.
[2023-03-09 04:20:49] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-09 04:20:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:49] [INFO ] Invariant cache hit.
[2023-03-09 04:20:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:20:50] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-09 04:20:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:50] [INFO ] Invariant cache hit.
[2023-03-09 04:20:50] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1490 ms. Remains : 124/124 places, 1328/1328 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 775 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 448 steps, including 1 resets, run visited all 9 properties in 22 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F p0), (F (NOT p1)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 4 factoid took 1138 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4919 reset in 1372 ms.
Product exploration explored 100000 steps with 5038 reset in 1135 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 66 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 1328
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 1 rules in 162 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-09 04:20:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-09 04:20:57] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 04:20:57] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
[2023-03-09 04:20:57] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-09 04:20:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:20:57] [INFO ] Invariant cache hit.
[2023-03-09 04:20:58] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1328/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1160 ms. Remains : 124/124 places, 1328/1328 transitions.
Built C files in :
/tmp/ltsmin16214081185959708054
[2023-03-09 04:20:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16214081185959708054
Running compilation step : cd /tmp/ltsmin16214081185959708054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2714 ms.
Running link step : cd /tmp/ltsmin16214081185959708054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16214081185959708054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased569086841869908032.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 66 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 16 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-09 04:21:13] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-09 04:21:13] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 04:21:13] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
[2023-03-09 04:21:13] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:21:13] [INFO ] Invariant cache hit.
[2023-03-09 04:21:13] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-09 04:21:13] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:21:13] [INFO ] Invariant cache hit.
[2023-03-09 04:21:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:21:14] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-09 04:21:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:21:14] [INFO ] Invariant cache hit.
[2023-03-09 04:21:14] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1280 ms. Remains : 124/124 places, 1328/1328 transitions.
Built C files in :
/tmp/ltsmin9806050953627647927
[2023-03-09 04:21:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9806050953627647927
Running compilation step : cd /tmp/ltsmin9806050953627647927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2804 ms.
Running link step : cd /tmp/ltsmin9806050953627647927;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin9806050953627647927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4193139949893369255.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 04:21:30] [INFO ] Flatten gal took : 51 ms
[2023-03-09 04:21:30] [INFO ] Flatten gal took : 47 ms
[2023-03-09 04:21:30] [INFO ] Time to serialize gal into /tmp/LTL3579252709943233986.gal : 13 ms
[2023-03-09 04:21:30] [INFO ] Time to serialize properties into /tmp/LTL2057119046777523956.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3579252709943233986.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17767028050530375407.hoa' '-atoms' '/tmp/LTL2057119046777523956.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2057119046777523956.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17767028050530375407.hoa
Detected timeout of ITS tools.
[2023-03-09 04:21:45] [INFO ] Flatten gal took : 49 ms
[2023-03-09 04:21:45] [INFO ] Flatten gal took : 48 ms
[2023-03-09 04:21:45] [INFO ] Time to serialize gal into /tmp/LTL10217997200229784697.gal : 21 ms
[2023-03-09 04:21:45] [INFO ] Time to serialize properties into /tmp/LTL2139818735326756905.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10217997200229784697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2139818735326756905.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((G(F("(SUR_PONT_B>=1)")))||(G(!("(((((((((((((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_46<1)||(COMPTEUR_6<1)))&&(((N...46369
Formula 0 simplified : X((FG!"(SUR_PONT_B>=1)" & F"(((((((((((((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_46<1)||(COMPTEUR_6<1)))&&(((NB_ATTENTE...46354
Detected timeout of ITS tools.
[2023-03-09 04:22:00] [INFO ] Flatten gal took : 82 ms
[2023-03-09 04:22:00] [INFO ] Applying decomposition
[2023-03-09 04:22:00] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1447562275749511696.txt' '-o' '/tmp/graph1447562275749511696.bin' '-w' '/tmp/graph1447562275749511696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1447562275749511696.bin' '-l' '-1' '-v' '-w' '/tmp/graph1447562275749511696.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:22:00] [INFO ] Decomposing Gal with order
[2023-03-09 04:22:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:22:01] [INFO ] Removed a total of 2333 redundant transitions.
[2023-03-09 04:22:01] [INFO ] Flatten gal took : 683 ms
[2023-03-09 04:22:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 287 labels/synchronizations in 56 ms.
[2023-03-09 04:22:01] [INFO ] Time to serialize gal into /tmp/LTL14288134544566566308.gal : 4 ms
[2023-03-09 04:22:01] [INFO ] Time to serialize properties into /tmp/LTL11097593991716488407.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14288134544566566308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11097593991716488407.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(((G(F("(u1.SUR_PONT_B>=1)")))||(G(!("(((((((((((((u0.NB_ATTENTE_A_0<1)||(u0.CONTROLEUR_1<1))||((u0.NB_ATTENTE_B_46<1)||(i2.u2.COM...54802
Formula 0 simplified : X((FG!"(u1.SUR_PONT_B>=1)" & F"(((((((((((((u0.NB_ATTENTE_A_0<1)||(u0.CONTROLEUR_1<1))||((u0.NB_ATTENTE_B_46<1)||(i2.u2.COMPTEUR_6<1...54787
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin779424771112675328
[2023-03-09 04:22:16] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin779424771112675328
Running compilation step : cd /tmp/ltsmin779424771112675328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2881 ms.
Running link step : cd /tmp/ltsmin779424771112675328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin779424771112675328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((([](<>((LTLAPp0==true)))||[](!(LTLAPp1==true))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 finished in 110777 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 53 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 80 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:22:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-09 04:22:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 04:22:32] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
[2023-03-09 04:22:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:32] [INFO ] Invariant cache hit.
[2023-03-09 04:22:32] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-09 04:22:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:32] [INFO ] Invariant cache hit.
[2023-03-09 04:22:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:33] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-09 04:22:33] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 04:22:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:33] [INFO ] Invariant cache hit.
[2023-03-09 04:22:33] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/125 places, 1327/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1597 ms. Remains : 124/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s26 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s45 1) (GEQ s52 1) (GEQ s54 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 5543 reset in 546 ms.
Product exploration explored 100000 steps with 5427 reset in 520 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 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 38 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 106 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-09 04:22:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:34] [INFO ] Invariant cache hit.
[2023-03-09 04:22:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:35] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-09 04:22:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:22:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:36] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-09 04:22:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:36] [INFO ] [Nat]Added 22 Read/Feed constraints in 88 ms returned sat
[2023-03-09 04:22:36] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 50 ms.
[2023-03-09 04:22:37] [INFO ] Added : 26 causal constraints over 6 iterations in 165 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 53 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 77 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:22:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:37] [INFO ] Invariant cache hit.
[2023-03-09 04:22:37] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
[2023-03-09 04:22:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:37] [INFO ] Invariant cache hit.
[2023-03-09 04:22:37] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-09 04:22:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:37] [INFO ] Invariant cache hit.
[2023-03-09 04:22:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:38] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-09 04:22:38] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-09 04:22:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:38] [INFO ] Invariant cache hit.
[2023-03-09 04:22:38] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1560 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 95 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 31 ms :[(NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 112 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)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-09 04:22:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:39] [INFO ] Invariant cache hit.
[2023-03-09 04:22:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:39] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-09 04:22:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:22:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:40] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-09 04:22:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 48 ms returned sat
[2023-03-09 04:22:41] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 57 ms.
[2023-03-09 04:22:41] [INFO ] Added : 26 causal constraints over 6 iterations in 225 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5433 reset in 610 ms.
Product exploration explored 100000 steps with 5446 reset in 484 ms.
Built C files in :
/tmp/ltsmin1451966787323173578
[2023-03-09 04:22:42] [INFO ] Computing symmetric may disable matrix : 1327 transitions.
[2023-03-09 04:22:42] [INFO ] Computation of Complete disable matrix. took 103 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:42] [INFO ] Computing symmetric may enable matrix : 1327 transitions.
[2023-03-09 04:22:42] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:43] [INFO ] Computing Do-Not-Accords matrix : 1327 transitions.
[2023-03-09 04:22:43] [INFO ] Computation of Completed DNA matrix. took 131 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:43] [INFO ] Built C files in 936ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1451966787323173578
Running compilation step : cd /tmp/ltsmin1451966787323173578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1451966787323173578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1451966787323173578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 53 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 111 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:22:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:46] [INFO ] Invariant cache hit.
[2023-03-09 04:22:46] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
[2023-03-09 04:22:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:46] [INFO ] Invariant cache hit.
[2023-03-09 04:22:47] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-09 04:22:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:47] [INFO ] Invariant cache hit.
[2023-03-09 04:22:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:47] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-09 04:22:47] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 04:22:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:47] [INFO ] Invariant cache hit.
[2023-03-09 04:22:47] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1528 ms. Remains : 124/124 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin13746333707770629627
[2023-03-09 04:22:47] [INFO ] Computing symmetric may disable matrix : 1327 transitions.
[2023-03-09 04:22:47] [INFO ] Computation of Complete disable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:48] [INFO ] Computing symmetric may enable matrix : 1327 transitions.
[2023-03-09 04:22:48] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:48] [INFO ] Computing Do-Not-Accords matrix : 1327 transitions.
[2023-03-09 04:22:48] [INFO ] Computation of Completed DNA matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:48] [INFO ] Built C files in 668ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13746333707770629627
Running compilation step : cd /tmp/ltsmin13746333707770629627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13746333707770629627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13746333707770629627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 04:22:51] [INFO ] Flatten gal took : 36 ms
[2023-03-09 04:22:51] [INFO ] Flatten gal took : 37 ms
[2023-03-09 04:22:51] [INFO ] Time to serialize gal into /tmp/LTL17393756580955835199.gal : 7 ms
[2023-03-09 04:22:51] [INFO ] Time to serialize properties into /tmp/LTL10112078668959514898.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17393756580955835199.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10498263785560143947.hoa' '-atoms' '/tmp/LTL10112078668959514898.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10112078668959514898.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10498263785560143947.hoa
Detected timeout of ITS tools.
[2023-03-09 04:23:06] [INFO ] Flatten gal took : 75 ms
[2023-03-09 04:23:06] [INFO ] Flatten gal took : 52 ms
[2023-03-09 04:23:06] [INFO ] Time to serialize gal into /tmp/LTL5516848537504065888.gal : 8 ms
[2023-03-09 04:23:06] [INFO ] Time to serialize properties into /tmp/LTL3991058176553281609.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5516848537504065888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3991058176553281609.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))||(((NB_ATTENTE_A_25>=1)&&(ATTENTE_A>=1))&&((CA...4018
Formula 0 simplified : G!"(((((((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))||(((NB_ATTENTE_A_25>=1)&&(ATTENTE_A>=1))&&((CAP...4014
Detected timeout of ITS tools.
[2023-03-09 04:23:22] [INFO ] Flatten gal took : 67 ms
[2023-03-09 04:23:22] [INFO ] Applying decomposition
[2023-03-09 04:23:22] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17786058634707231012.txt' '-o' '/tmp/graph17786058634707231012.bin' '-w' '/tmp/graph17786058634707231012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17786058634707231012.bin' '-l' '-1' '-v' '-w' '/tmp/graph17786058634707231012.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:23:22] [INFO ] Decomposing Gal with order
[2023-03-09 04:23:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:23:22] [INFO ] Removed a total of 2490 redundant transitions.
[2023-03-09 04:23:22] [INFO ] Flatten gal took : 227 ms
[2023-03-09 04:23:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 432 labels/synchronizations in 12 ms.
[2023-03-09 04:23:22] [INFO ] Time to serialize gal into /tmp/LTL14813245265300380279.gal : 2 ms
[2023-03-09 04:23:22] [INFO ] Time to serialize properties into /tmp/LTL15347626232409397543.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14813245265300380279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15347626232409397543.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((i1.u5.NB_ATTENTE_A_6>=1)&&(i1.u0.ATTENTE_A>=1))&&((u1.CAPACITE>=1)&&(i2.u6.CONTROLEUR_1>=1)))||(((i1.u5.NB_ATTENTE_A_25...5068
Formula 0 simplified : G!"(((((((((i1.u5.NB_ATTENTE_A_6>=1)&&(i1.u0.ATTENTE_A>=1))&&((u1.CAPACITE>=1)&&(i2.u6.CONTROLEUR_1>=1)))||(((i1.u5.NB_ATTENTE_A_25>...5064
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2454447048688597819
[2023-03-09 04:23:37] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2454447048688597819
Running compilation step : cd /tmp/ltsmin2454447048688597819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2670 ms.
Running link step : cd /tmp/ltsmin2454447048688597819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin2454447048688597819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-06 finished in 80908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 22 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:23:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:52] [INFO ] Invariant cache hit.
[2023-03-09 04:23:53] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
[2023-03-09 04:23:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:53] [INFO ] Invariant cache hit.
[2023-03-09 04:23:53] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-09 04:23:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:53] [INFO ] Invariant cache hit.
[2023-03-09 04:23:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:23:53] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 626 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1028 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s44 1) (GEQ s55 1) (GEQ s56 1) (GEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-08 finished in 1133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 11 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:23:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:53] [INFO ] Invariant cache hit.
[2023-03-09 04:23:54] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
[2023-03-09 04:23:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:54] [INFO ] Invariant cache hit.
[2023-03-09 04:23:54] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-09 04:23:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:54] [INFO ] Invariant cache hit.
[2023-03-09 04:23:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:23:54] [INFO ] Implicit Places using invariants and state equation in 451 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 611 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 5 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 966 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s98 1) (GEQ s111 1)), p0:(AND (GEQ s107 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-09 finished in 1084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (X(p2)&&p1)))'
Support contains 8 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 10 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:23:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:54] [INFO ] Invariant cache hit.
[2023-03-09 04:23:55] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
[2023-03-09 04:23:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:55] [INFO ] Invariant cache hit.
[2023-03-09 04:23:55] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-09 04:23:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:55] [INFO ] Invariant cache hit.
[2023-03-09 04:23:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:23:55] [INFO ] Implicit Places using invariants and state equation in 451 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 651 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 5 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 1001 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), true, p0, (NOT p2), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s107 1) (GEQ s122 1)), p0:(AND (GEQ s17 1) (GEQ s55 1) (GEQ s56 1) (GEQ s115 1)), p2:(AND (GEQ s53 50) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 236 reset in 414 ms.
Product exploration explored 100000 steps with 236 reset in 393 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1439 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p2)), true, p0, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 04:23:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:23:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 04:23:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:23:59] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-09 04:23:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 04:23:59] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 04:23:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:23:59] [INFO ] After 138ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-09 04:23:59] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-09 04:24:00] [INFO ] After 662ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 8 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 91 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:24:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:00] [INFO ] Invariant cache hit.
[2023-03-09 04:24:00] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 435141 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 435141 steps, saw 118959 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 04:24:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:04] [INFO ] Invariant cache hit.
[2023-03-09 04:24:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:24:04] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 04:24:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:24:04] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 04:24:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:04] [INFO ] After 652ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 04:24:05] [INFO ] After 809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-09 04:24:05] [INFO ] After 1123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 8 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 100 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 100 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 81 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:24:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:05] [INFO ] Invariant cache hit.
[2023-03-09 04:24:05] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-09 04:24:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:05] [INFO ] Invariant cache hit.
[2023-03-09 04:24:06] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-09 04:24:06] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-09 04:24:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:06] [INFO ] Invariant cache hit.
[2023-03-09 04:24:06] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1170 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 122 transition count 248
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1082 place count 122 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1084 place count 120 transition count 246
Applied a total of 1084 rules in 11 ms. Remains 120 /123 variables (removed 3) and now considering 246/1327 (removed 1081) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 246 rows 120 cols
[2023-03-09 04:24:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 04:24:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:24:06] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 04:24:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:24:06] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 04:24:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 04:24:06] [INFO ] After 72ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 04:24:07] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-09 04:24:07] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 23 factoid took 1596 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
[2023-03-09 04:24:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:24:09] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 04:24:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:24:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:24:09] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-09 04:24:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:24:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:24:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:24:10] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-09 04:24:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 541 ms returned sat
[2023-03-09 04:24:10] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 48 ms.
[2023-03-09 04:24:10] [INFO ] Added : 10 causal constraints over 2 iterations in 118 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-09 04:24:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:11] [INFO ] Invariant cache hit.
[2023-03-09 04:24:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:24:11] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-09 04:24:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:24:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:24:11] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-09 04:24:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 424 ms returned sat
[2023-03-09 04:24:12] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2023-03-09 04:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-09 04:24:12] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 39 ms.
[2023-03-09 04:24:13] [INFO ] Added : 11 causal constraints over 5 iterations in 383 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 11 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:24:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:13] [INFO ] Invariant cache hit.
[2023-03-09 04:24:13] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
[2023-03-09 04:24:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:13] [INFO ] Invariant cache hit.
[2023-03-09 04:24:13] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-09 04:24:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:13] [INFO ] Invariant cache hit.
[2023-03-09 04:24:14] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-09 04:24:14] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:14] [INFO ] Invariant cache hit.
[2023-03-09 04:24:14] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1376 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p1))), true, (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 582 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 04:24:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:15] [INFO ] Invariant cache hit.
[2023-03-09 04:24:15] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:24:15] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:24:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:24:15] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 04:24:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:15] [INFO ] After 202ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 04:24:16] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-09 04:24:16] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 6 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 85 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:24:16] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:16] [INFO ] Invariant cache hit.
[2023-03-09 04:24:16] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 404611 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404611 steps, saw 110768 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 04:24:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:20] [INFO ] Invariant cache hit.
[2023-03-09 04:24:20] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:24:20] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:24:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:24:20] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 04:24:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:20] [INFO ] After 224ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 04:24:20] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-09 04:24:20] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 6 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 81 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 81 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 65 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:24:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:21] [INFO ] Invariant cache hit.
[2023-03-09 04:24:21] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-09 04:24:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:21] [INFO ] Invariant cache hit.
[2023-03-09 04:24:21] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-09 04:24:21] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-09 04:24:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:21] [INFO ] Invariant cache hit.
[2023-03-09 04:24:22] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1194 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 122 transition count 248
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1082 place count 122 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1084 place count 120 transition count 246
Applied a total of 1084 rules in 9 ms. Remains 120 /123 variables (removed 3) and now considering 246/1327 (removed 1081) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 246 rows 120 cols
[2023-03-09 04:24:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:24:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:24:22] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:24:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:24:22] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 04:24:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 04:24:22] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 04:24:22] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-09 04:24:22] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p1))), true, (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 16 factoid took 1051 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
[2023-03-09 04:24:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:24:23] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 04:24:24] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-09 04:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:24:24] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2023-03-09 04:24:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:24:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:24:25] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-09 04:24:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 442 ms returned sat
[2023-03-09 04:24:25] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 46 ms.
[2023-03-09 04:24:25] [INFO ] Added : 10 causal constraints over 2 iterations in 135 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-09 04:24:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:25] [INFO ] Invariant cache hit.
[2023-03-09 04:24:26] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:24:26] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-09 04:24:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:24:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:24:26] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-03-09 04:24:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 661 ms returned sat
[2023-03-09 04:24:27] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-09 04:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-09 04:24:27] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 53 ms.
[2023-03-09 04:24:28] [INFO ] Added : 11 causal constraints over 5 iterations in 419 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Product exploration explored 100000 steps with 236 reset in 531 ms.
Product exploration explored 100000 steps with 236 reset in 453 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Support contains 8 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 89 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:24:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:29] [INFO ] Invariant cache hit.
[2023-03-09 04:24:30] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
[2023-03-09 04:24:30] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-09 04:24:30] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:30] [INFO ] Invariant cache hit.
[2023-03-09 04:24:30] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1016 ms. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin2650848181408739514
[2023-03-09 04:24:30] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2650848181408739514
Running compilation step : cd /tmp/ltsmin2650848181408739514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2506 ms.
Running link step : cd /tmp/ltsmin2650848181408739514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin2650848181408739514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16392082876278699645.hoa' '--buchi-type=spotba'
LTSmin run took 759 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-12 finished in 39086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F((p1||G(p0)))))'
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 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 124 transition count 1327
Applied a total of 2 rules in 99 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:24:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-09 04:24:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 04:24:34] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
[2023-03-09 04:24:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:34] [INFO ] Invariant cache hit.
[2023-03-09 04:24:34] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-09 04:24:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:34] [INFO ] Invariant cache hit.
[2023-03-09 04:24:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:35] [INFO ] Implicit Places using invariants and state equation in 516 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 723 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1319 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(GEQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3850 reset in 415 ms.
Product exploration explored 100000 steps with 3798 reset in 355 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 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 529 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 44 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 640 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-09 04:24:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:24:38] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:24:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 10 factoid took 240 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-13 finished in 4617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 7 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 19 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:24:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-09 04:24:38] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:24:39] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
[2023-03-09 04:24:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:39] [INFO ] Invariant cache hit.
[2023-03-09 04:24:39] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-09 04:24:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:39] [INFO ] Invariant cache hit.
[2023-03-09 04:24:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:39] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-09 04:24:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:39] [INFO ] Invariant cache hit.
[2023-03-09 04:24:40] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 1327/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1677 ms. Remains : 124/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s55 1) (LT s65 1) (LT s121 1)), p0:(OR (LT s26 1) (LT s52 1) (LT s54 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 689 ms.
Product exploration explored 100000 steps with 50000 reset in 784 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), (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)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-14 finished in 3458 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((!p1||X((X(X(!p2)) U (!p1&&X(X(!p2)))))))))'
Support contains 7 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-09 04:24:42] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2023-03-09 04:24:42] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:24:42] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
[2023-03-09 04:24:42] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:24:42] [INFO ] Invariant cache hit.
[2023-03-09 04:24:42] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-09 04:24:42] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-09 04:24:42] [INFO ] Invariant cache hit.
[2023-03-09 04:24:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:43] [INFO ] Implicit Places using invariants and state equation in 524 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 710 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/125 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 1179 ms. Remains : 124/125 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (OR p2 p1), p2, p2, true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 6}, { cond=(AND p0 p2), acceptance={} source=9 dest: 10}], [{ cond=(NOT p0), acceptance={} source=10 dest: 6}, { cond=p0, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s55 1) (GEQ s56 1) (GEQ s123 1)), p1:(GEQ s52 1), p2:(AND (GEQ s0 1) (GEQ s39 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 738 ms.
Product exploration explored 100000 steps with 50000 reset in 556 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 11 factoid took 221 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-15 finished in 3126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0))||G(!p1)) U G(p2))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-03
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 66 out of 125 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 125/125 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 124 transition count 1327
Applied a total of 2 rules in 31 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:24:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-09 04:24:45] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:24:46] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
[2023-03-09 04:24:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:46] [INFO ] Invariant cache hit.
[2023-03-09 04:24:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 04:24:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:46] [INFO ] Invariant cache hit.
[2023-03-09 04:24:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:46] [INFO ] Implicit Places using invariants and state equation in 390 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 502 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 13 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 934 ms. Remains : 123/125 places, 1327/1328 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s106 1) (GEQ s114 1)) (AND (GEQ s106 1) (GEQ s113 1)) (AND (GEQ s106 1) (GEQ s116 1)) (AND (GEQ s106 1) (GEQ s115 1)) (AND (GEQ s106 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5531 reset in 1060 ms.
Product exploration explored 100000 steps with 5754 reset in 935 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/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 940 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 04:24:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:24:50] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:24:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:24:50] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (NOT (AND p2 p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND p2 (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 6 factoid took 1459 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 66 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:24:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:52] [INFO ] Invariant cache hit.
[2023-03-09 04:24:53] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
[2023-03-09 04:24:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:53] [INFO ] Invariant cache hit.
[2023-03-09 04:24:53] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 04:24:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:53] [INFO ] Invariant cache hit.
[2023-03-09 04:24:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:24:53] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-09 04:24:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:24:53] [INFO ] Invariant cache hit.
[2023-03-09 04:24:54] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1306 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/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 780 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 381 steps, including 1 resets, run visited all 9 properties in 29 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F p0), (F (NOT p1)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 4 factoid took 1363 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5474 reset in 1266 ms.
Product exploration explored 100000 steps with 5649 reset in 987 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 66 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 87 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:25:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:25:00] [INFO ] Invariant cache hit.
[2023-03-09 04:25:01] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
[2023-03-09 04:25:01] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-09 04:25:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:25:01] [INFO ] Invariant cache hit.
[2023-03-09 04:25:01] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1024 ms. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin5511645802255649427
[2023-03-09 04:25:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5511645802255649427
Running compilation step : cd /tmp/ltsmin5511645802255649427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2640 ms.
Running link step : cd /tmp/ltsmin5511645802255649427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5511645802255649427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4814199335481035489.hoa' '--buchi-type=spotba'
LTSmin run took 10012 ms.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 finished in 28981 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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))'
[2023-03-09 04:25:14] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9021582528896592106
[2023-03-09 04:25:14] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2023-03-09 04:25:14] [INFO ] Applying decomposition
[2023-03-09 04:25:14] [INFO ] Flatten gal took : 34 ms
[2023-03-09 04:25:14] [INFO ] Computation of Complete disable matrix. took 72 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:25:14] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2023-03-09 04:25:14] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9340648472901914442.txt' '-o' '/tmp/graph9340648472901914442.bin' '-w' '/tmp/graph9340648472901914442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9340648472901914442.bin' '-l' '-1' '-v' '-w' '/tmp/graph9340648472901914442.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:25:14] [INFO ] Decomposing Gal with order
[2023-03-09 04:25:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:25:15] [INFO ] Removed a total of 2432 redundant transitions.
[2023-03-09 04:25:15] [INFO ] Flatten gal took : 333 ms
[2023-03-09 04:25:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 385 labels/synchronizations in 13 ms.
[2023-03-09 04:25:15] [INFO ] Time to serialize gal into /tmp/LTLFireability10014426574068731803.gal : 2 ms
[2023-03-09 04:25:15] [INFO ] Time to serialize properties into /tmp/LTLFireability8469853804356549045.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10014426574068731803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8469853804356549045.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((i1.u2.NB_ATTENTE_A_6>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u1.CAPACITE>=1)&&(u3.CONTROLEUR_1>=1)))||(((i1.u2.NB_ATTENTE_A_25...5068
Formula 0 simplified : G!"(((((((((i1.u2.NB_ATTENTE_A_6>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u1.CAPACITE>=1)&&(u3.CONTROLEUR_1>=1)))||(((i1.u2.NB_ATTENTE_A_25>...5064
[2023-03-09 04:25:15] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2023-03-09 04:25:15] [INFO ] Computation of Completed DNA matrix. took 67 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:25:15] [INFO ] Built C files in 993ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9021582528896592106
Running compilation step : cd /tmp/ltsmin9021582528896592106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 6861 ms.
Running link step : cd /tmp/ltsmin9021582528896592106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin9021582528896592106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp3==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 04:47:08] [INFO ] Flatten gal took : 114 ms
[2023-03-09 04:47:08] [INFO ] Time to serialize gal into /tmp/LTLFireability6507589894597143468.gal : 26 ms
[2023-03-09 04:47:08] [INFO ] Time to serialize properties into /tmp/LTLFireability2715490908645980395.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6507589894597143468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2715490908645980395.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))||(((NB_ATTENTE_A_25>=1)&&(ATTENTE_A>=1))&&((CA...4018
Formula 0 simplified : G!"(((((((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))||(((NB_ATTENTE_A_25>=1)&&(ATTENTE_A>=1))&&((CAP...4014
Detected timeout of ITS tools.
[2023-03-09 05:09:02] [INFO ] Flatten gal took : 99 ms
[2023-03-09 05:09:02] [INFO ] Input system was already deterministic with 1328 transitions.
[2023-03-09 05:09:02] [INFO ] Transformed 125 places.
[2023-03-09 05:09:02] [INFO ] Transformed 1328 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 05:09:03] [INFO ] Time to serialize gal into /tmp/LTLFireability16778394532175654136.gal : 7 ms
[2023-03-09 05:09:03] [INFO ] Time to serialize properties into /tmp/LTLFireability3470784879440724075.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16778394532175654136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3470784879440724075.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(((((((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))||(((NB_ATTENTE_A_25>=1)&&(ATTENTE_A>=1))&&((CA...4018
Formula 0 simplified : G!"(((((((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))||(((NB_ATTENTE_A_25>=1)&&(ATTENTE_A>=1))&&((CAP...4014
LTSmin run took 2846328 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 3193839 ms.

BK_STOP 1678338769052

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-V50P50N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BridgeAndVehicles-PT-V50P50N10, 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 r037-tajo-167813690100252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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