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.r265-smll-167863540000420.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 ltsminxred
Input is Parking-PT-208, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540000420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 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.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 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 49K 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-208-LTLFireability-00
FORMULA_NAME Parking-PT-208-LTLFireability-01
FORMULA_NAME Parking-PT-208-LTLFireability-02
FORMULA_NAME Parking-PT-208-LTLFireability-03
FORMULA_NAME Parking-PT-208-LTLFireability-04
FORMULA_NAME Parking-PT-208-LTLFireability-05
FORMULA_NAME Parking-PT-208-LTLFireability-06
FORMULA_NAME Parking-PT-208-LTLFireability-07
FORMULA_NAME Parking-PT-208-LTLFireability-08
FORMULA_NAME Parking-PT-208-LTLFireability-09
FORMULA_NAME Parking-PT-208-LTLFireability-10
FORMULA_NAME Parking-PT-208-LTLFireability-11
FORMULA_NAME Parking-PT-208-LTLFireability-12
FORMULA_NAME Parking-PT-208-LTLFireability-13
FORMULA_NAME Parking-PT-208-LTLFireability-14
FORMULA_NAME Parking-PT-208-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678996506575

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 19:55:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 19:55:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:55:09] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-16 19:55:09] [INFO ] Transformed 137 places.
[2023-03-16 19:55:09] [INFO ] Transformed 201 transitions.
[2023-03-16 19:55:09] [INFO ] Found NUPN structural information;
[2023-03-16 19:55:09] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-208-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Applied a total of 2 rules in 33 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2023-03-16 19:55:09] [INFO ] Computed 34 place invariants in 18 ms
[2023-03-16 19:55:09] [INFO ] Implicit Places using invariants in 315 ms returned [28, 36, 52, 64, 94, 102, 118, 130]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 360 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/137 places, 116/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 112
Applied a total of 8 rules in 16 ms. Remains 124 /128 variables (removed 4) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 124 cols
[2023-03-16 19:55:09] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-16 19:55:10] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-16 19:55:10] [INFO ] Invariant cache hit.
[2023-03-16 19:55:10] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:55:10] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/137 places, 112/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 834 ms. Remains : 124/137 places, 112/117 transitions.
Support contains 36 out of 124 places after structural reductions.
[2023-03-16 19:55:10] [INFO ] Flatten gal took : 48 ms
[2023-03-16 19:55:10] [INFO ] Flatten gal took : 20 ms
[2023-03-16 19:55:10] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 34 out of 124 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 289 resets, run finished after 813 ms. (steps per millisecond=12 ) properties (out of 25) seen :19
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-16 19:55:11] [INFO ] Invariant cache hit.
[2023-03-16 19:55:11] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-16 19:55:12] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-16 19:55:12] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:55:12] [INFO ] After 19ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 19:55:12] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 19:55:12] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-16 19:55:12] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 19:55:12] [INFO ] After 62ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 19:55:12] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-16 19:55:12] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 18 ms.
Support contains 9 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 115 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 115 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 109 transition count 97
Free-agglomeration rule applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 47 place count 109 transition count 80
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 64 place count 92 transition count 80
Applied a total of 64 rules in 49 ms. Remains 92 /124 variables (removed 32) and now considering 80/112 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 92/124 places, 80/112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Finished probabilistic random walk after 3501 steps, run visited all 4 properties in 42 ms. (steps per millisecond=83 )
Probabilistic random walk after 3501 steps, saw 1224 distinct states, run finished after 42 ms. (steps per millisecond=83 ) properties seen :4
FORMULA Parking-PT-208-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-208-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G(F(p0)))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 120 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 120 transition count 105
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 117 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 114 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 108 transition count 96
Applied a total of 30 rules in 24 ms. Remains 108 /124 variables (removed 16) and now considering 96/112 (removed 16) transitions.
// Phase 1: matrix 96 rows 108 cols
[2023-03-16 19:55:13] [INFO ] Computed 26 place invariants in 4 ms
[2023-03-16 19:55:13] [INFO ] Implicit Places using invariants in 108 ms returned [38, 54, 89, 105]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 112 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/124 places, 96/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 100 transition count 92
Applied a total of 8 rules in 11 ms. Remains 100 /104 variables (removed 4) and now considering 92/96 (removed 4) transitions.
// Phase 1: matrix 92 rows 100 cols
[2023-03-16 19:55:13] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-16 19:55:13] [INFO ] Invariant cache hit.
[2023-03-16 19:55:13] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/124 places, 92/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 100/124 places, 92/112 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-00 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 s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 3 ms.
FORMULA Parking-PT-208-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-00 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 114 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 108 transition count 96
Applied a total of 32 rules in 16 ms. Remains 108 /124 variables (removed 16) and now considering 96/112 (removed 16) transitions.
// Phase 1: matrix 96 rows 108 cols
[2023-03-16 19:55:14] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-16 19:55:14] [INFO ] Implicit Places using invariants in 88 ms returned [37, 89, 105]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 90 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/124 places, 96/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 94
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 6 place count 102 transition count 93
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 0 with 2 rules applied. Total rules applied 8 place count 101 transition count 112
Applied a total of 8 rules in 14 ms. Remains 101 /105 variables (removed 4) and now considering 112/96 (removed -16) transitions.
// Phase 1: matrix 112 rows 101 cols
[2023-03-16 19:55:14] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-16 19:55:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-16 19:55:14] [INFO ] Invariant cache hit.
[2023-03-16 19:55:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-16 19:55:14] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/124 places, 112/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 395 ms. Remains : 101/124 places, 112/112 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s56 1), p1:(AND (EQ s40 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-01 finished in 566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||X(G(p2))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 5 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-16 19:55:14] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-16 19:55:14] [INFO ] Implicit Places using invariants in 89 ms returned [41, 59, 117]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 109/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 108
Applied a total of 2 rules in 4 ms. Remains 117 /118 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 117 cols
[2023-03-16 19:55:14] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-16 19:55:14] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-16 19:55:14] [INFO ] Invariant cache hit.
[2023-03-16 19:55:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:55:14] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/124 places, 108/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 117/124 places, 108/112 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : Parking-PT-208-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s96 1) (EQ s113 1)), p1:(EQ s63 1), p2:(EQ s63 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, null, null, null][false, 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-208-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-04 finished in 632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 109
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 121 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 120 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 120 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 117 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 115 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 115 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 109 transition count 97
Applied a total of 30 rules in 21 ms. Remains 109 /124 variables (removed 15) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 109 cols
[2023-03-16 19:55:15] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-16 19:55:15] [INFO ] Implicit Places using invariants in 92 ms returned [37, 53, 89, 106]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 93 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/124 places, 97/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 93
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 0 with 2 rules applied. Total rules applied 10 place count 100 transition count 112
Applied a total of 10 rules in 10 ms. Remains 100 /105 variables (removed 5) and now considering 112/97 (removed -15) transitions.
// Phase 1: matrix 112 rows 100 cols
[2023-03-16 19:55:15] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:15] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-16 19:55:15] [INFO ] Invariant cache hit.
[2023-03-16 19:55:15] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-16 19:55:15] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/124 places, 112/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 393 ms. Remains : 100/124 places, 112/112 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s49 1) (EQ s16 1) (EQ s42 1)), p1:(EQ s84 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-05 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 2 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-16 19:55:15] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-16 19:55:15] [INFO ] Implicit Places using invariants in 100 ms returned [41, 59, 99, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 101 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 2 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-16 19:55:15] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:16] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-16 19:55:16] [INFO ] Invariant cache hit.
[2023-03-16 19:55:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:55:16] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 342 ms. Remains : 115/124 places, 107/112 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-07 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=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s30 0), p1:(EQ s12 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-07 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F(p1)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 2 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-16 19:55:16] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-16 19:55:16] [INFO ] Implicit Places using invariants in 85 ms returned [41, 59, 99, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 8 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-16 19:55:16] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-16 19:55:16] [INFO ] Invariant cache hit.
[2023-03-16 19:55:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:55:16] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 115/124 places, 107/112 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s91 1), p0:(EQ s69 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 7 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-08 finished in 527 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))||G(!p0)))))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 2 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-16 19:55:16] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-16 19:55:16] [INFO ] Implicit Places using invariants in 90 ms returned [41, 59, 99, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 91 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 2 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-16 19:55:16] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-16 19:55:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-16 19:55:17] [INFO ] Invariant cache hit.
[2023-03-16 19:55:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:55:17] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 115/124 places, 107/112 transitions.
Stuttering acceptance computed with spot in 138 ms :[false, (NOT p0), false, false]
Running random walk in product with property : Parking-PT-208-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2907 reset in 347 ms.
Product exploration explored 100000 steps with 2908 reset in 322 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 860 steps, including 25 resets, run visited all 1 properties in 3 ms. (steps per millisecond=286 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 114 transition count 103
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 111 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 110 transition count 102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 110 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 107 transition count 99
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 30 place count 99 transition count 91
Applied a total of 30 rules in 13 ms. Remains 99 /115 variables (removed 16) and now considering 91/107 (removed 16) transitions.
// Phase 1: matrix 91 rows 99 cols
[2023-03-16 19:55:18] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-16 19:55:18] [INFO ] Invariant cache hit.
[2023-03-16 19:55:18] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-16 19:55:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:55:18] [INFO ] Invariant cache hit.
[2023-03-16 19:55:18] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/115 places, 91/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 99/115 places, 91/107 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 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3010 steps, including 93 resets, run visited all 1 properties in 7 ms. (steps per millisecond=430 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3077 reset in 199 ms.
Product exploration explored 100000 steps with 3055 reset in 424 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-16 19:55:19] [INFO ] Invariant cache hit.
[2023-03-16 19:55:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-16 19:55:19] [INFO ] Invariant cache hit.
[2023-03-16 19:55:19] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-16 19:55:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:55:19] [INFO ] Invariant cache hit.
[2023-03-16 19:55:20] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 99/99 places, 91/91 transitions.
Treatment of property Parking-PT-208-LTLFireability-11 finished in 3275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 6 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-16 19:55:20] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-16 19:55:20] [INFO ] Implicit Places using invariants in 105 ms returned [59, 99, 117]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 109/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 108
Applied a total of 2 rules in 3 ms. Remains 117 /118 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 117 cols
[2023-03-16 19:55:20] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-16 19:55:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-16 19:55:20] [INFO ] Invariant cache hit.
[2023-03-16 19:55:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:55:20] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/124 places, 108/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 117/124 places, 108/112 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (EQ s77 1) (EQ s107 1)) (AND (EQ s41 1) (EQ s58 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 57 steps with 10 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-12 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 2 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-16 19:55:20] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-16 19:55:20] [INFO ] Implicit Places using invariants in 94 ms returned [41, 59, 99, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 95 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 2 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-16 19:55:20] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:20] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-16 19:55:20] [INFO ] Invariant cache hit.
[2023-03-16 19:55:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:55:21] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 115/124 places, 107/112 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s2 1) (EQ s46 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-13 finished in 460 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' '!(((!p0 U (p1||G(!p0))) U G(p2)))'
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 115 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 115 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 109 transition count 97
Applied a total of 30 rules in 13 ms. Remains 109 /124 variables (removed 15) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 109 cols
[2023-03-16 19:55:21] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-16 19:55:21] [INFO ] Implicit Places using invariants in 93 ms returned [37, 55, 90, 106]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 94 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/124 places, 97/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 93
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 0 with 2 rules applied. Total rules applied 10 place count 100 transition count 112
Applied a total of 10 rules in 10 ms. Remains 100 /105 variables (removed 5) and now considering 112/97 (removed -15) transitions.
// Phase 1: matrix 112 rows 100 cols
[2023-03-16 19:55:21] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-16 19:55:21] [INFO ] Invariant cache hit.
[2023-03-16 19:55:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-16 19:55:21] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/124 places, 112/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 100/124 places, 112/112 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), true, (NOT p2), (AND p2 (NOT p1) p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (NEQ s64 1) (NOT (AND (EQ s67 1) (EQ s86 1)))), p1:(AND (NEQ s37 1) (NOT (AND (EQ s77 1) (EQ s98 1)))), p0:(AND (EQ s77 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3058 reset in 333 ms.
Product exploration explored 100000 steps with 3066 reset in 427 ms.
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 p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p2), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 701 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), true, (NOT p2), (AND p0 p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 305 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-16 19:55:23] [INFO ] Invariant cache hit.
[2023-03-16 19:55:23] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2023-03-16 19:55:23] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p2), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p2)), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))]
Knowledge based reduction with 17 factoid took 967 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 112/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-16 19:55:24] [INFO ] Invariant cache hit.
[2023-03-16 19:55:24] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-16 19:55:24] [INFO ] Invariant cache hit.
[2023-03-16 19:55:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-16 19:55:24] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-16 19:55:24] [INFO ] Invariant cache hit.
[2023-03-16 19:55:25] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 100/100 places, 112/112 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 p0) p2 p1), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p2), (X (NOT (AND p0 (NOT p1)))), true, (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 819 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 304 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :4
Finished Best-First random walk after 1596 steps, including 4 resets, run visited all 1 properties in 5 ms. (steps per millisecond=319 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p2), (X (NOT (AND p0 (NOT p1)))), true, (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND p2 p1)))), (F (AND p0 (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 664 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3054 reset in 241 ms.
Entered a terminal (fully accepting) state of product in 76093 steps with 2319 reset in 213 ms.
FORMULA Parking-PT-208-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-14 finished in 6495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 113 transition count 101
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 107 transition count 95
Applied a total of 34 rules in 12 ms. Remains 107 /124 variables (removed 17) and now considering 95/112 (removed 17) transitions.
// Phase 1: matrix 95 rows 107 cols
[2023-03-16 19:55:27] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-16 19:55:27] [INFO ] Implicit Places using invariants in 98 ms returned [37, 53, 88, 104]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 100 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/124 places, 95/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 91
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 0 with 2 rules applied. Total rules applied 10 place count 98 transition count 110
Applied a total of 10 rules in 10 ms. Remains 98 /103 variables (removed 5) and now considering 110/95 (removed -15) transitions.
// Phase 1: matrix 110 rows 98 cols
[2023-03-16 19:55:27] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-16 19:55:27] [INFO ] Invariant cache hit.
[2023-03-16 19:55:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-16 19:55:28] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/124 places, 110/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 98/124 places, 110/112 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-15 finished in 457 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))||G(!p0)))))'
Found a Lengthening insensitive property : Parking-PT-208-LTLFireability-11
Stuttering acceptance computed with spot in 140 ms :[false, (NOT p0), false, false]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 108
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 120 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 119 transition count 107
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 119 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 116 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 113 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 32 place count 107 transition count 95
Applied a total of 32 rules in 15 ms. Remains 107 /124 variables (removed 17) and now considering 95/112 (removed 17) transitions.
// Phase 1: matrix 95 rows 107 cols
[2023-03-16 19:55:28] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-16 19:55:28] [INFO ] Implicit Places using invariants in 107 ms returned [37, 53, 88, 104]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 103/124 places, 95/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 91
Applied a total of 8 rules in 6 ms. Remains 99 /103 variables (removed 4) and now considering 91/95 (removed 4) transitions.
// Phase 1: matrix 91 rows 99 cols
[2023-03-16 19:55:28] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:55:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-16 19:55:28] [INFO ] Invariant cache hit.
[2023-03-16 19:55:28] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 99/124 places, 91/112 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 346 ms. Remains : 99/124 places, 91/112 transitions.
Running random walk in product with property : Parking-PT-208-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3065 reset in 177 ms.
Product exploration explored 100000 steps with 3067 reset in 194 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 (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 2654 steps, including 81 resets, run visited all 1 properties in 6 ms. (steps per millisecond=442 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-16 19:55:29] [INFO ] Invariant cache hit.
[2023-03-16 19:55:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-16 19:55:29] [INFO ] Invariant cache hit.
[2023-03-16 19:55:29] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-16 19:55:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:55:29] [INFO ] Invariant cache hit.
[2023-03-16 19:55:29] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 99/99 places, 91/91 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 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 2451 steps, including 74 resets, run visited all 1 properties in 5 ms. (steps per millisecond=490 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3072 reset in 176 ms.
Product exploration explored 100000 steps with 3067 reset in 200 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-16 19:55:30] [INFO ] Invariant cache hit.
[2023-03-16 19:55:30] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-16 19:55:30] [INFO ] Invariant cache hit.
[2023-03-16 19:55:30] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-16 19:55:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:55:30] [INFO ] Invariant cache hit.
[2023-03-16 19:55:30] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 99/99 places, 91/91 transitions.
Treatment of property Parking-PT-208-LTLFireability-11 finished in 2823 ms.
[2023-03-16 19:55:30] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:55:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 19:55:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 112 transitions and 379 arcs took 2 ms.
Total runtime 21907 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1309/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Parking-PT-208-LTLFireability-11

