Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415800452.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-COL-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415800452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.5K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-COL-0010-00
FORMULA_NAME Referendum-COL-0010-01
FORMULA_NAME Referendum-COL-0010-02
FORMULA_NAME Referendum-COL-0010-03
FORMULA_NAME Referendum-COL-0010-04
FORMULA_NAME Referendum-COL-0010-05
FORMULA_NAME Referendum-COL-0010-06
FORMULA_NAME Referendum-COL-0010-07
FORMULA_NAME Referendum-COL-0010-08
FORMULA_NAME Referendum-COL-0010-09
FORMULA_NAME Referendum-COL-0010-10
FORMULA_NAME Referendum-COL-0010-11
FORMULA_NAME Referendum-COL-0010-12
FORMULA_NAME Referendum-COL-0010-13
FORMULA_NAME Referendum-COL-0010-14
FORMULA_NAME Referendum-COL-0010-15

=== Now, execution of the tool begins

BK_START 1621258677287

Running Version 0
[2021-05-17 13:37:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 13:37:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:37:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 13:37:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 13:37:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 469 ms
[2021-05-17 13:37:59] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 31 PT places and 21.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA Referendum-COL-0010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:37:59] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 7 ms.
[2021-05-17 13:37:59] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_11748842941061597563.dot
[2021-05-17 13:37:59] [INFO ] Initial state test concluded for 3 properties.
FORMULA Referendum-COL-0010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100008 steps, including 7692 resets, run finished after 78 ms. (steps per millisecond=1282 ) properties (out of 23) seen :20
Running SMT prover for 3 properties.
// Phase 1: matrix 3 rows 4 cols
[2021-05-17 13:37:59] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-17 13:37:59] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
[2021-05-17 13:37:59] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 13:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:37:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 13:37:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:37:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-17 13:37:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Referendum-COL-0010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:37:59] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 13:37:59] [INFO ] Flatten gal took : 16 ms
FORMULA Referendum-COL-0010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:37:59] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:37:59] [INFO ] Unfolded HLPN to a Petri net with 31 places and 21 transitions in 0 ms.
[2021-05-17 13:37:59] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7978565769524449374.dot
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:00] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 13:38:00] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:38:00] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:38:00] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
[2021-05-17 13:38:00] [INFO ] Flatten gal took : 4 ms
[2021-05-17 13:38:00] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:38:00] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 449 ms. (steps per millisecond=222 ) properties (out of 17) seen :16
Running SMT prover for 1 properties.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:00] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-17 13:38:00] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-17 13:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:38:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 13:38:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:38:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 21
Applied a total of 10 rules in 1 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:00] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:00] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:00] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:00] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0010-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-02 finished in 261 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||G((F(p2)&&F(p3))))))))], workingDir=/home/mcc/execution]
Support contains 21 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:00] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 13:38:00] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:38:01] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-17 13:38:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:01] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:38:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : Referendum-COL-0010-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (GT 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))), p1:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p2:(LEQ s0 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p3:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1924 steps with 400 reset in 32 ms.
FORMULA Referendum-COL-0010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-04 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (p0&&X(X(p1)))))], workingDir=/home/mcc/execution]
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 13:38:01] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:01] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-17 13:38:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 13:38:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-COL-0010-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=true, acceptance={0} source=2 dest: 5}, { cond=p0, acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p1:(OR (LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Product exploration explored 100000 steps with 33333 reset in 220 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (G p1)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 204 ms.
Product exploration explored 100000 steps with 33333 reset in 336 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 31 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2021-05-17 13:38:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:03] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 13:38:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Product exploration explored 100000 steps with 33333 reset in 308 ms.
Product exploration explored 100000 steps with 33333 reset in 235 ms.
[2021-05-17 13:38:04] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:38:04] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:38:04] [INFO ] Time to serialize gal into /tmp/LTL9813238568461863078.gal : 1 ms
[2021-05-17 13:38:04] [INFO ] Time to serialize properties into /tmp/LTL17029956913107779585.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9813238568461863078.gal, -t, CGAL, -LTL, /tmp/LTL17029956913107779585.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9813238568461863078.gal -t CGAL -LTL /tmp/LTL17029956913107779585.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))")))U(("((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))")&&(X(X("(((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)>=1)||(ready_0<=(((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)))"))))))
Formula 0 simplified : !(XG"((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))" U ("((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))" & XX"(((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)>=1)||(ready_0<=(((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.041878,18436,1,0,9,889,26,4,564,384,23
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Referendum-COL-0010-05 finished in 2880 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 30 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 13:38:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Referendum-COL-0010-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p0:(GT 3 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-06 finished in 191 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0 U p1))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 21 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 21 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:04] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:04] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-17 13:38:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:04] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : Referendum-COL-0010-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p0:(OR (LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) s0) (GT s0 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))), p2:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA Referendum-COL-0010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-10 finished in 253 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /31 variables (removed 1) and now considering 20/21 (removed 1) transitions.
// Phase 1: matrix 20 rows 30 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 20 rows 30 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2021-05-17 13:38:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 30 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:38:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/31 places, 20/21 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0010-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 3 reset in 1 ms.
FORMULA Referendum-COL-0010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-11 finished in 151 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((F(!p1)&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2021-05-17 13:38:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:38:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Referendum-COL-0010-12 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 1}, { cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p2:(GT 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p0:(GT (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) s0), p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-12 finished in 267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 11 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 21 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 21 transition count 21
Applied a total of 2 rules in 4 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:04] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:04] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:04] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:38:05] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-17 13:38:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:05] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2557 steps with 221 reset in 12 ms.
FORMULA Referendum-COL-0010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-14 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))&&(p1 U (p2||G(p1)))&&F((p1 U (p3||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 21 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 21 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:05] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:05] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:05] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 13:38:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:05] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:05] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Referendum-COL-0010-15 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(OR p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GT s0 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)) (GT 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))), p1:(GT 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p0:(LEQ s0 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p3:(AND (LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (GT 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 14245 reset in 253 ms.
Product exploration explored 100000 steps with 14358 reset in 260 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p2))), (F (G p1)), (F (G p0)), (F (G p3)), p2, p1, (NOT p0), p3]
Adopting property with smaller alphabet thanks to knowledge :(F (G p1))
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), false, p1]
Support contains 11 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 11 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 11 transition count 11
Applied a total of 11 rules in 1 ms. Remains 11 /21 variables (removed 10) and now considering 11/21 (removed 10) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:06] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:06] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-17 13:38:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:06] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/21 places, 11/21 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), false, p1]
Product exploration explored 100000 steps with 14160 reset in 239 ms.
Product exploration explored 100000 steps with 14191 reset in 169 ms.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:07] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2021-05-17 13:38:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:38:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621258688788

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-COL-0010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Referendum-COL-0010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415800452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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