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-158961511000393.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961511000393
=====================================================================

--------------------
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 1590119009648

[2020-05-22 03:43:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 03:43:32] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-05-22 03:43:32] [INFO ] Transformed 31 places.
[2020-05-22 03:43:32] [INFO ] Transformed 21 transitions.
[2020-05-22 03:43:32] [INFO ] Found NUPN structural information;
[2020-05-22 03:43:32] [INFO ] Parsed PT model containing 31 places and 21 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 453 ms. (steps per millisecond=220 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 21 rows 31 cols
[2020-05-22 03:43:33] [INFO ] Computed 10 place invariants in 6 ms
[2020-05-22 03:43:33] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned unsat
[2020-05-22 03:43:33] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned unsat
[2020-05-22 03:43:33] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2020-05-22 03:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 03:43:33] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-22 03:43:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 03:43:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned unsat
[2020-05-22 03:43:33] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2020-05-22 03:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 03:43:33] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-05-22 03:43:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 03:43:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned unsat
[2020-05-22 03:43:33] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2020-05-22 03:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 03:43:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-22 03:43:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 03:43:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-22 03:43:34] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-22 03:43:34] [INFO ] Flatten gal took : 45 ms
FORMULA Referendum-PT-0010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 03:43:34] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 03:43:34] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 03:43:34] [INFO ] Flatten gal took : 14 ms
[2020-05-22 03:43:34] [INFO ] Input system was already deterministic with 21 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 21 rows 31 cols
[2020-05-22 03:43:34] [INFO ] Computed 10 place invariants in 3 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:34] [INFO ] Computed 10 place invariants in 6 ms
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/graph1850039420887483774.txt, -o, /tmp/graph1850039420887483774.bin, -w, /tmp/graph1850039420887483774.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1850039420887483774.bin, -l, -1, -v, -w, /tmp/graph1850039420887483774.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 03:43:34] [INFO ] Proved 31 variables to be positive in 102 ms
[2020-05-22 03:43:34] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2020-05-22 03:43:34] [INFO ] Computation of disable matrix completed :0/21 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:43:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:43:34] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2020-05-22 03:43:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:43:34] [INFO ] Decomposing Gal with order
[2020-05-22 03:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 03:43:34] [INFO ] Removed a total of 10 redundant transitions.
[2020-05-22 03:43:34] [INFO ] Flatten gal took : 77 ms
[2020-05-22 03:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-22 03:43:34] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-22 03:43:34] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !(((!(X("((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)<=(((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10))")))||((!((X(F("(((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)<=(((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10))&&((((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10)<=gi1.gu1.ready))")))U("((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=1)")))&&(!(F("((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=1)"))))))
Formula 0 simplified : !(!X"((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)<=(((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10))" | (!(XF"(((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)<=(((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10))&&((((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10)<=gi1.gu1.ready))" U "((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=1)") & !F"((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
2 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.043506,17296,1,0,8,792,23,3,498,399,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((("((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=2)")U("((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)<2)"))U(F("((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=2)")))))
Formula 1 simplified : !X(("((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=2)" U "((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)<2)") U F"((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=2)")
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
3 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.077902,17864,1,0,56,4459,32,45,546,7014,126
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G("((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=1)"))))
Formula 2 simplified : !FG"((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=1)"
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 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.133579,18968,1,0,132,8068,41,139,636,16850,362
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)<=(((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10))")U("((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)>=2)")))
Formula 3 simplified : !("((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)<=(((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10))" U "((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)>=2)")
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.138668,19196,1,0,132,8068,51,139,699,16851,371
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(X(("(((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>gi1.gu1.ready)||((((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10)<=gi1.gu1.ready))")U(X("((((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)<=(((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10))&&((((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10)<=gi1.gu1.ready))&&((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=2))")))))U("((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)>=1)")))
Formula 4 simplified : !(FX("(((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>gi1.gu1.ready)||((((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10)<=gi1.gu1.ready))" U X"((((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)<=(((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10))&&((((((((((gi1.gu1.voted_yes_1+gi1.gu1.voted_yes_2)+gi1.gu1.voted_yes_3)+gi1.gu1.voted_yes_4)+gi1.gu1.voted_yes_5)+gi1.gu1.voted_yes_6)+gi1.gu1.voted_yes_7)+gi1.gu1.voted_yes_8)+gi1.gu1.voted_yes_9)+gi1.gu1.voted_yes_10)<=gi1.gu1.ready))&&((((((((((gu0.voted_no_1+gu0.voted_no_2)+gu0.voted_no_3)+gu0.voted_no_4)+gu0.voted_no_5)+gu0.voted_no_6)+gu0.voted_no_7)+gu0.voted_no_8)+gu0.voted_no_9)+gu0.voted_no_10)>=2))") U "((((((((((gi1.gu2.voting_1+gi1.gu2.voting_2)+gi1.gu2.voting_3)+gi1.gu2.voting_4)+gi1.gu2.voting_5)+gi1.gu2.voting_6)+gi1.gu2.voting_7)+gi1.gu2.voting_8)+gi1.gu2.voting_9)+gi1.gu2.voting_10)>=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
10 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.236475,20228,1,0,157,10622,64,177,1309,21998,481
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(!(X(G(F("(gi1.gu2.voting_9==1)"))))))))
Formula 5 simplified : !GF!XGF"(gi1.gu2.voting_9==1)"
Computing Next relation with stutter on 1024 deadlock states
23 unique states visited
0 strongly connected components in search stack
24 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.249603,20688,1,0,176,10943,81,251,1350,23522,700
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(("(gi1.gu1.voted_yes_5==1)")U("(gi1.gu1.voted_yes_10==1)"))))
Formula 6 simplified : !X("(gi1.gu1.voted_yes_5==1)" U "(gi1.gu1.voted_yes_10==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.25123,20688,1,0,176,10943,93,251,1358,23524,709
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((X("(gi1.gu1.voted_yes_4==1)"))U(X(X(!(F("(gi1.gu1.voted_yes_4==1)"))))))))
Formula 7 simplified : !G(X"(gi1.gu1.voted_yes_4==1)" U XX!F"(gi1.gu1.voted_yes_4==1)")
Computing Next relation with stutter on 1024 deadlock states
15 unique states visited
14 strongly connected components in search stack
16 transitions explored
14 items max in DFS search stack
2 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.280372,21176,1,0,205,12962,99,297,1360,27044,878
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F((("((gi1.gu1.voted_yes_6==0)||(gi1.gu1.ready==1))")U(X("((gi1.gu1.voted_yes_6==0)||(gi1.gu1.ready==1))")))U(F(X(F("((gi1.gu2.voting_5==0)||(gi1.gu1.ready==1))"))))))))
Formula 8 simplified : !GF(("((gi1.gu1.voted_yes_6==0)||(gi1.gu1.ready==1))" U X"((gi1.gu1.voted_yes_6==0)||(gi1.gu1.ready==1))") U FXF"((gi1.gu2.voting_5==0)||(gi1.gu1.ready==1))")
Computing Next relation with stutter on 1024 deadlock states
23 unique states visited
0 strongly connected components in search stack
24 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.290917,21400,1,0,215,13327,108,307,1366,27679,952
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X(G(X(!((X("(((gi1.gu1.voted_yes_7==0)||(gi1.gu1.ready==1))&&((gu0.voted_no_5==0)||(gi1.gu2.voting_3==1)))"))U("((gu0.voted_no_5==0)||(gi1.gu2.voting_3==1))"))))))))
Formula 9 simplified : !GXGX!(X"(((gi1.gu1.voted_yes_7==0)||(gi1.gu1.ready==1))&&((gu0.voted_no_5==0)||(gi1.gu2.voting_3==1)))" U "((gu0.voted_no_5==0)||(gi1.gu2.voting_3==1))")
Computing Next relation with stutter on 1024 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.293763,21544,1,0,215,13340,114,307,1372,27689,960
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F("((gi1.gu1.ready==0)||(gu0.voted_no_10==1))"))))
Formula 10 simplified : !GF"((gi1.gu1.ready==0)||(gu0.voted_no_10==1))"
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
0 strongly connected components in search stack
13 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.295324,21544,1,0,215,13340,123,307,1378,27690,988
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 03:43:35] [WARNING] Script execution failed on command (assert (and (>= (select s0 25) 1) (= (store (store s0 5 (+ (select s0 5) 1)) 25 (- (select s0 25) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 25) 1) (= (store (store s0 5 (+ (select s0 5) 1)) 25 (- (select s0 25) 1)) s1))")
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:35] [INFO ] Built C files in 875ms 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 1590119016351

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 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 r141-smll-158961511000393"
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 ;