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-158961510900338.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-COL-0015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510900338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.6K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 08:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 09:49 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 3.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 21:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.7K 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-COL-0015-00
FORMULA_NAME Referendum-COL-0015-01
FORMULA_NAME Referendum-COL-0015-02
FORMULA_NAME Referendum-COL-0015-03
FORMULA_NAME Referendum-COL-0015-04
FORMULA_NAME Referendum-COL-0015-05
FORMULA_NAME Referendum-COL-0015-06
FORMULA_NAME Referendum-COL-0015-07
FORMULA_NAME Referendum-COL-0015-08
FORMULA_NAME Referendum-COL-0015-09
FORMULA_NAME Referendum-COL-0015-10
FORMULA_NAME Referendum-COL-0015-11
FORMULA_NAME Referendum-COL-0015-12
FORMULA_NAME Referendum-COL-0015-13
FORMULA_NAME Referendum-COL-0015-14
FORMULA_NAME Referendum-COL-0015-15

=== Now, execution of the tool begins

BK_START 1590100388721

[2020-05-21 22:33:15] [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-21 22:33:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 22:33:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-21 22:33:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 962 ms
[2020-05-21 22:33:16] [INFO ] sort/places :
Dot->ready,
Voters->voting,voted_yes,voted_no,

[2020-05-21 22:33:16] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 46 PT places and 31.0 transition bindings in 20 ms.
[2020-05-21 22:33:16] [INFO ] Computed order based on color domains.
[2020-05-21 22:33:16] [INFO ] Unfolded HLPN to a Petri net with 46 places and 31 transitions in 9 ms.
[2020-05-21 22:33:16] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2 steps, including 0 resets, run visited all 34 properties in 2 ms. (steps per millisecond=1 )
[2020-05-21 22:33:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-21 22:33:16] [INFO ] Flatten gal took : 67 ms
FORMULA Referendum-COL-0015-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 22:33:16] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 22:33:16] [INFO ] Applying decomposition
[2020-05-21 22:33:16] [INFO ] Flatten gal took : 16 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/graph12340099337413922336.txt, -o, /tmp/graph12340099337413922336.bin, -w, /tmp/graph12340099337413922336.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/graph12340099337413922336.bin, -l, -1, -v, -w, /tmp/graph12340099337413922336.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 22:33:17] [INFO ] Input system was already deterministic with 31 transitions.
[2020-05-21 22:33:17] [INFO ] Decomposing Gal with order
[2020-05-21 22:33:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 22:33:17] [INFO ] Flatten gal took : 84 ms
[2020-05-21 22:33:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-21 22:33:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-21 22:33:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 20 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
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]
// Phase 1: matrix 31 rows 46 cols
[2020-05-21 22:33:17] [INFO ] Computed 15 place invariants in 18 ms
inv : voting_6 + voted_yes_6 + voted_no_6 + ready_0 = 1
inv : voting_9 + voted_yes_9 + voted_no_9 + ready_0 = 1

