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.r064-tall-162038396700084.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 DES-PT-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 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 57K 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 DES-PT-20a-00
FORMULA_NAME DES-PT-20a-01
FORMULA_NAME DES-PT-20a-02
FORMULA_NAME DES-PT-20a-03
FORMULA_NAME DES-PT-20a-04
FORMULA_NAME DES-PT-20a-05
FORMULA_NAME DES-PT-20a-06
FORMULA_NAME DES-PT-20a-07
FORMULA_NAME DES-PT-20a-08
FORMULA_NAME DES-PT-20a-09
FORMULA_NAME DES-PT-20a-10
FORMULA_NAME DES-PT-20a-11
FORMULA_NAME DES-PT-20a-12
FORMULA_NAME DES-PT-20a-13
FORMULA_NAME DES-PT-20a-14
FORMULA_NAME DES-PT-20a-15

=== Now, execution of the tool begins

BK_START 1620468986218

Running Version 0
[2021-05-08 10:16:38] [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-08 10:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:16:38] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-08 10:16:38] [INFO ] Transformed 195 places.
[2021-05-08 10:16:38] [INFO ] Transformed 152 transitions.
[2021-05-08 10:16:38] [INFO ] Found NUPN structural information;
[2021-05-08 10:16:38] [INFO ] Parsed PT model containing 195 places and 152 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 10:16:38] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 61 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:16:38] [INFO ] Computed 59 place invariants in 21 ms
[2021-05-08 10:16:38] [INFO ] Implicit Places using invariants in 234 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 259 ms to find 1 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:38] [INFO ] Computed 58 place invariants in 5 ms
[2021-05-08 10:16:38] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:38] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 10:16:38] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
[2021-05-08 10:16:39] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-08 10:16:39] [INFO ] Flatten gal took : 49 ms
FORMULA DES-PT-20a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:16:39] [INFO ] Flatten gal took : 20 ms
[2021-05-08 10:16:39] [INFO ] Input system was already deterministic with 137 transitions.
Incomplete random walk after 100000 steps, including 2220 resets, run finished after 403 ms. (steps per millisecond=248 ) properties (out of 12) seen :5
Running SMT prover for 7 properties.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:39] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-08 10:16:39] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 10:16:39] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:39] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-08 10:16:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned unsat
[2021-05-08 10:16:39] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:39] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2021-05-08 10:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:39] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-08 10:16:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:39] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 82 ms returned sat
[2021-05-08 10:16:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:39] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-08 10:16:39] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 19 ms.
[2021-05-08 10:16:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
[2021-05-08 10:16:40] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2021-05-08 10:16:40] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2021-05-08 10:16:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2021-05-08 10:16:40] [INFO ] Added : 88 causal constraints over 19 iterations in 457 ms. Result :sat
[2021-05-08 10:16:40] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 10:16:40] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:40] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-08 10:16:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned unsat
[2021-05-08 10:16:40] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:40] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:40] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-08 10:16:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 10:16:40] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 76 ms returned sat
[2021-05-08 10:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:40] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-08 10:16:40] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 11 ms.
[2021-05-08 10:16:41] [INFO ] Added : 90 causal constraints over 18 iterations in 264 ms. Result :sat
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-08 10:16:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 92 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:41] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-08 10:16:41] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 9 ms.
[2021-05-08 10:16:41] [INFO ] Added : 92 causal constraints over 20 iterations in 225 ms. Result :sat
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-08 10:16:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 76 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:41] [INFO ] [Nat]Absence check using state equation in 48 ms returned unsat
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:41] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-08 10:16:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:16:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 10:16:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 67 ms returned sat
[2021-05-08 10:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:16:42] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-08 10:16:42] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2021-05-08 10:16:42] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2021-05-08 10:16:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2021-05-08 10:16:42] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 9 ms.
[2021-05-08 10:16:42] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2021-05-08 10:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-08 10:16:42] [INFO ] Added : 81 causal constraints over 17 iterations in 242 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
[2021-05-08 10:16:42] [INFO ] Initial state test concluded for 1 properties.
FORMULA DES-PT-20a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:42] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:16:42] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:42] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:16:42] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:42] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 10:16:42] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-20a-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(OR (EQ s148 0) (EQ s130 1)), p0:(AND (EQ s148 0) (EQ s81 1) (EQ s85 0) (EQ s13 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 2 ms.
FORMULA DES-PT-20a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-02 finished in 684 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 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 14 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:43] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:16:43] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:43] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:16:43] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2021-05-08 10:16:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:43] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:16:43] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 9694 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s110 0) (EQ s121 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 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-04 finished in 10067 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:53] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:16:53] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:53] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:16:53] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:53] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:16:53] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20a-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s9 1), p0:(OR (EQ s50 0) (EQ s164 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 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-08 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:53] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:16:53] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:53] [INFO ] Computed 58 place invariants in 9 ms
[2021-05-08 10:16:53] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:16:53] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:16:54] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-10 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s134 0) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-10 finished in 437 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2021-05-08 10:16:54] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:16:54] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 136 rows 192 cols
[2021-05-08 10:16:54] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-08 10:16:54] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2021-05-08 10:16:54] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 136 rows 192 cols
[2021-05-08 10:16:54] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:16:54] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s41 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 33 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-14 finished in 390 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620469015497

--------------------
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="DES-PT-20a"
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 DES-PT-20a, 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 r064-tall-162038396700084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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