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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 132K 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 6.4K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 12K 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-0010-00
FORMULA_NAME Referendum-PT-0010-01
FORMULA_NAME Referendum-PT-0010-02
FORMULA_NAME Referendum-PT-0010-03
FORMULA_NAME Referendum-PT-0010-04
FORMULA_NAME Referendum-PT-0010-05
FORMULA_NAME Referendum-PT-0010-06
FORMULA_NAME Referendum-PT-0010-07
FORMULA_NAME Referendum-PT-0010-08
FORMULA_NAME Referendum-PT-0010-09
FORMULA_NAME Referendum-PT-0010-10
FORMULA_NAME Referendum-PT-0010-11
FORMULA_NAME Referendum-PT-0010-12
FORMULA_NAME Referendum-PT-0010-13
FORMULA_NAME Referendum-PT-0010-14
FORMULA_NAME Referendum-PT-0010-15

=== Now, execution of the tool begins

BK_START 1621260494835

Running Version 0
[2021-05-17 14:08:16] [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:08:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:08:16] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-17 14:08:16] [INFO ] Transformed 31 places.
[2021-05-17 14:08:16] [INFO ] Transformed 21 transitions.
[2021-05-17 14:08:16] [INFO ] Found NUPN structural information;
[2021-05-17 14:08:16] [INFO ] Parsed PT model containing 31 places and 21 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA Referendum-PT-0010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:16] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-17 14:08:16] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:16] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-17 14:08:16] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:16] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 14:08:16] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
[2021-05-17 14:08:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:08:17] [INFO ] Flatten gal took : 17 ms
FORMULA Referendum-PT-0010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:08:17] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:08:17] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 302 ms. (steps per millisecond=331 ) properties (out of 15) seen :13
Running SMT prover for 2 properties.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:17] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 14:08:17] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-17 14:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:08:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 14:08:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:08:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned unsat
[2021-05-17 14:08:17] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2021-05-17 14:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:08:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-17 14:08:17] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
[2021-05-17 14:08:17] [INFO ] Initial state test concluded for 1 properties.
FORMULA Referendum-PT-0010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 21
Applied a total of 10 rules in 1 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-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 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], 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 2 ms.
FORMULA Referendum-PT-0010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-02 finished in 272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||G((F(p2)&&F(p3))))))))], workingDir=/home/mcc/execution]
Support contains 21 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:17] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:17] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2021-05-17 14:08:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:17] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 14:08:18] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : Referendum-PT-0010-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (GT 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))), p1:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p2:(LEQ s0 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p3:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 21485 reset in 351 ms.
Stuttering criterion allowed to conclude after 17 steps with 3 reset in 0 ms.
FORMULA Referendum-PT-0010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-04 finished in 656 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (p0&&X(X(p1)))))], workingDir=/home/mcc/execution]
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:18] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 14:08:18] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:18] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 14:08:18] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:18] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 14:08:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=true, acceptance={0} source=2 dest: 5}, { cond=p0, acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p1:(OR (LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 211 ms.
Product exploration explored 100000 steps with 33333 reset in 174 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 21
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 (OR (G p0) (G (NOT p0)))), (F (G p1)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Product exploration explored 100000 steps with 33333 reset in 199 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 31 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2021-05-17 14:08:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 14:08:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Product exploration explored 100000 steps with 33333 reset in 349 ms.
Product exploration explored 100000 steps with 33333 reset in 293 ms.
[2021-05-17 14:08:21] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:08:21] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:08:21] [INFO ] Time to serialize gal into /tmp/LTL6792234649672067725.gal : 4 ms
[2021-05-17 14:08:21] [INFO ] Time to serialize properties into /tmp/LTL16497308576381117331.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/LTL6792234649672067725.gal, -t, CGAL, -LTL, /tmp/LTL16497308576381117331.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/LTL6792234649672067725.gal -t CGAL -LTL /tmp/LTL16497308576381117331.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)<=(((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10))")))U(("((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)<=(((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10))")&&(X(X("(((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)>=1)||(ready<=(((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)))"))))))
Formula 0 simplified : !(XG"((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)<=(((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10))" U ("((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)<=(((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10))" & XX"(((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)>=1)||(ready<=(((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 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.040396,18476,1,0,9,914,26,4,619,391,23
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Referendum-PT-0010-05 finished in 2946 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 30 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:21] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 14:08:21] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:21] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 14:08:21] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 14:08:21] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 14:08:21] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Referendum-PT-0010-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p0:(GT 3 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], 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]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-06 finished in 160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G((p0||F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 14 transition count 14
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 8 transition count 8
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 8 transition count 8
Applied a total of 36 rules in 2 ms. Remains 8 /31 variables (removed 23) and now considering 8/21 (removed 13) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:08:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:21] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:08:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:21] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:08:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:21] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/31 places, 8/21 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, 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:(AND (NEQ s0 0) (NEQ s3 1)), p1:(AND (NEQ s1 0) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-10 finished in 333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 12 transition count 12
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 5 transition count 5
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 5 transition count 5
Applied a total of 42 rules in 1 ms. Remains 5 /31 variables (removed 26) and now considering 5/21 (removed 16) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:08:22] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:22] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:08:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:22] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:08:22] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/31 places, 5/21 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Referendum-PT-0010-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s4 1)), p0:(AND (EQ s4 0) (EQ s1 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-12 finished in 207 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 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 14 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 14 transition count 14
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 8 transition count 8
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 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 22 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 23 place count 7 transition count 7
Applied a total of 23 rules in 4 ms. Remains 7 /31 variables (removed 24) and now considering 7/21 (removed 14) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:08:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:22] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:08:22] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:08:22] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-17 14:08:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:08:22] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/31 places, 7/21 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0010-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 (OR (EQ s1 0) (EQ s2 1)) (OR (EQ s3 0) (EQ s0 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-0010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-14 finished in 155 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621260502903

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

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