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-162089127800412.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800412
=====================================================================

--------------------
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 1620980355163

Running Version 0
[2021-05-14 08:19:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:19:17] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-14 08:19:17] [INFO ] Transformed 65 places.
[2021-05-14 08:19:17] [INFO ] Transformed 97 transitions.
[2021-05-14 08:19:17] [INFO ] Found NUPN structural information;
[2021-05-14 08:19:17] [INFO ] Parsed PT model containing 65 places and 97 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
FORMULA Parking-PT-104-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 12 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2021-05-14 08:19:17] [INFO ] Computed 16 place invariants in 6 ms
[2021-05-14 08:19:17] [INFO ] Implicit Places using invariants in 96 ms returned [24, 32, 40, 48]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 125 ms to find 4 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2021-05-14 08:19:17] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 08:19:17] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Starting structural reductions, iteration 1 : 60/65 places, 55/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 58 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 53
Applied a total of 4 rules in 3 ms. Remains 58 /60 variables (removed 2) and now considering 53/55 (removed 2) transitions.
// Phase 1: matrix 53 rows 58 cols
[2021-05-14 08:19:17] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 08:19:17] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 53 rows 58 cols
[2021-05-14 08:19:17] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 08:19:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:17] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 58/65 places, 53/56 transitions.
[2021-05-14 08:19:17] [INFO ] Flatten gal took : 41 ms
FORMULA Parking-PT-104-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:19:17] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:19:17] [INFO ] Input system was already deterministic with 53 transitions.
Incomplete random walk after 100000 steps, including 5954 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 18) seen :16
Running SMT prover for 2 properties.
// Phase 1: matrix 53 rows 58 cols
[2021-05-14 08:19:18] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 08:19:18] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-14 08:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:19:18] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 08:19:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:19:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned unsat
[2021-05-14 08:19:18] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2021-05-14 08:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:19:18] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-14 08:19:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:19:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-14 08:19:18] [INFO ] Initial state test concluded for 2 properties.
FORMULA Parking-PT-104-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 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 51
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 51
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 49
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 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 53 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 53 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 50 transition count 45
Applied a total of 16 rules in 19 ms. Remains 50 /58 variables (removed 8) and now considering 45/53 (removed 8) transitions.
// Phase 1: matrix 45 rows 50 cols
[2021-05-14 08:19:18] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 08:19:18] [INFO ] Implicit Places using invariants in 47 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
[2021-05-14 08:19:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 49 cols
[2021-05-14 08:19:18] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 08:19:18] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 49/58 places, 45/53 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 48 transition count 44
Applied a total of 2 rules in 5 ms. Remains 48 /49 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 48 cols
[2021-05-14 08:19:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 08:19:18] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 44 rows 48 cols
[2021-05-14 08:19:18] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 08:19:18] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-14 08:19:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/58 places, 44/53 transitions.
Stuttering acceptance computed with spot in 115 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:(AND (NEQ s5 0) (NEQ s44 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 13 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-00 finished in 410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((G(p1) U (p2&&G(p1))))||p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 52
Applied a total of 2 rules in 8 ms. Remains 57 /58 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 57 cols
[2021-05-14 08:19:18] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 08:19:18] [INFO ] Implicit Places using invariants in 76 ms returned [51, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:18] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 55/58 places, 52/53 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:19] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:19] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:19] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:19] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 54/58 places, 51/53 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-104-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s31 0) (EQ s11 1)), p0:(OR (EQ s16 0) (EQ s28 1) (AND (EQ s22 0) (EQ s18 1))), p2:(OR (AND (EQ s22 0) (EQ s18 1)) (EQ s16 0) (EQ s28 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, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1699 steps with 101 reset in 15 ms.
FORMULA Parking-PT-104-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-01 finished in 345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 52
Applied a total of 2 rules in 3 ms. Remains 57 /58 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 57 cols
[2021-05-14 08:19:19] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 08:19:19] [INFO ] Implicit Places using invariants in 30 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
// Phase 1: matrix 52 rows 56 cols
[2021-05-14 08:19:19] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 08:19:19] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 56/58 places, 52/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 55 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 51
Applied a total of 2 rules in 12 ms. Remains 55 /56 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 55 cols
[2021-05-14 08:19:19] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 08:19:19] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 55 cols
[2021-05-14 08:19:19] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 08:19:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 55/58 places, 51/53 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), p0, false, false]
Running random walk in product with property : Parking-PT-104-03 automaton TGBA [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=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s51 0) (EQ s15 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 1 ms.
FORMULA Parking-PT-104-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-03 finished in 256 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 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 57 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 55 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 55 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 53 transition count 48
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 12 place count 51 transition count 46
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 51 transition count 46
Applied a total of 13 rules in 8 ms. Remains 51 /58 variables (removed 7) and now considering 46/53 (removed 7) transitions.
// Phase 1: matrix 46 rows 51 cols
[2021-05-14 08:19:19] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 08:19:19] [INFO ] Implicit Places using invariants in 30 ms returned [46, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
[2021-05-14 08:19:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 46 rows 49 cols
[2021-05-14 08:19:19] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 49/58 places, 46/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 45
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 4 place count 47 transition count 44
Applied a total of 4 rules in 5 ms. Remains 47 /49 variables (removed 2) and now considering 44/46 (removed 2) transitions.
// Phase 1: matrix 44 rows 47 cols
[2021-05-14 08:19:19] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:19] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 44 rows 47 cols
[2021-05-14 08:19:19] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:19] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 47/58 places, 44/53 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s18 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 6499 reset in 239 ms.
Product exploration explored 100000 steps with 6459 reset in 239 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6471 reset in 176 ms.
Stack based approach found an accepted trace after 10990 steps with 701 reset with depth 17 and stack size 17 in 14 ms.
FORMULA Parking-PT-104-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-07 finished in 945 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1)||(F(p0)&&X(!p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 52
Applied a total of 2 rules in 3 ms. Remains 57 /58 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 57 cols
[2021-05-14 08:19:20] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants in 56 ms returned [51, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 55/58 places, 52/53 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:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 54/58 places, 51/53 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-104-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (NEQ s47 0) (NEQ s5 1)), p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null][false]]
Stuttering criterion allowed to conclude after 13 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 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 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 57 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 55 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 55 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 53 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 52 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 52 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 16 place count 49 transition count 44
Applied a total of 16 rules in 6 ms. Remains 49 /58 variables (removed 9) and now considering 44/53 (removed 9) transitions.
// Phase 1: matrix 44 rows 49 cols
[2021-05-14 08:19:20] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants in 22 ms returned [44, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
[2021-05-14 08:19:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 47 cols
[2021-05-14 08:19:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 47/58 places, 44/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 43
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 4 place count 45 transition count 42
Applied a total of 4 rules in 5 ms. Remains 45 /47 variables (removed 2) and now considering 42/44 (removed 2) transitions.
// Phase 1: matrix 42 rows 45 cols
[2021-05-14 08:19:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 42 rows 45 cols
[2021-05-14 08:19:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/58 places, 42/53 transitions.
Stuttering acceptance computed with spot in 22 ms :[(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}]], initial=0, aps=[p0:(AND (NEQ s28 0) (NEQ s2 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 14 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 148 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 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 58 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 57 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 56 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 56 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 55 transition count 50
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 54 transition count 49
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 54 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 3 with 6 rules applied. Total rules applied 14 place count 51 transition count 46
Applied a total of 14 rules in 7 ms. Remains 51 /58 variables (removed 7) and now considering 46/53 (removed 7) transitions.
// Phase 1: matrix 46 rows 51 cols
[2021-05-14 08:19:20] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants in 23 ms returned [46, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
[2021-05-14 08:19:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 46 rows 49 cols
[2021-05-14 08:19:20] [INFO ] Computed 10 place invariants in 11 ms
[2021-05-14 08:19:20] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 49/58 places, 46/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 45
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 4 place count 47 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 46 transition count 63
Applied a total of 6 rules in 7 ms. Remains 46 /49 variables (removed 3) and now considering 63/46 (removed -17) transitions.
// Phase 1: matrix 63 rows 46 cols
[2021-05-14 08:19:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 63 rows 46 cols
[2021-05-14 08:19:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-14 08:19:20] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 46/58 places, 63/53 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (OR (EQ s7 0) (EQ s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 1 ms.
FORMULA Parking-PT-104-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-10 finished in 218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U (X(!p0)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 52
Applied a total of 2 rules in 1 ms. Remains 57 /58 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 57 cols
[2021-05-14 08:19:21] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 08:19:21] [INFO ] Implicit Places using invariants in 23 ms returned [51, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
// Phase 1: matrix 52 rows 55 cols
[2021-05-14 08:19:21] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 55/58 places, 52/53 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:21] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-14 08:19:21] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2021-05-14 08:19:21] [INFO ] Computed 10 place invariants in 0 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 37 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 54/58 places, 51/53 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : Parking-PT-104-11 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s10 0) (EQ s43 1)), p0:(OR (EQ s2 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-11 finished in 236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(G(p0)) U p1)&&G(F(!p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 53/53 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 57 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 55 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 55 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 53 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 52 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 52 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 14 place count 50 transition count 45
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 50 transition count 45
Applied a total of 15 rules in 9 ms. Remains 50 /58 variables (removed 8) and now considering 45/53 (removed 8) transitions.
// Phase 1: matrix 45 rows 50 cols
[2021-05-14 08:19:21] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 08:19:21] [INFO ] Implicit Places using invariants in 22 ms returned [45, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
[2021-05-14 08:19:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 48 cols
[2021-05-14 08:19:21] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 48/58 places, 45/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 47 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 44
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 4 place count 46 transition count 43
Applied a total of 4 rules in 5 ms. Remains 46 /48 variables (removed 2) and now considering 43/45 (removed 2) transitions.
// Phase 1: matrix 43 rows 46 cols
[2021-05-14 08:19:21] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-14 08:19:21] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 43 rows 46 cols
[2021-05-14 08:19:21] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-14 08:19:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 46/58 places, 43/53 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) p0), p0, p0, (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-104-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s21 1)), p1:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 1 reset in 0 ms.
FORMULA Parking-PT-104-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-14 finished in 272 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620980362423

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-162089127800412"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;