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-162089415900540.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-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415900540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 574K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 266K 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 23K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Mar 27 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 27 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Mar 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K 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 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 Referendum-PT-0050-00
FORMULA_NAME Referendum-PT-0050-01
FORMULA_NAME Referendum-PT-0050-02
FORMULA_NAME Referendum-PT-0050-03
FORMULA_NAME Referendum-PT-0050-04
FORMULA_NAME Referendum-PT-0050-05
FORMULA_NAME Referendum-PT-0050-06
FORMULA_NAME Referendum-PT-0050-07
FORMULA_NAME Referendum-PT-0050-08
FORMULA_NAME Referendum-PT-0050-09
FORMULA_NAME Referendum-PT-0050-10
FORMULA_NAME Referendum-PT-0050-11
FORMULA_NAME Referendum-PT-0050-12
FORMULA_NAME Referendum-PT-0050-13
FORMULA_NAME Referendum-PT-0050-14
FORMULA_NAME Referendum-PT-0050-15

=== Now, execution of the tool begins

BK_START 1621260603872

Running Version 0
[2021-05-17 14:10:05] [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:10:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:10:05] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-17 14:10:05] [INFO ] Transformed 151 places.
[2021-05-17 14:10:05] [INFO ] Transformed 101 transitions.
[2021-05-17 14:10:05] [INFO ] Found NUPN structural information;
[2021-05-17 14:10:05] [INFO ] Parsed PT model containing 151 places and 101 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:10:05] [INFO ] Initial state test concluded for 4 properties.
FORMULA Referendum-PT-0050-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 151 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 8 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:06] [INFO ] Computed 50 place invariants in 16 ms
[2021-05-17 14:10:06] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:06] [INFO ] Computed 50 place invariants in 5 ms
[2021-05-17 14:10:06] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:06] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-17 14:10:06] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 101/101 transitions.
[2021-05-17 14:10:06] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 14:10:06] [INFO ] Flatten gal took : 38 ms
FORMULA Referendum-PT-0050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:10:06] [INFO ] Flatten gal took : 12 ms
[2021-05-17 14:10:06] [INFO ] Input system was already deterministic with 101 transitions.
Incomplete random walk after 100000 steps, including 1923 resets, run finished after 621 ms. (steps per millisecond=161 ) properties (out of 14) seen :12
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:07] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-17 14:10:07] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-17 14:10:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:10:07] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-17 14:10:07] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
[2021-05-17 14:10:07] [INFO ] Initial state test concluded for 1 properties.
FORMULA Referendum-PT-0050-13 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 50 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 101 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.2 ms
Discarding 50 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 13 ms. Remains 100 /151 variables (removed 51) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-05-17 14:10:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:07] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-05-17 14:10:07] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:10:07] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2021-05-17 14:10:07] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-05-17 14:10:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:07] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/151 places, 100/101 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0050-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 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], 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 50 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-00 finished in 418 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 51 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 51 transition count 51
Applied a total of 150 rules in 2 ms. Remains 51 /151 variables (removed 100) and now considering 51/101 (removed 50) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:07] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:08] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:08] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/151 places, 51/101 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-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 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50) s0)], 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 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-02 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(!p0) U (G((p1&&F(p2)))&&X(F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 101 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:08] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-17 14:10:08] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:08] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-17 14:10:08] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:08] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-17 14:10:08] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2), (OR (NOT p2) (NOT p1)), p0, (OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Referendum-PT-0050-04 automaton TGBA [mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50) s0), p0:(GT 1 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100)), p2:(LEQ s0 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 3 reset in 1 ms.
FORMULA Referendum-PT-0050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-04 finished in 488 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 101 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:08] [INFO ] Computed 50 place invariants in 0 ms
[2021-05-17 14:10:08] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:08] [INFO ] Computed 50 place invariants in 5 ms
[2021-05-17 14:10:08] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 14:10:08] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-17 14:10:08] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0050-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50) (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100)), p1:(GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-06 finished in 264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 51 transition count 51
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 198 place count 3 transition count 3
Iterating global reduction 1 with 48 rules applied. Total rules applied 246 place count 3 transition count 3
Applied a total of 246 rules in 4 ms. Remains 3 /151 variables (removed 148) and now considering 3/101 (removed 98) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:08] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/151 places, 3/101 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-08 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:(AND (NEQ s2 0) (NEQ s0 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-08 finished in 105 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((F(p1)&&F(p2)))||p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 55 transition count 55
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 186 place count 11 transition count 11
Iterating global reduction 1 with 44 rules applied. Total rules applied 230 place count 11 transition count 11
Applied a total of 230 rules in 2 ms. Remains 11 /151 variables (removed 140) and now considering 11/101 (removed 90) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:10:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:09] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:10:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:09] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:10:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:09] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/151 places, 11/101 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s9 0) (EQ s3 1)), p1:(AND (NEQ s1 0) (NEQ s2 1)), p0:(OR (EQ s0 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p2)), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), p2, (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Applying partial POR strategy [false, true, true, false, true]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Support contains 6 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-17 14:10:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:10:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:10] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
[2021-05-17 14:10:10] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:10:10] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:10:10] [INFO ] Time to serialize gal into /tmp/LTL11320661192413113104.gal : 2 ms
[2021-05-17 14:10:10] [INFO ] Time to serialize properties into /tmp/LTL6735942267522784446.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11320661192413113104.gal, -t, CGAL, -LTL, /tmp/LTL6735942267522784446.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11320661192413113104.gal -t CGAL -LTL /tmp/LTL6735942267522784446.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((ready==0)||(voted_yes_47==1))")||(X((F("((voted_no_11!=0)&&(voted_yes_12!=1))"))&&(F("((voting_40==0)||(voted_yes_32==1))")))))))
Formula 0 simplified : !X("((ready==0)||(voted_yes_47==1))" | X(F"((voted_no_11!=0)&&(voted_yes_12!=1))" & F"((voting_40==0)||(voted_yes_32==1))"))
Reverse transition relation is NOT exact ! Due to transitions t12, t32, t47, t51, t61, t90, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/6/11
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.033553,16404,1,0,39,710,42,16,333,575,33
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0050-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0050-10 finished in 1995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 55 transition count 55
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 186 place count 11 transition count 11
Iterating global reduction 1 with 44 rules applied. Total rules applied 230 place count 11 transition count 11
Applied a total of 230 rules in 4 ms. Remains 11 /151 variables (removed 140) and now considering 11/101 (removed 90) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/151 places, 11/101 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0050-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s4 0) (EQ s0 1)) (OR (EQ s7 0) (EQ s1 1))), p1:(AND (NEQ s2 0) (NEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 112 steps with 2 reset in 1 ms.
FORMULA Referendum-PT-0050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-14 finished in 206 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621260611769

--------------------
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-0050"
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-0050, 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-162089415900540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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