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

About the Execution of ITS-Tools for Parking-PT-416

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1485.560 147861.00 346479.00 768.10 TFFTFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536300428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Parking-PT-416, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K Mar 5 18:23 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 Parking-PT-416-LTLFireability-00
FORMULA_NAME Parking-PT-416-LTLFireability-01
FORMULA_NAME Parking-PT-416-LTLFireability-02
FORMULA_NAME Parking-PT-416-LTLFireability-03
FORMULA_NAME Parking-PT-416-LTLFireability-04
FORMULA_NAME Parking-PT-416-LTLFireability-05
FORMULA_NAME Parking-PT-416-LTLFireability-06
FORMULA_NAME Parking-PT-416-LTLFireability-07
FORMULA_NAME Parking-PT-416-LTLFireability-08
FORMULA_NAME Parking-PT-416-LTLFireability-09
FORMULA_NAME Parking-PT-416-LTLFireability-10
FORMULA_NAME Parking-PT-416-LTLFireability-11
FORMULA_NAME Parking-PT-416-LTLFireability-12
FORMULA_NAME Parking-PT-416-LTLFireability-13
FORMULA_NAME Parking-PT-416-LTLFireability-14
FORMULA_NAME Parking-PT-416-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678924536045

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 23:55:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 23:55:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:55:39] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-15 23:55:39] [INFO ] Transformed 305 places.
[2023-03-15 23:55:39] [INFO ] Transformed 433 transitions.
[2023-03-15 23:55:39] [INFO ] Found NUPN structural information;
[2023-03-15 23:55:39] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 302 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 302 transition count 254
Applied a total of 6 rules in 103 ms. Remains 302 /305 variables (removed 3) and now considering 254/257 (removed 3) transitions.
// Phase 1: matrix 254 rows 302 cols
[2023-03-15 23:55:39] [INFO ] Computed 76 place invariants in 29 ms
[2023-03-15 23:55:40] [INFO ] Implicit Places using invariants in 761 ms returned [48, 56, 64, 72, 88, 90, 118, 126, 134, 158, 160, 187, 195, 203, 211, 227, 264, 272, 280, 296, 298]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 828 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 281/305 places, 254/257 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 269 transition count 242
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 269 transition count 242
Applied a total of 24 rules in 34 ms. Remains 269 /281 variables (removed 12) and now considering 242/254 (removed 12) transitions.
// Phase 1: matrix 242 rows 269 cols
[2023-03-15 23:55:40] [INFO ] Computed 55 place invariants in 7 ms
[2023-03-15 23:55:40] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-15 23:55:40] [INFO ] Invariant cache hit.
[2023-03-15 23:55:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:55:41] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 269/305 places, 242/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1967 ms. Remains : 269/305 places, 242/257 transitions.
Support contains 38 out of 269 places after structural reductions.
[2023-03-15 23:55:41] [INFO ] Flatten gal took : 102 ms
[2023-03-15 23:55:41] [INFO ] Flatten gal took : 47 ms
[2023-03-15 23:55:41] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 766 ms. (steps per millisecond=13 ) properties (out of 28) seen :20
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 23:55:42] [INFO ] Invariant cache hit.
[2023-03-15 23:55:43] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2023-03-15 23:55:43] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 23:55:43] [INFO ] [Nat]Absence check using 55 positive place invariants in 37 ms returned sat
[2023-03-15 23:55:43] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 23:55:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:55:43] [INFO ] After 191ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 23:55:44] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-15 23:55:44] [INFO ] After 1235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 72 ms.
Support contains 11 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 242/242 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 269 transition count 235
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 262 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 262 transition count 228
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 255 transition count 228
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 238 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 237 transition count 230
Free-agglomeration rule applied 53 times.
Iterating global reduction 2 with 53 rules applied. Total rules applied 117 place count 237 transition count 177
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 170 place count 184 transition count 177
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 184 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 174 place count 182 transition count 175
Applied a total of 174 rules in 126 ms. Remains 182 /269 variables (removed 87) and now considering 175/242 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 182/269 places, 175/242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Finished Best-First random walk after 328 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=164 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||F(p1))))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 13 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-15 23:55:45] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-15 23:55:45] [INFO ] Implicit Places using invariants in 165 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 167 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 11 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-15 23:55:45] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-15 23:55:45] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-15 23:55:45] [INFO ] Invariant cache hit.
[2023-03-15 23:55:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:55:46] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 879 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s149 1) (NEQ s171 1)), p0:(OR (EQ s104 0) (EQ s142 0))], 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 50000 reset in 1339 ms.
Product exploration explored 100000 steps with 50000 reset in 920 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-00 finished in 3540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 268 transition count 234
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 261 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 261 transition count 227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 254 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 251 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 251 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 234 transition count 207
Applied a total of 68 rules in 35 ms. Remains 234 /269 variables (removed 35) and now considering 207/242 (removed 35) transitions.
// Phase 1: matrix 207 rows 234 cols
[2023-03-15 23:55:48] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-15 23:55:48] [INFO ] Implicit Places using invariants in 157 ms returned [109, 177, 201]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 161 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/269 places, 207/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 206
Applied a total of 2 rules in 17 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2023-03-15 23:55:48] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-15 23:55:49] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-15 23:55:49] [INFO ] Invariant cache hit.
[2023-03-15 23:55:49] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/269 places, 206/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 792 ms. Remains : 230/269 places, 206/242 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s205 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 2 ms.
FORMULA Parking-PT-416-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-01 finished in 861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 269 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 261 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 261 transition count 226
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 253 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 250 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 250 transition count 223
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 233 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 231 transition count 244
Applied a total of 76 rules in 75 ms. Remains 231 /269 variables (removed 38) and now considering 244/242 (removed -2) transitions.
// Phase 1: matrix 244 rows 231 cols
[2023-03-15 23:55:49] [INFO ] Computed 55 place invariants in 4 ms
[2023-03-15 23:55:49] [INFO ] Implicit Places using invariants in 250 ms returned [109, 176, 200]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 254 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/269 places, 244/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 259
Applied a total of 2 rules in 51 ms. Remains 227 /228 variables (removed 1) and now considering 259/244 (removed -15) transitions.
// Phase 1: matrix 259 rows 227 cols
[2023-03-15 23:55:49] [INFO ] Computed 52 place invariants in 3 ms
[2023-03-15 23:55:50] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-15 23:55:50] [INFO ] Invariant cache hit.
[2023-03-15 23:55:50] [INFO ] State equation strengthened by 124 read => feed constraints.
[2023-03-15 23:55:50] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 227/269 places, 259/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1303 ms. Remains : 227/269 places, 259/242 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s78 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-02 finished in 1381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U p1) U p2))||G(p3)))'
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 12 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-15 23:55:50] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-15 23:55:51] [INFO ] Implicit Places using invariants in 287 ms returned [126, 201]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 290 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 239/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 263 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 238
Applied a total of 2 rules in 15 ms. Remains 263 /264 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-15 23:55:51] [INFO ] Computed 53 place invariants in 3 ms
[2023-03-15 23:55:51] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-15 23:55:51] [INFO ] Invariant cache hit.
[2023-03-15 23:55:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:55:52] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1147 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Parking-PT-416-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s115 0), p2:(AND (EQ s225 1) (EQ s259 1)), p1:(OR (EQ s115 1) (AND (EQ s225 1) (EQ s259 1))), p0:(AND (EQ s18 1) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1086 ms.
Product exploration explored 100000 steps with 50000 reset in 936 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND p3 (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p3 (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 23 factoid took 670 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-03 finished in 4292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 11 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-15 23:55:55] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-15 23:55:55] [INFO ] Implicit Places using invariants in 318 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 321 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 12 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-15 23:55:55] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-15 23:55:55] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-15 23:55:55] [INFO ] Invariant cache hit.
[2023-03-15 23:55:56] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:55:56] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1204 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s156 1) (EQ s97 1)), p0:(OR (EQ s3 0) (EQ s191 0))], 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 79 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-04 finished in 1383 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&&X(p2)))))&&p0)))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 19 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-15 23:55:56] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-15 23:55:56] [INFO ] Implicit Places using invariants in 198 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 200 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 8 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-15 23:55:56] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-15 23:55:57] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-15 23:55:57] [INFO ] Invariant cache hit.
[2023-03-15 23:55:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:55:57] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 730 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-05 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: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(AND (EQ s206 1) (EQ s254 1)), p1:(EQ s28 1), p2:(EQ s0 1)], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-05 finished in 971 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((p0||F(G((p0 U p1)))))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 240
Applied a total of 4 rules in 12 ms. Remains 267 /269 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 267 cols
[2023-03-15 23:55:57] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-15 23:55:57] [INFO ] Implicit Places using invariants in 235 ms returned [127, 202, 229]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 236 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 240/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 262 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 262 transition count 238
Applied a total of 4 rules in 7 ms. Remains 262 /264 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 262 cols
[2023-03-15 23:55:57] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-15 23:55:58] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-15 23:55:58] [INFO ] Invariant cache hit.
[2023-03-15 23:55:58] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:55:58] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 912 ms. Remains : 262/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s82 1), p1:(AND (EQ s234 1) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-06 finished in 1160 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 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 268 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 260 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 260 transition count 225
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 252 transition count 225
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 249 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 249 transition count 222
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 70 place count 233 transition count 206
Applied a total of 70 rules in 31 ms. Remains 233 /269 variables (removed 36) and now considering 206/242 (removed 36) transitions.
// Phase 1: matrix 206 rows 233 cols
[2023-03-15 23:55:58] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-15 23:55:58] [INFO ] Implicit Places using invariants in 216 ms returned [110, 178, 202]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 217 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/269 places, 206/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 205
Applied a total of 2 rules in 13 ms. Remains 229 /230 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 229 cols
[2023-03-15 23:55:59] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-15 23:55:59] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-15 23:55:59] [INFO ] Invariant cache hit.
[2023-03-15 23:55:59] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 229/269 places, 205/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 932 ms. Remains : 229/269 places, 205/242 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-07 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:(EQ s98 0)], 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 1345 reset in 632 ms.
Product exploration explored 100000 steps with 1345 reset in 643 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 305 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=101 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-15 23:56:01] [INFO ] Invariant cache hit.
[2023-03-15 23:56:01] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-15 23:56:01] [INFO ] Invariant cache hit.
[2023-03-15 23:56:02] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2023-03-15 23:56:02] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 23:56:02] [INFO ] Invariant cache hit.
[2023-03-15 23:56:02] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1087 ms. Remains : 229/229 places, 205/205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 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 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2146 steps, including 29 resets, run visited all 1 properties in 16 ms. (steps per millisecond=134 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 195 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1337 reset in 533 ms.
Product exploration explored 100000 steps with 1340 reset in 521 ms.
Built C files in :
/tmp/ltsmin9735463284449919093
[2023-03-15 23:56:04] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2023-03-15 23:56:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:04] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2023-03-15 23:56:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:04] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2023-03-15 23:56:04] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:04] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9735463284449919093
Running compilation step : cd /tmp/ltsmin9735463284449919093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 959 ms.
Running link step : cd /tmp/ltsmin9735463284449919093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin9735463284449919093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14074776761340807677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 8 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-15 23:56:19] [INFO ] Invariant cache hit.
[2023-03-15 23:56:19] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-15 23:56:19] [INFO ] Invariant cache hit.
[2023-03-15 23:56:20] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2023-03-15 23:56:20] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 23:56:20] [INFO ] Invariant cache hit.
[2023-03-15 23:56:20] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 906 ms. Remains : 229/229 places, 205/205 transitions.
Built C files in :
/tmp/ltsmin3185214247812271422
[2023-03-15 23:56:20] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2023-03-15 23:56:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:20] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2023-03-15 23:56:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:20] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2023-03-15 23:56:20] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:20] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3185214247812271422
Running compilation step : cd /tmp/ltsmin3185214247812271422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 883 ms.
Running link step : cd /tmp/ltsmin3185214247812271422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3185214247812271422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3767220780697611616.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 23:56:35] [INFO ] Flatten gal took : 20 ms
[2023-03-15 23:56:35] [INFO ] Flatten gal took : 18 ms
[2023-03-15 23:56:35] [INFO ] Time to serialize gal into /tmp/LTL15814713602773409346.gal : 5 ms
[2023-03-15 23:56:35] [INFO ] Time to serialize properties into /tmp/LTL15048137817846305092.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15814713602773409346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut160812712128970269.hoa' '-atoms' '/tmp/LTL15048137817846305092.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15048137817846305092.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut160812712128970269.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
188 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.92901,65944,1,0,9,346818,24,5,5431,75180,22
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-416-LTLFireability-07 finished in 39309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&F(p2)&&p0))))'
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 6 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-15 23:56:38] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-15 23:56:38] [INFO ] Implicit Places using invariants in 196 ms returned [201, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 198 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 239/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 263 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 238
Applied a total of 2 rules in 8 ms. Remains 263 /264 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-15 23:56:38] [INFO ] Computed 53 place invariants in 2 ms
[2023-03-15 23:56:38] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-15 23:56:38] [INFO ] Invariant cache hit.
[2023-03-15 23:56:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:56:39] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 939 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Parking-PT-416-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s126 1) (EQ s141 1)), p1:(OR (EQ s28 0) (EQ s69 0)), p2:(OR (EQ s209 0) (EQ s227 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-08 finished in 1217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 10 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-15 23:56:39] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-15 23:56:39] [INFO ] Implicit Places using invariants in 300 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 302 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 9 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-15 23:56:39] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-15 23:56:39] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-15 23:56:39] [INFO ] Invariant cache hit.
[2023-03-15 23:56:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:56:40] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1050 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 192 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Running random walk in product with property : Parking-PT-416-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s117 1) (EQ s142 1)), p1:(EQ s57 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1286 reset in 469 ms.
Product exploration explored 100000 steps with 1282 reset in 409 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 129 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:56:41] [INFO ] Invariant cache hit.
[2023-03-15 23:56:41] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-15 23:56:42] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:56:42] [INFO ] [Nat]Absence check using 52 positive place invariants in 11 ms returned sat
[2023-03-15 23:56:42] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:56:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:56:42] [INFO ] After 25ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:56:42] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-15 23:56:42] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 113 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=113 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) p0)]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 237/237 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 261 transition count 230
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 254 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 253 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 253 transition count 222
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 246 transition count 222
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 231 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 230 transition count 226
Applied a total of 62 rules in 25 ms. Remains 230 /261 variables (removed 31) and now considering 226/237 (removed 11) transitions.
// Phase 1: matrix 226 rows 230 cols
[2023-03-15 23:56:42] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-15 23:56:42] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-15 23:56:42] [INFO ] Invariant cache hit.
[2023-03-15 23:56:42] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-15 23:56:43] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2023-03-15 23:56:43] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 23:56:43] [INFO ] Invariant cache hit.
[2023-03-15 23:56:43] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/261 places, 226/237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 810 ms. Remains : 230/261 places, 226/237 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 400 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:56:44] [INFO ] Invariant cache hit.
[2023-03-15 23:56:44] [INFO ] [Real]Absence check using 52 positive place invariants in 22 ms returned sat
[2023-03-15 23:56:44] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:56:44] [INFO ] [Nat]Absence check using 52 positive place invariants in 23 ms returned sat
[2023-03-15 23:56:44] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:56:44] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-15 23:56:44] [INFO ] After 54ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:56:44] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-15 23:56:44] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 226/226 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 230 transition count 164
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 379 edges and 168 vertex of which 92 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Iterating post reduction 0 with 63 rules applied. Total rules applied 125 place count 92 transition count 104
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 92 transition count 96
Applied a total of 133 rules in 29 ms. Remains 92 /230 variables (removed 138) and now considering 96/226 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 92/230 places, 96/226 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished Best-First random walk after 414 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=207 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 683 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1317 reset in 627 ms.
Product exploration explored 100000 steps with 1322 reset in 747 ms.
Built C files in :
/tmp/ltsmin14637173634076068944
[2023-03-15 23:56:47] [INFO ] Computing symmetric may disable matrix : 226 transitions.
[2023-03-15 23:56:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:47] [INFO ] Computing symmetric may enable matrix : 226 transitions.
[2023-03-15 23:56:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:47] [INFO ] Computing Do-Not-Accords matrix : 226 transitions.
[2023-03-15 23:56:47] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:56:47] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14637173634076068944
Running compilation step : cd /tmp/ltsmin14637173634076068944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 964 ms.
Running link step : cd /tmp/ltsmin14637173634076068944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14637173634076068944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15802346297056132838.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 226/226 transitions.
Applied a total of 0 rules in 8 ms. Remains 230 /230 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-15 23:57:02] [INFO ] Invariant cache hit.
[2023-03-15 23:57:02] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-15 23:57:02] [INFO ] Invariant cache hit.
[2023-03-15 23:57:02] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-15 23:57:02] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-15 23:57:02] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 23:57:02] [INFO ] Invariant cache hit.
[2023-03-15 23:57:03] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1009 ms. Remains : 230/230 places, 226/226 transitions.
Built C files in :
/tmp/ltsmin6705860031192428408
[2023-03-15 23:57:03] [INFO ] Computing symmetric may disable matrix : 226 transitions.
[2023-03-15 23:57:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:57:03] [INFO ] Computing symmetric may enable matrix : 226 transitions.
[2023-03-15 23:57:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:57:03] [INFO ] Computing Do-Not-Accords matrix : 226 transitions.
[2023-03-15 23:57:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 23:57:03] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6705860031192428408
Running compilation step : cd /tmp/ltsmin6705860031192428408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 961 ms.
Running link step : cd /tmp/ltsmin6705860031192428408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6705860031192428408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8036843933508419027.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 23:57:18] [INFO ] Flatten gal took : 24 ms
[2023-03-15 23:57:18] [INFO ] Flatten gal took : 23 ms
[2023-03-15 23:57:18] [INFO ] Time to serialize gal into /tmp/LTL2986868829726077648.gal : 5 ms
[2023-03-15 23:57:18] [INFO ] Time to serialize properties into /tmp/LTL15854208238605255179.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2986868829726077648.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5590409736006488875.hoa' '-atoms' '/tmp/LTL15854208238605255179.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15854208238605255179.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5590409736006488875.hoa
Reverse transition relation is NOT exact ! Due to transitions t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...166
Computing Next relation with stutter on 130321 deadlock states
Detected timeout of ITS tools.
[2023-03-15 23:57:33] [INFO ] Flatten gal took : 22 ms
[2023-03-15 23:57:33] [INFO ] Flatten gal took : 22 ms
[2023-03-15 23:57:33] [INFO ] Time to serialize gal into /tmp/LTL14118503110402178920.gal : 3 ms
[2023-03-15 23:57:33] [INFO ] Time to serialize properties into /tmp/LTL4181698468992863136.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14118503110402178920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4181698468992863136.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((p132!=1)||(p164!=1))"))||((F(G("(p61==1)")))&&("((p132!=1)||(p164!=1))")))))))
Formula 0 simplified : XXG(F!"((p132!=1)||(p164!=1))" & (!"((p132!=1)||(p164!=1))" | GF!"(p61==1)"))
Reverse transition relation is NOT exact ! Due to transitions t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...166
Computing Next relation with stutter on 130321 deadlock states
Detected timeout of ITS tools.
[2023-03-15 23:57:48] [INFO ] Flatten gal took : 21 ms
[2023-03-15 23:57:48] [INFO ] Applying decomposition
[2023-03-15 23:57:48] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4820372935535824502.txt' '-o' '/tmp/graph4820372935535824502.bin' '-w' '/tmp/graph4820372935535824502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4820372935535824502.bin' '-l' '-1' '-v' '-w' '/tmp/graph4820372935535824502.weights' '-q' '0' '-e' '0.001'
[2023-03-15 23:57:48] [INFO ] Decomposing Gal with order
[2023-03-15 23:57:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 23:57:48] [INFO ] Removed a total of 304 redundant transitions.
[2023-03-15 23:57:48] [INFO ] Flatten gal took : 78 ms
[2023-03-15 23:57:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 18 ms.
[2023-03-15 23:57:48] [INFO ] Time to serialize gal into /tmp/LTL6037584602645559561.gal : 8 ms
[2023-03-15 23:57:48] [INFO ] Time to serialize properties into /tmp/LTL16355972311374236338.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6037584602645559561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16355972311374236338.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((i4.u46.p132!=1)||(i4.u46.p164!=1))"))||((F(G("(i1.u22.p61==1)")))&&("((i4.u46.p132!=1)||(i4.u46.p164!=1))")))))))
Formula 0 simplified : XXG(F!"((i4.u46.p132!=1)||(i4.u46.p164!=1))" & (!"((i4.u46.p132!=1)||(i4.u46.p164!=1))" | GF!"(i1.u22.p61==1)"))
Reverse transition relation is NOT exact ! Due to transitions i4.u46.t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Computing Next relation with stutter on 130321 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
847 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.51522,218056,1,0,552511,3854,3553,462811,486,19750,282339
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-416-LTLFireability-09 finished in 79274 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 G((p1||X(p0)))))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 240
Applied a total of 4 rules in 6 ms. Remains 267 /269 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 267 cols
[2023-03-15 23:57:58] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-15 23:57:58] [INFO ] Implicit Places using invariants in 183 ms returned [126, 229]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 184 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/269 places, 240/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 238
Applied a total of 4 rules in 6 ms. Remains 263 /265 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-15 23:57:58] [INFO ] Computed 53 place invariants in 0 ms
[2023-03-15 23:57:58] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-15 23:57:58] [INFO ] Invariant cache hit.
[2023-03-15 23:57:59] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:57:59] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 867 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s235 1), p0:(AND (EQ s178 1) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-10 finished in 1044 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)||G(p1)))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 268 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 260 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 260 transition count 225
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 252 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 250 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 250 transition count 223
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 70 place count 233 transition count 206
Applied a total of 70 rules in 35 ms. Remains 233 /269 variables (removed 36) and now considering 206/242 (removed 36) transitions.
// Phase 1: matrix 206 rows 233 cols
[2023-03-15 23:57:59] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-15 23:57:59] [INFO ] Implicit Places using invariants in 298 ms returned [109, 202]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 299 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/269 places, 206/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /231 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 343 ms. Remains : 231/269 places, 206/242 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s43 1) (EQ s73 1)), p1:(AND (EQ s161 1) (EQ s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-12 finished in 464 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((X(p0) U (p1&&X(G(p0))))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 11 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-15 23:58:00] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-15 23:58:00] [INFO ] Implicit Places using invariants in 304 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 306 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 10 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-15 23:58:00] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-15 23:58:00] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-15 23:58:00] [INFO ] Invariant cache hit.
[2023-03-15 23:58:00] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:58:01] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1219 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : Parking-PT-416-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s62 1), p0:(EQ s95 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 131 steps with 42 reset in 2 ms.
FORMULA Parking-PT-416-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-13 finished in 1486 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((X((p0&&F(p1)))||G(p0)))||(!p0&&(X((p0&&F(p1)))||G(p0)))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 11 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-15 23:58:01] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-15 23:58:01] [INFO ] Implicit Places using invariants in 298 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 300 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 10 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-15 23:58:01] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-15 23:58:02] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-15 23:58:02] [INFO ] Invariant cache hit.
[2023-03-15 23:58:02] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:58:02] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1194 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s205 1), p0:(EQ s56 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-14 finished in 1441 ms.
All properties solved by simple procedures.
Total runtime 144201 ms.

BK_STOP 1678924683906

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Parking-PT-416, 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 r261-smll-167863536300428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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