Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
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 r150-smll-165276998700300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 6.5K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 23K May 10 09:34 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-LTLFireability-00
FORMULA_NAME Parking-PT-104-LTLFireability-01
FORMULA_NAME Parking-PT-104-LTLFireability-02
FORMULA_NAME Parking-PT-104-LTLFireability-03
FORMULA_NAME Parking-PT-104-LTLFireability-04
FORMULA_NAME Parking-PT-104-LTLFireability-05
FORMULA_NAME Parking-PT-104-LTLFireability-06
FORMULA_NAME Parking-PT-104-LTLFireability-07
FORMULA_NAME Parking-PT-104-LTLFireability-08
FORMULA_NAME Parking-PT-104-LTLFireability-09
FORMULA_NAME Parking-PT-104-LTLFireability-10
FORMULA_NAME Parking-PT-104-LTLFireability-11
FORMULA_NAME Parking-PT-104-LTLFireability-12
FORMULA_NAME Parking-PT-104-LTLFireability-13
FORMULA_NAME Parking-PT-104-LTLFireability-14
FORMULA_NAME Parking-PT-104-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653051153236

Running Version 202205111006
[2022-05-20 12:52:35] [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]
[2022-05-20 12:52:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:52:36] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-05-20 12:52:36] [INFO ] Transformed 65 places.
[2022-05-20 12:52:36] [INFO ] Transformed 97 transitions.
[2022-05-20 12:52:36] [INFO ] Found NUPN structural information;
[2022-05-20 12:52:36] [INFO ] Parsed PT model containing 65 places and 97 transitions in 383 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
FORMULA Parking-PT-104-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2022-05-20 12:52:36] [INFO ] Computed 16 place invariants in 12 ms
[2022-05-20 12:52:36] [INFO ] Implicit Places using invariants in 425 ms returned [24, 32, 40, 48, 58]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 489 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 58 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 54
Applied a total of 4 rules in 8 ms. Remains 58 /60 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 58 cols
[2022-05-20 12:52:36] [INFO ] Computed 11 place invariants in 10 ms
[2022-05-20 12:52:37] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 54 rows 58 cols
[2022-05-20 12:52:37] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-20 12:52:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:37] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/65 places, 54/56 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/65 places, 54/56 transitions.
Support contains 33 out of 58 places after structural reductions.
[2022-05-20 12:52:37] [INFO ] Flatten gal took : 55 ms
[2022-05-20 12:52:37] [INFO ] Flatten gal took : 22 ms
[2022-05-20 12:52:37] [INFO ] Input system was already deterministic with 54 transitions.
Support contains 30 out of 58 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 593 resets, run finished after 1044 ms. (steps per millisecond=9 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 54 rows 58 cols
[2022-05-20 12:52:39] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-20 12:52:39] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-20 12:52:39] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2022-05-20 12:52:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-20 12:52:39] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-05-20 12:52:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:39] [INFO ] After 29ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2022-05-20 12:52:39] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-20 12:52:39] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
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 56 transition count 50
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
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 20 place count 48 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 22 place count 47 transition count 47
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 47 transition count 40
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 36 place count 40 transition count 40
Applied a total of 36 rules in 54 ms. Remains 40 /58 variables (removed 18) and now considering 40/54 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/58 places, 40/54 transitions.
Incomplete random walk after 10000 steps, including 274 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 12:52:40] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-20 12:52:40] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:52:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-20 12:52:40] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:52:40] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-20 12:52:40] [INFO ] After 21ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:52:40] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-20 12:52:40] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 28 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA Parking-PT-104-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!X(X(p0)) U p1)||!(!(!p1 U p2) U p0)))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 7 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2022-05-20 12:52:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:40] [INFO ] Implicit Places using invariants in 87 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 931 ms :[true, (NOT p2), (NOT p0), (AND p0 p1), p0, (AND (NOT p0) p1), false, (AND p0 (NOT p2)), (AND p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), false, false]
Running random walk in product with property : Parking-PT-104-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 7}]], initial=3, aps=[p2:(AND (EQ s14 1) (EQ s36 1)), p1:(EQ s10 1), p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 14 reset in 5 ms.
FORMULA Parking-PT-104-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-01 finished in 1149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(p1)))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 8 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2022-05-20 12:52:41] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:41] [INFO ] Implicit Places using invariants in 89 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-104-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (EQ s4 0) (EQ s15 0) (EQ s41 0)), p1:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-02 finished in 295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Reduce places removed 1 places and 1 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 57 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 52
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 56 transition count 51
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 55 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 52 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 52 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 16 place count 49 transition count 45
Applied a total of 16 rules in 26 ms. Remains 49 /58 variables (removed 9) and now considering 45/54 (removed 9) transitions.
// Phase 1: matrix 45 rows 49 cols
[2022-05-20 12:52:42] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 12:52:42] [INFO ] Implicit Places using invariants in 79 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/58 places, 45/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 44
Applied a total of 2 rules in 11 ms. Remains 47 /48 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 47 cols
[2022-05-20 12:52:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 12:52:42] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 44 rows 47 cols
[2022-05-20 12:52:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 12:52:42] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/58 places, 44/54 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/58 places, 44/54 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s32 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 88 steps with 5 reset in 8 ms.
FORMULA Parking-PT-104-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-03 finished in 457 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 8 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2022-05-20 12:52:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:42] [INFO ] Implicit Places using invariants in 75 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-04 finished in 327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)||p0)))'
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
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 56 transition count 50
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 54 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 53 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 53 transition count 49
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 2 with 4 rules applied. Total rules applied 14 place count 51 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 51 transition count 47
Applied a total of 15 rules in 25 ms. Remains 51 /58 variables (removed 7) and now considering 47/54 (removed 7) transitions.
// Phase 1: matrix 47 rows 51 cols
[2022-05-20 12:52:42] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 12:52:42] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2022-05-20 12:52:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-20 12:52:43] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2022-05-20 12:52:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2022-05-20 12:52:43] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 12:52:43] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/58 places, 47/54 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/58 places, 47/54 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s48 1) (AND (EQ s37 1) (EQ s47 1)) (AND (EQ s6 1) (EQ s23 1))), p1:(OR (EQ s48 1) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 626 ms.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-104-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-104-LTLFireability-06 finished in 1551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Reduce places removed 1 places and 1 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 57 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 52
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 56 transition count 51
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 55 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 52 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 52 transition count 48
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 16 place count 49 transition count 45
Applied a total of 16 rules in 13 ms. Remains 49 /58 variables (removed 9) and now considering 45/54 (removed 9) transitions.
// Phase 1: matrix 45 rows 49 cols
[2022-05-20 12:52:44] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:44] [INFO ] Implicit Places using invariants in 59 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/58 places, 45/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 44
Applied a total of 2 rules in 8 ms. Remains 47 /48 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 47 cols
[2022-05-20 12:52:44] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-20 12:52:44] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 44 rows 47 cols
[2022-05-20 12:52:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:44] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/58 places, 44/54 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/58 places, 44/54 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-07 finished in 315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Reduce places removed 1 places and 1 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 57 transition count 52
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 56 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 55 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 55 transition count 50
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 51 transition count 47
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 51 transition count 47
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 3 with 6 rules applied. Total rules applied 18 place count 48 transition count 44
Applied a total of 18 rules in 16 ms. Remains 48 /58 variables (removed 10) and now considering 44/54 (removed 10) transitions.
// Phase 1: matrix 44 rows 48 cols
[2022-05-20 12:52:44] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:44] [INFO ] Implicit Places using invariants in 66 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/58 places, 44/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 43
Applied a total of 2 rules in 6 ms. Remains 46 /47 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 46 cols
[2022-05-20 12:52:44] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-20 12:52:44] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 43 rows 46 cols
[2022-05-20 12:52:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 43/54 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/58 places, 43/54 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-104-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s4 1) (NEQ s40 1)), p1:(NEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6713 reset in 446 ms.
Product exploration explored 100000 steps with 6717 reset in 229 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 : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1011 steps, including 65 resets, run visited all 2 properties in 9 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 43/43 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 46 cols
[2022-05-20 12:52:46] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-20 12:52:46] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 43 rows 46 cols
[2022-05-20 12:52:46] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-20 12:52:46] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2022-05-20 12:52:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 43 rows 46 cols
[2022-05-20 12:52:46] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 43/43 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 : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 613 steps, including 39 resets, run visited all 2 properties in 3 ms. (steps per millisecond=204 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 6707 reset in 231 ms.
Product exploration explored 100000 steps with 6685 reset in 238 ms.
Built C files in :
/tmp/ltsmin13242354497862672655
[2022-05-20 12:52:48] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2022-05-20 12:52:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:48] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2022-05-20 12:52:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:48] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2022-05-20 12:52:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:48] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13242354497862672655
Running compilation step : cd /tmp/ltsmin13242354497862672655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 378 ms.
Running link step : cd /tmp/ltsmin13242354497862672655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13242354497862672655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18036784543828792644.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA Parking-PT-104-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLFireability-08 finished in 4639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(p1)&&X(F(G(p2)))&&p0))||p1)))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 1 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2022-05-20 12:52:49] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:49] [INFO ] Implicit Places using invariants in 49 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Parking-PT-104-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s20 1), p0:(AND (EQ s16 1) (EQ s45 1)), p2:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-10 finished in 309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(F(X(X((X(p0)||p1)))))))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
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 56 transition count 50
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
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 2 with 4 rules applied. Total rules applied 18 place count 49 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 48
Applied a total of 20 rules in 28 ms. Remains 48 /58 variables (removed 10) and now considering 48/54 (removed 6) transitions.
// Phase 1: matrix 48 rows 48 cols
[2022-05-20 12:52:49] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:49] [INFO ] Implicit Places using invariants in 83 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/58 places, 48/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 63
Applied a total of 2 rules in 8 ms. Remains 46 /47 variables (removed 1) and now considering 63/48 (removed -15) transitions.
// Phase 1: matrix 63 rows 46 cols
[2022-05-20 12:52:49] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-20 12:52:49] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 63 rows 46 cols
[2022-05-20 12:52:49] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-20 12:52:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-20 12:52:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 63/54 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/58 places, 63/54 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-104-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s24 0), p0:(OR (EQ s4 0) (EQ s36 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6436 reset in 229 ms.
Product exploration explored 100000 steps with 6455 reset in 242 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 642 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Probably explored full state space saw : 13825 states, properties seen :0
Probabilistic random walk after 89094 steps, saw 13825 distinct states, run finished after 304 ms. (steps per millisecond=293 ) properties seen :0
Explored full state space saw : 13825 states, properties seen :0
Exhaustive walk after 89094 steps, saw 13825 distinct states, run finished after 144 ms. (steps per millisecond=618 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-104-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-104-LTLFireability-11 finished in 1960 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)||G(p1)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 56 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Applied a total of 4 rules in 3 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2022-05-20 12:52:51] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:51] [INFO ] Implicit Places using invariants in 61 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/58 places, 52/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 55/58 places, 52/54 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-104-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s12 1), p0:(OR (EQ s39 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-12 finished in 157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(p0)&&p1)))||G(p0)))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 56 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Applied a total of 4 rules in 2 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2022-05-20 12:52:51] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:51] [INFO ] Implicit Places using invariants in 57 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/58 places, 52/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 55/58 places, 52/54 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s8 1) (EQ s43 1)), p1:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-13 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
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 56 transition count 50
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
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 20 place count 48 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 22 place count 47 transition count 47
Applied a total of 22 rules in 12 ms. Remains 47 /58 variables (removed 11) and now considering 47/54 (removed 7) transitions.
// Phase 1: matrix 47 rows 47 cols
[2022-05-20 12:52:52] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 12:52:52] [INFO ] Implicit Places using invariants in 60 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/58 places, 47/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 62
Applied a total of 2 rules in 6 ms. Remains 45 /46 variables (removed 1) and now considering 62/47 (removed -15) transitions.
// Phase 1: matrix 62 rows 45 cols
[2022-05-20 12:52:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:52] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 62 rows 45 cols
[2022-05-20 12:52:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-20 12:52:52] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/58 places, 62/54 transitions.
Finished structural reductions, in 2 iterations. Remains : 45/58 places, 62/54 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 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 12 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-14 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X(p0) U G(p1)))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 56 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Applied a total of 4 rules in 3 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2022-05-20 12:52:52] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 12:52:52] [INFO ] Implicit Places using invariants in 68 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/58 places, 52/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 55/58 places, 52/54 transitions.
Stuttering acceptance computed with spot in 124 ms :[p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : Parking-PT-104-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s51 1), p0:(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][false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-15 finished in 212 ms.
All properties solved by simple procedures.
Total runtime 16932 ms.

BK_STOP 1653051172830

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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 r150-smll-165276998700300"
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 ;