Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127800413.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-104, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 23K May 5 16:51 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-104-00
FORMULA_NAME Parking-PT-104-01
FORMULA_NAME Parking-PT-104-02
FORMULA_NAME Parking-PT-104-03
FORMULA_NAME Parking-PT-104-04
FORMULA_NAME Parking-PT-104-05
FORMULA_NAME Parking-PT-104-06
FORMULA_NAME Parking-PT-104-07
FORMULA_NAME Parking-PT-104-08
FORMULA_NAME Parking-PT-104-09
FORMULA_NAME Parking-PT-104-10
FORMULA_NAME Parking-PT-104-11
FORMULA_NAME Parking-PT-104-12
FORMULA_NAME Parking-PT-104-13
FORMULA_NAME Parking-PT-104-14
FORMULA_NAME Parking-PT-104-15

=== Now, execution of the tool begins

BK_START 1620980359870

Running Version 0
[2021-05-14 08:19:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 08:19:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:19:21] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2021-05-14 08:19:21] [INFO ] Transformed 65 places.
[2021-05-14 08:19:21] [INFO ] Transformed 97 transitions.
[2021-05-14 08:19:21] [INFO ] Found NUPN structural information;
[2021-05-14 08:19:21] [INFO ] Parsed PT model containing 65 places and 97 transitions in 74 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:19:21] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
FORMULA Parking-PT-104-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 10 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2021-05-14 08:19:21] [INFO ] Computed 16 place invariants in 11 ms
[2021-05-14 08:19:21] [INFO ] Implicit Places using invariants in 117 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 142 ms to find 6 implicit places.
// Phase 1: matrix 56 rows 59 cols
[2021-05-14 08:19:21] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-14 08:19:21] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 59/65 places, 56/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 52
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 52
Applied a total of 8 rules in 9 ms. Remains 55 /59 variables (removed 4) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:21] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-14 08:19:21] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:21] [INFO ] Computed 10 place invariants in 12 ms
[2021-05-14 08:19:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:21] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 55/65 places, 52/56 transitions.
[2021-05-14 08:19:22] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 08:19:22] [INFO ] Flatten gal took : 25 ms
FORMULA Parking-PT-104-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:19:22] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:19:22] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 100000 steps, including 5981 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 17) seen :16
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:22] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-14 08:19:22] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-14 08:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:19:22] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-14 08:19:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:19:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-14 08:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:19:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-14 08:19:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:22] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2021-05-14 08:19:22] [INFO ] Computed and/alt/rep : 51/136/51 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 08:19:22] [INFO ] Added : 42 causal constraints over 9 iterations in 69 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 53 transition count 50
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 53 transition count 48
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 51 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 50 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 50 transition count 47
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 18 place count 46 transition count 43
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 2 with 2 rules applied. Total rules applied 20 place count 45 transition count 62
Applied a total of 20 rules in 21 ms. Remains 45 /55 variables (removed 10) and now considering 62/52 (removed -10) transitions.
// Phase 1: matrix 62 rows 45 cols
[2021-05-14 08:19:22] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-14 08:19:22] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 62 rows 45 cols
[2021-05-14 08:19:22] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-14 08:19:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2021-05-14 08:19:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 45 cols
[2021-05-14 08:19:22] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:22] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/55 places, 62/52 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6503 reset in 243 ms.
Stack based approach found an accepted trace after 5460 steps with 356 reset with depth 17 and stack size 17 in 12 ms.
FORMULA Parking-PT-104-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-00 finished in 594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G((p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 53 transition count 50
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 53 transition count 48
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 51 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 50 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 50 transition count 47
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 2 with 2 rules applied. Total rules applied 12 place count 49 transition count 46
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 2 with 2 rules applied. Total rules applied 14 place count 48 transition count 65
Applied a total of 14 rules in 10 ms. Remains 48 /55 variables (removed 7) and now considering 65/52 (removed -13) transitions.
// Phase 1: matrix 65 rows 48 cols
[2021-05-14 08:19:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:23] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 65 rows 48 cols
[2021-05-14 08:19:23] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-14 08:19:23] [INFO ] State equation strengthened by 32 read => feed constraints.
[2021-05-14 08:19:23] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-14 08:19:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 65 rows 48 cols
[2021-05-14 08:19:23] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-14 08:19:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/55 places, 65/52 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-104-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s25 1), p1:(NEQ s19 0), p2:(OR (NEQ s31 1) (NEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6594 reset in 172 ms.
Product exploration explored 100000 steps with 6576 reset in 189 ms.
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6557 reset in 136 ms.
Product exploration explored 100000 steps with 6549 reset in 145 ms.
[2021-05-14 08:19:24] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:19:24] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:19:24] [INFO ] Time to serialize gal into /tmp/LTL4111078654559416410.gal : 2 ms
[2021-05-14 08:19:24] [INFO ] Time to serialize properties into /tmp/LTL7389426331559834168.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4111078654559416410.gal, -t, CGAL, -LTL, /tmp/LTL7389426331559834168.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4111078654559416410.gal -t CGAL -LTL /tmp/LTL7389426331559834168.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p28==1)")||(G(("(p20!=0)")||(F("((p38!=1)||(p64!=1))")))))))
Formula 0 simplified : !F("(p28==1)" | G("(p20!=0)" | F"((p38!=1)||(p64!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/64/1/65
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
16 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,0.166381,22612,1,0,205,26606,173,119,1772,30373,351
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-104-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-104-01 finished in 1255 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 51
Applied a total of 2 rules in 3 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:24] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:24] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:24] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-14 08:19:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:24] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-14 08:19:24] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/55 places, 51/52 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : Parking-PT-104-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s38 1), p0:(AND (OR (EQ s8 0) (EQ s43 0) (AND (EQ s8 1) (EQ s43 1))) (OR (EQ s38 0) (AND (EQ s8 1) (EQ s43 1)))), p2:(AND (OR (AND (EQ s8 1) (EQ s43 1)) (EQ s8 0) (EQ s43 0)) (OR (EQ s38 0) (AND (EQ s8 1) (EQ s43 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4107 steps with 238 reset in 6 ms.
FORMULA Parking-PT-104-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-02 finished in 330 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X(p1)) U X(G((X(p1)&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 51
Applied a total of 2 rules in 2 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:24] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:24] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:24] [INFO ] Computed 10 place invariants in 9 ms
[2021-05-14 08:19:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/55 places, 51/52 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : Parking-PT-104-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s14 1), p2:(AND (EQ s2 1) (EQ s19 1)), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 3 reset in 1 ms.
FORMULA Parking-PT-104-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-03 finished in 263 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&(p0 U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:25] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:25] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 52/52 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Parking-PT-104-05 automaton TGBA [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=(OR p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s52 1), p0:(AND (EQ s27 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12153 steps with 721 reset in 19 ms.
FORMULA Parking-PT-104-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-05 finished in 213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:25] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:25] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 52/52 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-06 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 51
Applied a total of 2 rules in 2 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:25] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:25] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/55 places, 51/52 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Parking-PT-104-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s6 0) (EQ s25 0)), p0:(AND (EQ s28 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6439 steps with 385 reset in 9 ms.
FORMULA Parking-PT-104-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-07 finished in 400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(!p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 54 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 53 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 52 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 52 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 49 transition count 46
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 2 with 2 rules applied. Total rules applied 14 place count 48 transition count 65
Applied a total of 14 rules in 9 ms. Remains 48 /55 variables (removed 7) and now considering 65/52 (removed -13) transitions.
// Phase 1: matrix 65 rows 48 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:25] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 65 rows 48 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:25] [INFO ] State equation strengthened by 32 read => feed constraints.
[2021-05-14 08:19:25] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2021-05-14 08:19:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 48 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/55 places, 65/52 transitions.
Stuttering acceptance computed with spot in 62 ms :[p1, true, (OR (NOT p0) p1)]
Running random walk in product with property : Parking-PT-104-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s24 1) (EQ s47 1)), p0:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-08 finished in 197 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 51
Applied a total of 2 rules in 2 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:25] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-14 08:19:26] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:26] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:26] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/55 places, 51/52 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s4 0) (NEQ s42 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-09 finished in 184 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 52 transition count 49
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 52 transition count 47
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 50 transition count 47
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 46 transition count 43
Applied a total of 16 rules in 5 ms. Remains 46 /55 variables (removed 9) and now considering 43/52 (removed 9) transitions.
// Phase 1: matrix 43 rows 46 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:26] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 43 rows 46 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-14 08:19:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 46 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:26] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/55 places, 43/52 transitions.
Stuttering acceptance computed with spot in 26 ms :[p0]
Running random walk in product with property : Parking-PT-104-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s43 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 15 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-10 finished in 134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 51
Applied a total of 2 rules in 2 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-14 08:19:26] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:26] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/55 places, 51/52 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-11 automaton TGBA [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:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-104-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-11 finished in 164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(G(p0))&&(G(p1)||F(G(!p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 51
Applied a total of 2 rules in 2 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:26] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:26] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/55 places, 51/52 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), false, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Parking-PT-104-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={1, 2} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 2} source=2 dest: 3}], [{ cond=p1, acceptance={1, 2} source=3 dest: 2}, { cond=(NOT p1), acceptance={0, 2} source=3 dest: 3}, { cond=p1, acceptance={0, 1, 2} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s38 1), p0:(EQ s20 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5955 reset in 138 ms.
Stuttering criterion allowed to conclude after 82850 steps with 4930 reset in 135 ms.
FORMULA Parking-PT-104-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-14 finished in 499 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620980368164

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-104"
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-4028"
echo " Executing tool itstools"
echo " Input is Parking-PT-104, 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 r140-tall-162089127800413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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