Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r141-smll-158961511000394.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961511000394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 9.1K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 08:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 11 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 11 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 9 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 12K Mar 24 05:38 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 1590119019645

[2020-05-22 03:43:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 03:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 03:43:42] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-05-22 03:43:42] [INFO ] Transformed 31 places.
[2020-05-22 03:43:42] [INFO ] Transformed 21 transitions.
[2020-05-22 03:43:42] [INFO ] Found NUPN structural information;
[2020-05-22 03:43:42] [INFO ] Parsed PT model containing 31 places and 21 transitions in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 483 ms. (steps per millisecond=207 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 21 rows 31 cols
[2020-05-22 03:43:42] [INFO ] Computed 10 place invariants in 6 ms
[2020-05-22 03:43:43] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned unsat
[2020-05-22 03:43:43] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-22 03:43:43] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 03:43:43] [INFO ] Flatten gal took : 33 ms
FORMULA Referendum-PT-0010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 03:43:43] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 03:43:43] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 03:43:43] [INFO ] Flatten gal took : 17 ms
[2020-05-22 03:43:43] [INFO ] Input system was already deterministic with 21 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10778368742522704018.txt, -o, /tmp/graph10778368742522704018.bin, -w, /tmp/graph10778368742522704018.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 21 rows 31 cols
[2020-05-22 03:43:43] [INFO ] Computed 10 place invariants in 2 ms
inv : ready + voted_no_7 + voted_yes_7 + voting_7 = 1
inv : ready + voted_no_3 + voted_yes_3 + voting_3 = 1
inv : ready + voted_no_2 + voted_yes_2 + voting_2 = 1
inv : ready + voted_no_8 + voted_yes_8 + voting_8 = 1
inv : ready + voted_no_9 + voted_yes_9 + voting_9 = 1
inv : ready + voted_no_1 + voted_yes_1 + voting_1 = 1
inv : ready + voted_no_10 + voted_yes_10 + voting_10 = 1
inv : ready + voted_no_4 + voted_yes_4 + voting_4 = 1
inv : ready + voted_no_6 + voted_yes_6 + voting_6 = 1
inv : ready + voted_no_5 + voted_yes_5 + voting_5 = 1
Total of 10 invariants.
[2020-05-22 03:43:43] [INFO ] Computed 10 place invariants in 6 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10778368742522704018.bin, -l, -1, -v, -w, /tmp/graph10778368742522704018.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 03:43:43] [INFO ] Decomposing Gal with order
[2020-05-22 03:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 03:43:43] [INFO ] Flatten gal took : 33 ms
[2020-05-22 03:43:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-22 03:43:43] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-22 03:43:43] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((G((!(X(F("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))))&&((!(F("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))")))||("((((((((((u2.voting_1!=1)&&(u3.voting_2!=1))&&(u4.voting_3!=1))&&(u5.voting_4!=1))&&(u0.voting_5!=1))&&(u1.voting_6!=1))&&(u6.voting_7!=1))&&(u7.voting_8!=1))&&(u8.voting_9!=1))&&(u9.voting_10!=1))")))))
Formula 0 simplified : !G(!XF"((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" & ("((((((((((u2.voting_1!=1)&&(u3.voting_2!=1))&&(u4.voting_3!=1))&&(u5.voting_4!=1))&&(u0.voting_5!=1))&&(u1.voting_6!=1))&&(u6.voting_7!=1))&&(u7.voting_8!=1))&&(u8.voting_9!=1))&&(u9.voting_10!=1))" | !F"((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))
[2020-05-22 03:43:43] [INFO ] Proved 31 variables to be positive in 158 ms
[2020-05-22 03:43:43] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2020-05-22 03:43:43] [INFO ] Computation of disable matrix completed :0/21 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:43:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:43:43] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2020-05-22 03:43:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.032694,16672,1,0,409,83,248,279,84,101,943
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))U(X(G(!(X((F("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))&&("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))))))))
Formula 1 simplified : !(X"((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" U XG!X("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" & F"((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
0 strongly connected components in search stack
22 transitions explored
12 items max in DFS search stack
0 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.041998,17824,1,0,1027,83,250,931,84,101,2136
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((!(G(X("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))))||(!(F((("(u2.ready==1)")U("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))||("(u2.ready==1)"))))))
Formula 2 simplified : !(!GX"((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" | !F("(u2.ready==1)" | ("(u2.ready==1)" U "((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))")))
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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.043958,17824,1,0,1079,83,254,993,84,101,2241
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(!(F(!((!(G(F("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))))U("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))")))))))
Formula 3 simplified : !X!F!(!GF"((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" U "((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))")
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 items max in DFS search stack
0 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.046777,18236,1,0,1079,83,254,994,84,101,2244
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-PT-0010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(F(G("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))))))
Formula 4 simplified : GFG"((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"
Computing Next relation with stutter on 1024 deadlock states
22 unique states visited
0 strongly connected components in search stack
23 transitions explored
12 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.050672,18236,1,0,1146,83,254,1075,84,106,2469
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(G((X("(u2.ready==1)"))&&(("((((((((((u2.voting_1!=1)&&(u3.voting_2!=1))&&(u4.voting_3!=1))&&(u5.voting_4!=1))&&(u0.voting_5!=1))&&(u1.voting_6!=1))&&(u6.voting_7!=1))&&(u7.voting_8!=1))&&(u8.voting_9!=1))&&(u9.voting_10!=1))")||((("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))")U("(u2.ready==1)"))&&("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))))))))
Formula 5 simplified : !GFG(X"(u2.ready==1)" & ("((((((((((u2.voting_1!=1)&&(u3.voting_2!=1))&&(u4.voting_3!=1))&&(u5.voting_4!=1))&&(u0.voting_5!=1))&&(u1.voting_6!=1))&&(u6.voting_7!=1))&&(u7.voting_8!=1))&&(u8.voting_9!=1))&&(u9.voting_10!=1))" | ("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" & ("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" U "(u2.ready==1)"))))
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
12 strongly connected components in search stack
14 transitions explored
13 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.059285,18536,1,0,1197,83,279,1224,86,113,3299
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-PT-0010-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F(("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))")U(F(X(F(("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))")U(G((G("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))U("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))"))))))))))))
Formula 6 simplified : !FXF("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" U FXF("((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" U G(G"((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))" U "((((((((((u2.voting_1==1)||(u3.voting_2==1))||(u4.voting_3==1))||(u5.voting_4==1))||(u0.voting_5==1))||(u1.voting_6==1))||(u6.voting_7==1))||(u7.voting_8==1))||(u8.voting_9==1))||(u9.voting_10==1))")))
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 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.06182,18536,1,0,1197,83,286,1224,86,113,3316
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(G((!(X(F(G("(u2.voting_1==1)")))))&&("(u7.voting_8==1)"))))&&(F("(u1.voting_6==1)"))))
Formula 7 simplified : !(XG("(u7.voting_8==1)" & !XFG"(u2.voting_1==1)") & F"(u1.voting_6==1)")
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 items max in DFS search stack
0 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.065421,18668,1,0,1376,83,301,1447,86,113,3866
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X("(u3.voting_2==1)"))))
Formula 8 simplified : !FX"(u3.voting_2==1)"
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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.066086,18668,1,0,1376,83,317,1447,86,113,3878
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G("(u2.ready==1)"))||((("(u2.ready==1)")U("(u7.voting_8==1)"))&&(G("(u2.ready!=1)")))))
Formula 9 simplified : !(G"(u2.ready==1)" | (("(u2.ready==1)" U "(u7.voting_8==1)") & G"(u2.ready!=1)"))
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 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.069293,18932,1,0,1376,83,376,1447,90,113,3947
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F(X("(((u9.voting_10==1)||(u2.ready==1))||(u2.ready==1))")))))
Formula 10 simplified : FX"(((u9.voting_10==1)||(u2.ready==1))||(u2.ready==1))"
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.070468,18932,1,0,1376,83,389,1447,90,113,3955
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-PT-0010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((!(G((("(u8.voting_9==1)")U("(u2.ready==1)"))||(X("(u2.ready==1)")))))&&(!(G("(u5.voting_4==1)")))))
Formula 11 simplified : !(!G(("(u8.voting_9==1)" U "(u2.ready==1)") | X"(u2.ready==1)") & !G"(u5.voting_4==1)")
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
0 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
0 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.075053,19064,1,0,1548,83,416,1684,90,113,4583
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(X("(u0.voting_5==1)"))))
Formula 12 simplified : !FX"(u0.voting_5==1)"
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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.076073,19064,1,0,1548,83,432,1684,90,113,4598
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 03:43:43] [INFO ] Built C files in 384ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590119024847

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r141-smll-158961511000394"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;