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.r292-tall-162124155800004.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 CANConstruction-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155800004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 12 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 12 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 11 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 167K May 12 08:13 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 CANConstruction-PT-005-00
FORMULA_NAME CANConstruction-PT-005-01
FORMULA_NAME CANConstruction-PT-005-02
FORMULA_NAME CANConstruction-PT-005-03
FORMULA_NAME CANConstruction-PT-005-04
FORMULA_NAME CANConstruction-PT-005-05
FORMULA_NAME CANConstruction-PT-005-06
FORMULA_NAME CANConstruction-PT-005-07
FORMULA_NAME CANConstruction-PT-005-08
FORMULA_NAME CANConstruction-PT-005-09
FORMULA_NAME CANConstruction-PT-005-10
FORMULA_NAME CANConstruction-PT-005-11
FORMULA_NAME CANConstruction-PT-005-12
FORMULA_NAME CANConstruction-PT-005-13
FORMULA_NAME CANConstruction-PT-005-14
FORMULA_NAME CANConstruction-PT-005-15

=== Now, execution of the tool begins

BK_START 1621242820303

Running Version 0
[2021-05-17 09:13:41] [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-17 09:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 09:13:42] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-17 09:13:42] [INFO ] Transformed 112 places.
[2021-05-17 09:13:42] [INFO ] Transformed 140 transitions.
[2021-05-17 09:13:42] [INFO ] Parsed PT model containing 112 places and 140 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 09:13:42] [INFO ] Initial state test concluded for 3 properties.
FORMULA CANConstruction-PT-005-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 112 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 101 transition count 118
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 101 transition count 118
Applied a total of 22 rules in 20 ms. Remains 101 /112 variables (removed 11) and now considering 118/140 (removed 22) transitions.
// Phase 1: matrix 118 rows 101 cols
[2021-05-17 09:13:42] [INFO ] Computed 11 place invariants in 14 ms
[2021-05-17 09:13:42] [INFO ] Implicit Places using invariants in 150 ms returned [12, 26, 40, 54, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 177 ms to find 5 implicit places.
// Phase 1: matrix 118 rows 96 cols
[2021-05-17 09:13:42] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-17 09:13:42] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 96/112 places, 118/140 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 115
Applied a total of 6 rules in 7 ms. Remains 93 /96 variables (removed 3) and now considering 115/118 (removed 3) transitions.
// Phase 1: matrix 115 rows 93 cols
[2021-05-17 09:13:42] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-17 09:13:42] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 115 rows 93 cols
[2021-05-17 09:13:42] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:42] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 93/112 places, 115/140 transitions.
[2021-05-17 09:13:42] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 33 ms
FORMULA CANConstruction-PT-005-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 12 ms
[2021-05-17 09:13:42] [INFO ] Input system was already deterministic with 115 transitions.
Incomplete random walk after 100000 steps, including 1281 resets, run finished after 316 ms. (steps per millisecond=316 ) properties (out of 18) seen :13
Running SMT prover for 5 properties.
// Phase 1: matrix 115 rows 93 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-17 09:13:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-17 09:13:43] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 09:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 09:13:43] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-17 09:13:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 09:13:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-17 09:13:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-17 09:13:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
[2021-05-17 09:13:43] [INFO ] Initial state test concluded for 4 properties.
FORMULA CANConstruction-PT-005-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-14 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 1 out of 93 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 93/93 places, 115/115 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 93 transition count 82
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 60 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 59 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 68 place count 59 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 76 place count 55 transition count 77
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 51 transition count 69
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 51 transition count 69
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 51 transition count 65
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 92 place count 47 transition count 65
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 5 with 6 rules applied. Total rules applied 98 place count 44 transition count 62
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 108 place count 39 transition count 72
Applied a total of 108 rules in 23 ms. Remains 39 /93 variables (removed 54) and now considering 72/115 (removed 43) transitions.
// Phase 1: matrix 72 rows 39 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:43] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 72 rows 39 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:43] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-17 09:13:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2021-05-17 09:13:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 39 cols
[2021-05-17 09:13:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:43] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/93 places, 72/115 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s13)], 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 4123 reset in 256 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 15 in 1 ms.
FORMULA CANConstruction-PT-005-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-00 finished in 585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 93/93 places, 115/115 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 93 transition count 81
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 59 transition count 81
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 68 place count 59 transition count 76
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 54 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 49 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 49 transition count 67
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 49 transition count 64
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 46 transition count 64
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 4 with 6 rules applied. Total rules applied 100 place count 43 transition count 61
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 110 place count 38 transition count 71
Applied a total of 110 rules in 14 ms. Remains 38 /93 variables (removed 55) and now considering 71/115 (removed 44) transitions.
// Phase 1: matrix 71 rows 38 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 71 rows 38 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:44] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2021-05-17 09:13:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 71 rows 38 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:44] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/93 places, 71/115 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-01 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:(LEQ s10 s34)], 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 26 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-01 finished in 255 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0&&F(p1)) U (G((G(p0)||(p0&&F(p1))))||(p2&&(G(p0)||(p0&&F(p1)))&&X(p3))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 93/93 places, 115/115 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 107
Applied a total of 10 rules in 6 ms. Remains 88 /93 variables (removed 5) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-17 09:13:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:44] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/93 places, 107/115 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s37), p2:(GT s22 s74), p1:(GT s79 s6), p3:(GT s56 s50)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 235 steps with 3 reset in 2 ms.
FORMULA CANConstruction-PT-005-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-02 finished in 447 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 93/93 places, 115/115 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 107
Applied a total of 10 rules in 6 ms. Remains 88 /93 variables (removed 5) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-17 09:13:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:44] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 88 cols
[2021-05-17 09:13:44] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 09:13:44] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/93 places, 107/115 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s51 s10), p1:(GT s71 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-15 finished in 274 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621242826282

--------------------
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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r292-tall-162124155800004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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