Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 23K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 450K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 202K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 588K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 25 13:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 25 13:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 818K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.1M Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678624032457

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 12:27:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 12:27:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:27:14] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-12 12:27:14] [INFO ] Transformed 198 places.
[2023-03-12 12:27:14] [INFO ] Transformed 3728 transitions.
[2023-03-12 12:27:14] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 196 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 3728
Applied a total of 2 rules in 68 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:27:15] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2023-03-12 12:27:15] [INFO ] Computed 5 place invariants in 20 ms
[2023-03-12 12:27:16] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
[2023-03-12 12:27:16] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:27:16] [INFO ] Invariant cache hit.
[2023-03-12 12:27:16] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 12:27:16] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:27:16] [INFO ] Invariant cache hit.
[2023-03-12 12:27:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:27:16] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-12 12:27:16] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:27:16] [INFO ] Invariant cache hit.
[2023-03-12 12:27:17] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/198 places, 3728/3728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2836 ms. Remains : 196/198 places, 3728/3728 transitions.
Support contains 196 out of 196 places after structural reductions.
[2023-03-12 12:27:18] [INFO ] Flatten gal took : 308 ms
[2023-03-12 12:27:19] [INFO ] Flatten gal took : 289 ms
[2023-03-12 12:27:20] [INFO ] Input system was already deterministic with 3728 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1380 ms. (steps per millisecond=7 ) properties (out of 19) seen :13
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 1337 ms. (steps per millisecond=7 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 12:27:23] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:27:23] [INFO ] Invariant cache hit.
[2023-03-12 12:27:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:27:23] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:27:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:27:24] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:27:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:27:33] [INFO ] After 9551ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 12:27:43] [INFO ] After 18788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 252 ms.
[2023-03-12 12:27:43] [INFO ] After 19367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 10 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 711 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:27:44] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:27:44] [INFO ] Invariant cache hit.
[2023-03-12 12:27:45] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2090 ms. Remains : 196/196 places, 3728/3728 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 179818 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179818 steps, saw 49162 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 12:27:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:27:48] [INFO ] Invariant cache hit.
[2023-03-12 12:27:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:27:49] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:27:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:27:49] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:27:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:27:59] [INFO ] After 9606ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 12:27:59] [INFO ] After 10105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-12 12:28:00] [INFO ] After 10713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 10 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 538 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 539 ms. Remains : 196/196 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 475 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:28:01] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:28:01] [INFO ] Invariant cache hit.
[2023-03-12 12:28:01] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-12 12:28:01] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:28:01] [INFO ] Invariant cache hit.
[2023-03-12 12:28:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:28:02] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1853 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 515 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2846 ms. Remains : 194/196 places, 3728/3728 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 182143 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182143 steps, saw 49788 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 12:28:07] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2023-03-12 12:28:07] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-12 12:28:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:28:07] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:28:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:28:07] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:28:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:28:08] [INFO ] After 323ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:28:08] [INFO ] After 1135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13404 ms.
[2023-03-12 12:28:22] [INFO ] After 14849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 194 ms.
Support contains 10 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 545 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 194/194 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 595 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:28:23] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:28:23] [INFO ] Invariant cache hit.
[2023-03-12 12:28:23] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-12 12:28:23] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:28:23] [INFO ] Invariant cache hit.
[2023-03-12 12:28:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:28:24] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
[2023-03-12 12:28:25] [INFO ] Redundant transitions in 221 ms returned []
[2023-03-12 12:28:25] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:28:25] [INFO ] Invariant cache hit.
[2023-03-12 12:28:26] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3246 ms. Remains : 194/194 places, 3728/3728 transitions.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 194 transition count 410
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 3322 place count 192 transition count 408
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3324 place count 192 transition count 406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3326 place count 190 transition count 406
Applied a total of 3326 rules in 27 ms. Remains 190 /194 variables (removed 4) and now considering 406/3728 (removed 3322) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 406 rows 190 cols
[2023-03-12 12:28:26] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:28:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:28:26] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:28:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:28:26] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:28:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 12:28:26] [INFO ] After 58ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:28:26] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-12 12:28:26] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 169 stabilizing places and 324 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' '!(G(F((p0||G(p1)))))'
Support contains 104 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 958 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:28:28] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:28:28] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 12:28:29] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
[2023-03-12 12:28:29] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:28:29] [INFO ] Invariant cache hit.
[2023-03-12 12:28:29] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-12 12:28:29] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:28:29] [INFO ] Invariant cache hit.
[2023-03-12 12:28:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:28:30] [INFO ] Implicit Places using invariants and state equation in 900 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1094 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 568 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3624 ms. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s79 1) (GEQ s84 1) (GEQ s85 1) (GEQ s180 1)) (AND (GEQ s45 1) (GEQ s84 1) (GEQ s85 1) (GEQ s192 1)) (AND (GEQ s25 1) (GEQ s84 1) (GEQ s85...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 996 reset in 9896 ms.
Product exploration explored 100000 steps with 994 reset in 9857 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/193 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3579 steps, including 6 resets, run visited all 2 properties in 211 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-12 12:28:52] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2023-03-12 12:28:53] [INFO ] Computed 5 place invariants in 2 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 12:29:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p0))
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 104 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 539 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2023-03-12 12:29:24] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:29:24] [INFO ] Invariant cache hit.
[2023-03-12 12:29:25] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
[2023-03-12 12:29:25] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:29:25] [INFO ] Invariant cache hit.
[2023-03-12 12:29:25] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-12 12:29:25] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:29:25] [INFO ] Invariant cache hit.
[2023-03-12 12:29:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:29:26] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2023-03-12 12:29:26] [INFO ] Redundant transitions in 267 ms returned []
[2023-03-12 12:29:26] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:29:26] [INFO ] Invariant cache hit.
[2023-03-12 12:29:27] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4163 ms. Remains : 193/193 places, 3727/3727 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/193 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 5937 steps, including 10 resets, run visited all 2 properties in 326 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-12 12:29:29] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:29:30] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 12:30:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p0))
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1055 reset in 9800 ms.
Product exploration explored 100000 steps with 1001 reset in 9805 ms.
Support contains 104 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 575 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2023-03-12 12:30:20] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:20] [INFO ] Invariant cache hit.
[2023-03-12 12:30:21] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
[2023-03-12 12:30:21] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:21] [INFO ] Invariant cache hit.
[2023-03-12 12:30:21] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 12:30:21] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:21] [INFO ] Invariant cache hit.
[2023-03-12 12:30:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:22] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2023-03-12 12:30:22] [INFO ] Redundant transitions in 191 ms returned []
[2023-03-12 12:30:22] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:22] [INFO ] Invariant cache hit.
[2023-03-12 12:30:24] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3972 ms. Remains : 193/193 places, 3727/3727 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-00 finished in 117325 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(G(p1)))))'
Support contains 184 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 193 transition count 3726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 191 transition count 3724
Applied a total of 9 rules in 635 ms. Remains 191 /196 variables (removed 5) and now considering 3724/3728 (removed 4) transitions.
[2023-03-12 12:30:25] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 191 cols
[2023-03-12 12:30:25] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 12:30:25] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-12 12:30:25] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:26] [INFO ] Implicit Places using invariants and state equation in 958 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1168 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/196 places, 3724/3728 transitions.
Applied a total of 0 rules in 552 ms. Remains 189 /189 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2356 ms. Remains : 189/196 places, 3724/3728 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s159 1) (GEQ s167 1)) (AND (GEQ s140 1) (GEQ s167 1)) (AND (GEQ s101 1) (GEQ s167 1)) (AND (GEQ s120 1) (GEQ s167 1)) (AND (GEQ s139 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 489 steps with 0 reset in 52 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-01 finished in 2600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 520 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:30:27] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:30:27] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 12:30:28] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
[2023-03-12 12:30:28] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:28] [INFO ] Invariant cache hit.
[2023-03-12 12:30:29] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-12 12:30:29] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:29] [INFO ] Invariant cache hit.
[2023-03-12 12:30:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:30] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1745 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 561 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3823 ms. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 172 reset in 1074 ms.
Product exploration explored 100000 steps with 172 reset in 902 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/193 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 600 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2023-03-12 12:30:34] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2023-03-12 12:30:34] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 12:30:35] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
[2023-03-12 12:30:35] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:35] [INFO ] Invariant cache hit.
[2023-03-12 12:30:35] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-12 12:30:35] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:35] [INFO ] Invariant cache hit.
[2023-03-12 12:30:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:37] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
[2023-03-12 12:30:37] [INFO ] Redundant transitions in 154 ms returned []
[2023-03-12 12:30:37] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:37] [INFO ] Invariant cache hit.
[2023-03-12 12:30:38] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4746 ms. Remains : 193/193 places, 3727/3727 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/193 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 172 reset in 857 ms.
Product exploration explored 100000 steps with 172 reset in 841 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 441 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2023-03-12 12:30:40] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:40] [INFO ] Invariant cache hit.
[2023-03-12 12:30:41] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
[2023-03-12 12:30:41] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:41] [INFO ] Invariant cache hit.
[2023-03-12 12:30:42] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-12 12:30:42] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:42] [INFO ] Invariant cache hit.
[2023-03-12 12:30:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:43] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
[2023-03-12 12:30:43] [INFO ] Redundant transitions in 163 ms returned []
[2023-03-12 12:30:43] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:43] [INFO ] Invariant cache hit.
[2023-03-12 12:30:44] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4408 ms. Remains : 193/193 places, 3727/3727 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-02 finished in 17887 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)&&X(G(p1))))'
Support contains 185 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 55 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:30:45] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:30:45] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:30:46] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
[2023-03-12 12:30:46] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:46] [INFO ] Invariant cache hit.
[2023-03-12 12:30:46] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-12 12:30:46] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:46] [INFO ] Invariant cache hit.
[2023-03-12 12:30:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:46] [INFO ] Implicit Places using invariants and state equation in 547 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 668 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 38 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1826 ms. Remains : 194/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s83 1) (GEQ s85 1) (GEQ s93 1) (GEQ s167 1)) (AND (GEQ s83 1) (GEQ s85 1) (GEQ s132 1) (GEQ s167 1)) (AND (GEQ s83 1) (GEQ s85 1) (GEQ s1...], 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 1 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-03 finished in 2046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 82 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 47 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:30:47] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:47] [INFO ] Invariant cache hit.
[2023-03-12 12:30:48] [INFO ] Dead Transitions using invariants and state equation in 1128 ms found 0 transitions.
[2023-03-12 12:30:48] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:48] [INFO ] Invariant cache hit.
[2023-03-12 12:30:48] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-12 12:30:48] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:48] [INFO ] Invariant cache hit.
[2023-03-12 12:30:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:49] [INFO ] Implicit Places using invariants and state equation in 969 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1383 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 26 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2587 ms. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s80 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 283 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-04 finished in 2765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p1))||p0))))'
Support contains 186 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 39 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:30:50] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:50] [INFO ] Invariant cache hit.
[2023-03-12 12:30:51] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
[2023-03-12 12:30:51] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:51] [INFO ] Invariant cache hit.
[2023-03-12 12:30:51] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 12:30:51] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:51] [INFO ] Invariant cache hit.
[2023-03-12 12:30:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:51] [INFO ] Implicit Places using invariants and state equation in 569 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 690 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 34 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1886 ms. Remains : 194/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (AND (GEQ s161 1) (GEQ s172 1)) (AND (GEQ s142 1) (GEQ s172 1)) (AND (GEQ s103 1) (GEQ s172 1)) (AND (GEQ s122 1) (GEQ s172 1)) (AND (GEQ s141 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1627 ms.
Product exploration explored 100000 steps with 33333 reset in 1314 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-05 finished in 5146 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)))'
Support contains 82 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 55 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:30:55] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:55] [INFO ] Invariant cache hit.
[2023-03-12 12:30:56] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
[2023-03-12 12:30:56] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:56] [INFO ] Invariant cache hit.
[2023-03-12 12:30:56] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-12 12:30:56] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:30:56] [INFO ] Invariant cache hit.
[2023-03-12 12:30:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:30:57] [INFO ] Implicit Places using invariants and state equation in 991 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1308 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 22 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2451 ms. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s80 1)) (A...], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1318 ms.
Product exploration explored 100000 steps with 50000 reset in 1337 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/193 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-06 finished in 5313 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) U (p1||F(p2))))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 740 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:31:01] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2023-03-12 12:31:01] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 12:31:02] [INFO ] Dead Transitions using invariants and state equation in 1123 ms found 0 transitions.
[2023-03-12 12:31:02] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:02] [INFO ] Invariant cache hit.
[2023-03-12 12:31:02] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-12 12:31:02] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:02] [INFO ] Invariant cache hit.
[2023-03-12 12:31:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:04] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2287 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 752 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4904 ms. Remains : 194/196 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s169 1) (GEQ s82 1)), p2:(OR (AND (GEQ s83 50) (GEQ s171 1)) (AND (GEQ s83 50) (GEQ s170 1))), p0:(LT s82 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6946 reset in 1213 ms.
Product exploration explored 100000 steps with 6962 reset in 1034 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/194 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 460 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Finished random walk after 145 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 457 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
[2023-03-12 12:31:08] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2023-03-12 12:31:08] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:31:09] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 12:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:31:10] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2023-03-12 12:31:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:31:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 12:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:31:11] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2023-03-12 12:31:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 2450 ms returned sat
[2023-03-12 12:31:14] [INFO ] Deduced a trap composed of 5 places in 485 ms of which 1 ms to minimize.
[2023-03-12 12:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 547 ms
[2023-03-12 12:31:14] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 131 ms.
[2023-03-12 12:31:14] [INFO ] Added : 17 causal constraints over 4 iterations in 459 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 698 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:31:15] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:15] [INFO ] Invariant cache hit.
[2023-03-12 12:31:16] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
[2023-03-12 12:31:16] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:16] [INFO ] Invariant cache hit.
[2023-03-12 12:31:17] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-12 12:31:17] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:17] [INFO ] Invariant cache hit.
[2023-03-12 12:31:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:18] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2023-03-12 12:31:18] [INFO ] Redundant transitions in 116 ms returned []
[2023-03-12 12:31:18] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:18] [INFO ] Invariant cache hit.
[2023-03-12 12:31:19] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4583 ms. Remains : 194/194 places, 3728/3728 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/194 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Finished random walk after 151 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 311 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
[2023-03-12 12:31:20] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:20] [INFO ] Invariant cache hit.
[2023-03-12 12:31:20] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 12:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:31:21] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2023-03-12 12:31:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:31:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 12:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:31:22] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-12 12:31:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:22] [INFO ] [Nat]Added 42 Read/Feed constraints in 166 ms returned sat
[2023-03-12 12:31:22] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 256 ms.
[2023-03-12 12:31:23] [INFO ] Added : 21 causal constraints over 5 iterations in 459 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 6978 reset in 903 ms.
Product exploration explored 100000 steps with 6895 reset in 896 ms.
Support contains 5 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 692 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2023-03-12 12:31:25] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:25] [INFO ] Invariant cache hit.
[2023-03-12 12:31:26] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
[2023-03-12 12:31:26] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:26] [INFO ] Invariant cache hit.
[2023-03-12 12:31:27] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-12 12:31:27] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:27] [INFO ] Invariant cache hit.
[2023-03-12 12:31:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:28] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2023-03-12 12:31:28] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-12 12:31:28] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2023-03-12 12:31:28] [INFO ] Invariant cache hit.
[2023-03-12 12:31:29] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4294 ms. Remains : 194/194 places, 3728/3728 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-07 finished in 29201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 556 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:31:30] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:31:30] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:31:31] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
[2023-03-12 12:31:31] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:31] [INFO ] Invariant cache hit.
[2023-03-12 12:31:31] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-12 12:31:31] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:31] [INFO ] Invariant cache hit.
[2023-03-12 12:31:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:33] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2232 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 572 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4284 ms. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s109 1) (LT s171 1) (AND (GEQ s83 50) (GEQ s170 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 504 reset in 735 ms.
Product exploration explored 100000 steps with 445 reset in 766 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 525 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2023-03-12 12:31:36] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2023-03-12 12:31:36] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 12:31:37] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
[2023-03-12 12:31:37] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:37] [INFO ] Invariant cache hit.
[2023-03-12 12:31:37] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-12 12:31:37] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:37] [INFO ] Invariant cache hit.
[2023-03-12 12:31:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:40] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 2846 ms to find 0 implicit places.
[2023-03-12 12:31:40] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-12 12:31:40] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:40] [INFO ] Invariant cache hit.
[2023-03-12 12:31:41] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5410 ms. Remains : 193/193 places, 3727/3727 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Finished random walk after 108 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 430 reset in 776 ms.
Product exploration explored 100000 steps with 469 reset in 778 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 539 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2023-03-12 12:31:43] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:43] [INFO ] Invariant cache hit.
[2023-03-12 12:31:44] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
[2023-03-12 12:31:44] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:44] [INFO ] Invariant cache hit.
[2023-03-12 12:31:45] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-12 12:31:45] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:45] [INFO ] Invariant cache hit.
[2023-03-12 12:31:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:47] [INFO ] Implicit Places using invariants and state equation in 2446 ms returned []
Implicit Place search using SMT with State Equation took 2849 ms to find 0 implicit places.
[2023-03-12 12:31:47] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-12 12:31:47] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:47] [INFO ] Invariant cache hit.
[2023-03-12 12:31:48] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5363 ms. Remains : 193/193 places, 3727/3727 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-08 finished in 19331 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 6 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 40 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:31:48] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:31:48] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:31:49] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
[2023-03-12 12:31:49] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:49] [INFO ] Invariant cache hit.
[2023-03-12 12:31:50] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-12 12:31:50] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:50] [INFO ] Invariant cache hit.
[2023-03-12 12:31:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:51] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1596 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 21 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2570 ms. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s127 1) (GEQ s171 1)), p1:(AND (GEQ s1 1) (GEQ s84 1) (GEQ s136 1) (GEQ s180 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]]
Product exploration explored 100000 steps with 597 reset in 641 ms.
Product exploration explored 100000 steps with 590 reset in 653 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/193 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 198 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Finished random walk after 129 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 206 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-03-12 12:31:53] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2023-03-12 12:31:53] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:31:54] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-10 finished in 5633 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)))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 41 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:31:54] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2023-03-12 12:31:54] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:31:55] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
[2023-03-12 12:31:55] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:55] [INFO ] Invariant cache hit.
[2023-03-12 12:31:55] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 12:31:55] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:55] [INFO ] Invariant cache hit.
[2023-03-12 12:31:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:31:57] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1642 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 21 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2659 ms. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s51 1) (GEQ s85 1) (GEQ s86 1) (GEQ s184 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][false, false]]
Stuttering criterion allowed to conclude after 660 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-12 finished in 2733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p1 U X(G(p2)))&&p0) U p3))))'
Support contains 9 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 531 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2023-03-12 12:31:57] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:57] [INFO ] Invariant cache hit.
[2023-03-12 12:31:58] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
[2023-03-12 12:31:58] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:58] [INFO ] Invariant cache hit.
[2023-03-12 12:31:59] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-12 12:31:59] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2023-03-12 12:31:59] [INFO ] Invariant cache hit.
[2023-03-12 12:31:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 12:32:00] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1378 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 510 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3360 ms. Remains : 194/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p3 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(OR (AND p3 (NOT p2)) (AND p0 (NOT p2))), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p3 p2) (AND p0 p1 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p1) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p3) p0 p1 p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p3) p0 p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p3 (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p3 p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p3 p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p3) p0 p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s85 1) (GEQ s90 1) (GEQ s174 1)), p0:(AND (GEQ s48 1) (GEQ s82 1) (GEQ s84 1) (GEQ s85 1)), p1:(AND (GEQ s48 1) (GEQ s82 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 657 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V80P50N20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N20-LTLFireability-15 finished in 3586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1||F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 12:32:01] [INFO ] Flatten gal took : 136 ms
[2023-03-12 12:32:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 42 ms.
[2023-03-12 12:32:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 196 places, 3728 transitions and 28828 arcs took 21 ms.
Total runtime 287291 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1646/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1646/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1646/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1646/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-LTLFireability-00
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-LTLFireability-02
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-LTLFireability-07
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-LTLFireability-08

BK_STOP 1678624437908

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V80P50N20-LTLFireability-00
ltl formula formula --ltl=/tmp/1646/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 196 places, 3728 transitions and 28828 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.150 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1646/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1646/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1646/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1646/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V80P50N20-LTLFireability-02
ltl formula formula --ltl=/tmp/1646/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 196 places, 3728 transitions and 28828 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1646/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1646/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.740 real 0.160 user 0.120 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1646/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1646/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V80P50N20-LTLFireability-07
ltl formula formula --ltl=/tmp/1646/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 196 places, 3728 transitions and 28828 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.750 real 0.150 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1646/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1646/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1646/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1646/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): invalid pointer
ltl formula name BridgeAndVehicles-PT-V80P50N20-LTLFireability-08
ltl formula formula --ltl=/tmp/1646/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 196 places, 3728 transitions and 28828 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1646/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1646/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.760 real 0.160 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1646/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1646/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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