BK_STOP 1678996532260

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Parking-PT-208-LTLFireability-11
ltl formula formula --ltl=/tmp/1309/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 124 places, 112 transitions and 379 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1309/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1309/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1309/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1309/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55ac6b82d3f4]
1: pnml2lts-mc(+0xa2496) [0x55ac6b82d496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fdbec433140]
3: pnml2lts-mc(+0x405be5) [0x55ac6bb90be5]
4: pnml2lts-mc(+0x16b3f9) [0x55ac6b8f63f9]
5: pnml2lts-mc(+0x164ac4) [0x55ac6b8efac4]
6: pnml2lts-mc(+0x272e0a) [0x55ac6b9fde0a]
7: pnml2lts-mc(+0xb61f0) [0x55ac6b8411f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fdbec2864d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fdbec28667a]
10: pnml2lts-mc(+0xa1581) [0x55ac6b82c581]
11: pnml2lts-mc(+0xa1910) [0x55ac6b82c910]
12: pnml2lts-mc(+0xa32a2) [0x55ac6b82e2a2]
13: pnml2lts-mc(+0xa50f4) [0x55ac6b8300f4]
14: pnml2lts-mc(+0xa516b) [0x55ac6b83016b]
15: pnml2lts-mc(+0x3f34b3) [0x55ac6bb7e4b3]
16: pnml2lts-mc(+0x7c63d) [0x55ac6b80763d]
17: pnml2lts-mc(+0x67d86) [0x55ac6b7f2d86]
18: pnml2lts-mc(+0x60a8a) [0x55ac6b7eba8a]
19: pnml2lts-mc(+0x5eb15) [0x55ac6b7e9b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fdbec26ed0a]
21: pnml2lts-mc(+0x6075e) [0x55ac6b7eb75e]

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-208"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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