inv : voting_8 + voted_yes_8 + voted_no_8 + ready_0 = 1
inv : voting_7 + voted_yes_7 + voted_no_7 + ready_0 = 1
inv : voting_4 + voted_yes_4 + voted_no_4 + ready_0 = 1
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 15 LTL properties
Checking formula 0 : !((G(X(!(F((X("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))||((!(G("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))&&("(u10.ready_0>=1)"))))))))
Formula 0 simplified : !GX!F(X"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))" | ("(u10.ready_0>=1)" & !G"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))
inv : voting_5 + voted_yes_5 + voted_no_5 + ready_0 = 1
inv : voting_3 + voted_yes_3 + voted_no_3 + ready_0 = 1
inv : voting_2 + voted_yes_2 + voted_no_2 + ready_0 = 1
inv : voting_0 + voted_yes_0 + voted_no_0 + ready_0 = 1
inv : voting_1 + voted_yes_1 + voted_no_1 + ready_0 = 1
inv : voting_13 + voted_yes_13 + voted_no_13 + ready_0 = 1
inv : voting_10 + voted_yes_10 + voted_no_10 + ready_0 = 1
inv : voting_11 + voted_yes_11 + voted_no_11 + ready_0 = 1
inv : voting_12 + voted_yes_12 + voted_no_12 + ready_0 = 1
inv : voting_14 + voted_yes_14 + voted_no_14 + ready_0 = 1
Total of 15 invariants.
[2020-05-21 22:33:17] [INFO ] Computed 15 place invariants in 38 ms
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 32768 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.047899,17192,1,0,668,95,310,557,86,110,1561
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-0015-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")U(F(X(!(G(!(G((((((((((((((((G(!(F("(u10.ready_0>=1)"))))||("(u0.voting_0>=1)"))||("(u10.voting_1>=1)"))||("(u11.voting_2>=1)"))||("(u12.voting_3>=1)"))||("(u1.voting_4>=1)"))||("(u2.voting_5>=1)"))||("(u3.voting_6>=1)"))||("(u4.voting_7>=1)"))||("(u13.voting_8>=1)"))||("(u5.voting_9>=1)"))||("(u6.voting_10>=1)"))||("(u7.voting_11>=1)"))||("(u14.voting_12>=1)"))||("(u8.voting_13>=1)"))||("(u9.voting_14>=1)")))))))))))
Formula 1 simplified : !X("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))" U FX!G!G("(u0.voting_0>=1)" | "(u1.voting_4>=1)" | "(u2.voting_5>=1)" | "(u3.voting_6>=1)" | "(u4.voting_7>=1)" | "(u5.voting_9>=1)" | "(u6.voting_10>=1)" | "(u7.voting_11>=1)" | "(u8.voting_13>=1)" | "(u9.voting_14>=1)" | "(u10.voting_1>=1)" | "(u11.voting_2>=1)" | "(u12.voting_3>=1)" | "(u13.voting_8>=1)" | "(u14.voting_12>=1)" | G!F"(u10.ready_0>=1)"))
[2020-05-21 22:33:17] [INFO ] Proved 46 variables to be positive in 332 ms
[2020-05-21 22:33:17] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2020-05-21 22:33:17] [INFO ] Computation of disable matrix completed :0/31 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:33:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:33:17] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2020-05-21 22:33:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:33:19] [INFO ] Computing symmetric co enabling matrix : 31 transitions.
[2020-05-21 22:33:20] [INFO ] Computation of Finished co-enabling matrix. took 635 ms. Total solver calls (SAT/UNSAT): 45(15/30)
[2020-05-21 22:33:20] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2020-05-21 22:33:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:33:24] [INFO ] Built C files in 7035ms 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]
Compilation finished in 1448 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 45 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(((LTLAP0==true))U(<>(X(!( [](!( [](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( [](!( <>((LTLAP1==true))) )) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) ) || ( (LTLAP10==true)) ) || ( (LTLAP11==true)) ) || ( (LTLAP12==true)) ) || ( (LTLAP13==true)) ) || ( (LTLAP14==true)) ) || ( (LTLAP15==true)) ) || ( (LTLAP16==true)) )) )) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(((LTLAP0==true))U(<>(X(!( [](!( [](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( [](!( <>((LTLAP1==true))) )) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) ) || ( (LTLAP10==true)) ) || ( (LTLAP11==true)) ) || ( (LTLAP12==true)) ) || ( (LTLAP13==true)) ) || ( (LTLAP14==true)) ) || ( (LTLAP15==true)) ) || ( (LTLAP16==true)) )) )) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(((LTLAP0==true))U(<>(X(!( [](!( [](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( [](!( <>((LTLAP1==true))) )) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) ) || ( (LTLAP10==true)) ) || ( (LTLAP11==true)) ) || ( (LTLAP12==true)) ) || ( (LTLAP13==true)) ) || ( (LTLAP14==true)) ) || ( (LTLAP15==true)) ) || ( (LTLAP16==true)) )) )) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Computing Next relation with stutter on 32768 deadlock states
18 unique states visited
0 strongly connected components in search stack
34 transitions explored
18 items max in DFS search stack
4 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,19.5678,58468,1,0,4875,95,470,2595,92,110,6838
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(((X(G("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))||(F("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))U(X("(u10.ready_0>=1)"))))))
Formula 2 simplified : X((XG"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))" | F"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))") U X"(u10.ready_0>=1)")
Computing Next relation with stutter on 32768 deadlock states
19 unique states visited
0 strongly connected components in search stack
33 transitions explored
19 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,19.5958,58468,1,0,5895,95,481,3961,92,110,9250
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(X(F("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))))U((!(G("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))&&("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))))
Formula 3 simplified : !(!XF"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))" U ("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))" & !G"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))
Computing Next relation with stutter on 32768 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,19.6001,58468,1,0,5895,95,481,3961,92,110,9281
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-0015-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G(F(!(F((("(u10.ready_0>=1)")U("(u10.ready_0>=1)"))&&(G("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))))))))
Formula 4 simplified : !XGF!F("(u10.ready_0>=1)" & G"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")
Computing Next relation with stutter on 32768 deadlock states
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
17 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,19.6064,58468,1,0,6017,95,484,4103,92,115,9679
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F("(u10.ready_0>=1)"))))
Formula 5 simplified : !GF"(u10.ready_0>=1)"
Computing Next relation with stutter on 32768 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 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,19.6075,58468,1,0,6017,95,488,4103,92,115,9700
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-COL-0015-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X((G(((G("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))&&("(u10.ready_0>=1)"))U("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))&&(F(("(u10.ready_0>=1)")U("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))))))
Formula 6 simplified : !FX(G(("(u10.ready_0>=1)" & G"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))") U "(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))") & F("(u10.ready_0>=1)" U "(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))
Computing Next relation with stutter on 32768 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 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,19.6145,58468,1,0,6114,95,497,4314,92,117,9953
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-COL-0015-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(G((("(u10.ready_0>=1)")U("(u10.ready_0>=1)"))&&(X("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))))))
Formula 7 simplified : !XFG("(u10.ready_0>=1)" & X"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")
Computing Next relation with stutter on 32768 deadlock states
16 unique states visited
16 strongly connected components in search stack
16 transitions explored
16 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,19.6172,58468,1,0,6114,95,504,4316,92,117,9989
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-0015-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))U(!(F((X(F("(u10.ready_0>=1)")))||(("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")U(X(X("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))))))))
Formula 8 simplified : !(G"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))" U !F(XF"(u10.ready_0>=1)" | ("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))" U XX"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))
Computing Next relation with stutter on 32768 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,19.6716,58468,1,0,6114,95,504,4316,92,117,9989
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-0015-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))))
Formula 9 simplified : !GF"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"
Computing Next relation with stutter on 32768 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 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,19.6741,58468,1,0,6114,95,510,4316,92,117,9993
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-COL-0015-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!(X((X("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))&&("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))))&&(F("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))))
Formula 10 simplified : !(!X("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))" & X"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))") & F"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")
Computing Next relation with stutter on 32768 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,19.6915,58468,1,0,6114,95,510,4316,92,117,9995
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-0015-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!((((((((((((((((((((((((((((((((X("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))||("(u0.voting_0>=1)"))||("(u10.voting_1>=1)"))||("(u11.voting_2>=1)"))||("(u12.voting_3>=1)"))||("(u1.voting_4>=1)"))||("(u2.voting_5>=1)"))||("(u3.voting_6>=1)"))||("(u4.voting_7>=1)"))||("(u13.voting_8>=1)"))||("(u5.voting_9>=1)"))||("(u6.voting_10>=1)"))||("(u7.voting_11>=1)"))||("(u14.voting_12>=1)"))||("(u8.voting_13>=1)"))||("(u9.voting_14>=1)"))||("(u0.voting_0>=1)"))||("(u10.voting_1>=1)"))||("(u11.voting_2>=1)"))||("(u12.voting_3>=1)"))||("(u1.voting_4>=1)"))||("(u2.voting_5>=1)"))||("(u3.voting_6>=1)"))||("(u4.voting_7>=1)"))||("(u13.voting_8>=1)"))||("(u5.voting_9>=1)"))||("(u6.voting_10>=1)"))||("(u7.voting_11>=1)"))||("(u14.voting_12>=1)"))||("(u8.voting_13>=1)"))||("(u9.voting_14>=1)"))U("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"))))
Formula 11 simplified : ("(u0.voting_0>=1)" | "(u1.voting_4>=1)" | "(u2.voting_5>=1)" | "(u3.voting_6>=1)" | "(u4.voting_7>=1)" | "(u5.voting_9>=1)" | "(u6.voting_10>=1)" | "(u7.voting_11>=1)" | "(u8.voting_13>=1)" | "(u9.voting_14>=1)" | "(u10.voting_1>=1)" | "(u11.voting_2>=1)" | "(u12.voting_3>=1)" | "(u13.voting_8>=1)" | "(u14.voting_12>=1)" | X"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))") U "(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"
Computing Next relation with stutter on 32768 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,21.9787,58468,1,0,6114,95,524,4316,92,117,10009
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-COL-0015-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(X(F("(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))")))))
Formula 12 simplified : !FXF"(((((((((((((((u0.voting_0>=1)||(u10.voting_1>=1))||(u11.voting_2>=1))||(u12.voting_3>=1))||(u1.voting_4>=1))||(u2.voting_5>=1))||(u3.voting_6>=1))||(u4.voting_7>=1))||(u13.voting_8>=1))||(u5.voting_9>=1))||(u6.voting_10>=1))||(u7.voting_11>=1))||(u14.voting_12>=1))||(u8.voting_13>=1))||(u9.voting_14>=1))"
Computing Next relation with stutter on 32768 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,21.9807,58468,1,0,6114,95,524,4316,92,117,10010
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G((X("(u10.ready_0>=1)"))||("(u10.ready_0>=1)")))))
Formula 13 simplified : !FG("(u10.ready_0>=1)" | X"(u10.ready_0>=1)")
Computing Next relation with stutter on 32768 deadlock states
18 unique states visited
17 strongly connected components in search stack
19 transitions explored
18 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,21.9837,58468,1,0,6127,95,524,4434,92,117,10239
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-COL-0015-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((F((((((((((((((((!(G(X("(u10.ready_0>=1)"))))&&("(u0.voting_0<1)"))&&("(u10.voting_1<1)"))&&("(u11.voting_2<1)"))&&("(u12.voting_3<1)"))&&("(u1.voting_4<1)"))&&("(u2.voting_5<1)"))&&("(u3.voting_6<1)"))&&("(u4.voting_7<1)"))&&("(u13.voting_8<1)"))&&("(u5.voting_9<1)"))&&("(u6.voting_10<1)"))&&("(u7.voting_11<1)"))&&("(u14.voting_12<1)"))&&("(u8.voting_13<1)"))&&("(u9.voting_14<1)")))&&(X("(u10.ready_0<1)"))))
Formula 14 simplified : !(F("(u0.voting_0<1)" & "(u1.voting_4<1)" & "(u2.voting_5<1)" & "(u3.voting_6<1)" & "(u4.voting_7<1)" & "(u5.voting_9<1)" & "(u6.voting_10<1)" & "(u7.voting_11<1)" & "(u8.voting_13<1)" & "(u9.voting_14<1)" & "(u10.voting_1<1)" & "(u11.voting_2<1)" & "(u12.voting_3<1)" & "(u13.voting_8<1)" & "(u14.voting_12<1)" & !GX"(u10.ready_0>=1)") & X"(u10.ready_0<1)")
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,36.8988,51900,1,0,6127,95,526,4434,92,117,10242
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590100442443

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

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