Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415900524.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Referendum-PT-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415900524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 46K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 267K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 18K 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 Referendum-PT-0015-00
FORMULA_NAME Referendum-PT-0015-01
FORMULA_NAME Referendum-PT-0015-02
FORMULA_NAME Referendum-PT-0015-03
FORMULA_NAME Referendum-PT-0015-04
FORMULA_NAME Referendum-PT-0015-05
FORMULA_NAME Referendum-PT-0015-06
FORMULA_NAME Referendum-PT-0015-07
FORMULA_NAME Referendum-PT-0015-08
FORMULA_NAME Referendum-PT-0015-09
FORMULA_NAME Referendum-PT-0015-10
FORMULA_NAME Referendum-PT-0015-11
FORMULA_NAME Referendum-PT-0015-12
FORMULA_NAME Referendum-PT-0015-13
FORMULA_NAME Referendum-PT-0015-14
FORMULA_NAME Referendum-PT-0015-15

=== Now, execution of the tool begins

BK_START 1621260539256

Running Version 0
[2021-05-17 14:09:00] [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 14:09:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:09:01] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-17 14:09:01] [INFO ] Transformed 46 places.
[2021-05-17 14:09:01] [INFO ] Transformed 31 transitions.
[2021-05-17 14:09:01] [INFO ] Found NUPN structural information;
[2021-05-17 14:09:01] [INFO ] Parsed PT model containing 46 places and 31 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:09:01] [INFO ] Initial state test concluded for 2 properties.
FORMULA Referendum-PT-0015-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 14:09:01] [INFO ] Computed 15 place invariants in 7 ms
[2021-05-17 14:09:01] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 14:09:01] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-17 14:09:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 14:09:01] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 14:09:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 31/31 transitions.
[2021-05-17 14:09:01] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:09:01] [INFO ] Flatten gal took : 20 ms
FORMULA Referendum-PT-0015-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:09:01] [INFO ] Flatten gal took : 6 ms
[2021-05-17 14:09:01] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 25 steps, including 1 resets, run visited all 15 properties in 2 ms. (steps per millisecond=12 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 15 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.4 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 16 transition count 16
Applied a total of 16 rules in 8 ms. Remains 16 /46 variables (removed 30) and now considering 16/31 (removed 15) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:01] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:01] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:01] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:01] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-17 14:09:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:01] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:01] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/46 places, 16/31 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0015-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], 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 16 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-00 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 16 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 31
Applied a total of 2 rules in 4 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 14:09:01] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:01] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 14:09:01] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-17 14:09:01] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-17 14:09:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 14:09:01] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:01] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0015-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 2 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p1:(LEQ s0 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2546 steps with 439 reset in 23 ms.
FORMULA Referendum-PT-0015-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-01 finished in 218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 15 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 16 transition count 16
Applied a total of 45 rules in 1 ms. Remains 16 /46 variables (removed 30) and now considering 16/31 (removed 15) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:02] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/46 places, 16/31 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-02 finished in 122 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 15 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 31 transition count 31
Applied a total of 15 rules in 1 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 31 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : Referendum-PT-0015-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], 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 6 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-03 finished in 158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U (p1&&X(!p1)&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 45 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 14:09:02] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 14:09:02] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 46 cols
[2021-05-17 14:09:02] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 14:09:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, true, (AND p1 p2), (NOT p2), true, p1, (NOT p2)]
Running random walk in product with property : Referendum-PT-0015-04 automaton TGBA [mat=[[{ cond=(OR (AND p1 p2) p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2 p0), acceptance={0} source=4 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 4}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15)), p2:(LEQ 1 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-04 finished in 297 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((F(G(p2))||p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 17 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 0 output transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 17 transition count 17
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 26 place count 6 transition count 6
Iterating global reduction 1 with 11 rules applied. Total rules applied 37 place count 6 transition count 6
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 1 with 2 rules applied. Total rules applied 39 place count 5 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 5 transition count 5
Applied a total of 40 rules in 4 ms. Remains 5 /46 variables (removed 41) and now considering 5/31 (removed 26) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-17 14:09:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:02] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/46 places, 5/31 transitions.
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : Referendum-PT-0015-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 0) (EQ s0 1)), p1:(OR (EQ s1 0) (EQ s4 1)), p2:(AND (EQ s3 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-08 finished in 109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 16 transition count 16
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 3 transition count 3
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 3 transition count 3
Applied a total of 71 rules in 0 ms. Remains 3 /46 variables (removed 43) and now considering 3/31 (removed 28) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:02] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:09:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:02] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/46 places, 3/31 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2 0) (EQ s0 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][false, false, false]]
Product exploration explored 100000 steps with 25110 reset in 148 ms.
Product exploration explored 100000 steps with 25041 reset in 99 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Referendum-PT-0015-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0015-12 finished in 436 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 19 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 19 transition count 19
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 24 place count 8 transition count 8
Iterating global reduction 1 with 11 rules applied. Total rules applied 35 place count 8 transition count 8
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 1 with 2 rules applied. Total rules applied 37 place count 7 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 7 transition count 7
Applied a total of 38 rules in 2 ms. Remains 7 /46 variables (removed 39) and now considering 7/31 (removed 24) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:09:03] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:03] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:09:03] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-17 14:09:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:09:03] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:03] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/46 places, 7/31 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0015-14 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 s4 0) (NEQ s6 1) (NEQ s5 0) (NEQ s1 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 4 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-14 finished in 107 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 18 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 0 output transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 18 transition count 18
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 25 place count 7 transition count 7
Iterating global reduction 1 with 11 rules applied. Total rules applied 36 place count 7 transition count 7
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 1 with 2 rules applied. Total rules applied 38 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 6 transition count 6
Applied a total of 39 rules in 2 ms. Remains 6 /46 variables (removed 40) and now considering 6/31 (removed 25) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:09:03] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:03] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:09:03] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:03] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-17 14:09:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:09:03] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:03] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/46 places, 6/31 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0015-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NEQ s0 1) (NEQ s5 0) (NEQ s3 1)), p0:(AND (EQ s0 0) (EQ s4 1)), p1:(AND (NEQ s5 0) (NEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 45 steps with 10 reset in 0 ms.
FORMULA Referendum-PT-0015-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-15 finished in 119 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621260544414

--------------------
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="Referendum-PT-0015"
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 Referendum-PT-0015, 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 r178-tajo-162089415900524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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