About the Execution of ITS-Tools for Referendum-COL-0010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 452.768 | 13392.00 | 27005.00 | 289.20 | FFTTFFFTFTFFFTTT | normal |
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-162089415800453.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415800453
=====================================================================
--------------------
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 1621258703801
Running Version 0
[2021-05-17 13:38:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:38:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:38:26] [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:38:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 13:38:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 616 ms
[2021-05-17 13:38:27] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 31 PT places and 21.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 13:38:27] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 3 ms.
[2021-05-17 13:38:27] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13745618689904673235.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-17 13:38:27] [INFO ] Flatten gal took : 31 ms
[2021-05-17 13:38:27] [INFO ] Flatten gal took : 0 ms
[2021-05-17 13:38:27] [INFO ] Unfolded HLPN to a Petri net with 31 places and 21 transitions in 1 ms.
[2021-05-17 13:38:27] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_4281503621663591101.dot
[2021-05-17 13:38:27] [INFO ] Initial state test concluded for 5 properties.
FORMULA Referendum-COL-0010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Applied a total of 30 rules in 5 ms. Remains 11 /31 variables (removed 20) and now considering 11/21 (removed 10) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:28] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 13:38:28] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:28] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:28] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/31 places, 11/21 transitions.
[2021-05-17 13:38:28] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 13:38:28] [INFO ] Flatten gal took : 18 ms
FORMULA Referendum-COL-0010-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:38:28] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:38:28] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:28] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:38:28] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-17 13:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:38:28] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-17 13:38:28] [INFO ] Initial state test concluded for 2 properties.
FORMULA Referendum-COL-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2 transition count 2
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2 transition count 2
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 1 transition count 1
Applied a total of 20 rules in 22 ms. Remains 1 /11 variables (removed 10) and now considering 1/11 (removed 10) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:38:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:28] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:38:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:28] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-17 13:38:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:38:28] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:28] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/11 places, 1/11 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p0)]
Running random walk in product with property : Referendum-COL-0010-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Referendum-COL-0010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-01 finished in 401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2 transition count 2
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2 transition count 2
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 1 transition count 1
Applied a total of 20 rules in 4 ms. Remains 1 /11 variables (removed 10) and now considering 1/11 (removed 10) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:29] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:29] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 13:38:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:29] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/11 places, 1/11 transitions.
Stuttering acceptance computed with spot in 46 ms :[p0]
Running random walk in product with property : Referendum-COL-0010-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 p0))), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Referendum-COL-0010-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-COL-0010-03 finished in 586 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:29] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:29] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 13:38:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 13:38:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0010-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-04 finished in 152 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:29] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:38:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0010-06 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:(OR (GEQ s0 1) (AND (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s10 1)))], 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-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-06 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(F(!p0))||G(!p1)) U (p1&&(X(F(!p0))||G(!p1))))))], workingDir=/home/mcc/execution]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:30] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:30] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:30] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:30] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:30] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:30] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : Referendum-COL-0010-07 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s0 1), p1:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 309 ms.
Product exploration explored 100000 steps with 33333 reset in 197 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p0))), (F (G (NOT p1))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Support contains 11 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-17 13:38:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:31] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Product exploration explored 100000 steps with 33333 reset in 200 ms.
Product exploration explored 100000 steps with 33333 reset in 185 ms.
[2021-05-17 13:38:32] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:38:32] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:38:32] [INFO ] Time to serialize gal into /tmp/LTL8268916461957430961.gal : 1 ms
[2021-05-17 13:38:32] [INFO ] Time to serialize properties into /tmp/LTL3902429038127077495.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/LTL8268916461957430961.gal, -t, CGAL, -LTL, /tmp/LTL3902429038127077495.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/LTL8268916461957430961.gal -t CGAL -LTL /tmp/LTL3902429038127077495.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((X(F("(ready_0<1)")))||(G("((((((((((voting_0<1)&&(voting_1<1))&&(voting_2<1))&&(voting_3<1))&&(voting_4<1))&&(voting_5<1))&&(voting_6<1))&&(voting_7<1))&&(voting_8<1))&&(voting_9<1))")))U(("((((((((((voting_0>=1)||(voting_1>=1))||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))")&&((X(F("(ready_0<1)")))||(G("((((((((((voting_0<1)&&(voting_1<1))&&(voting_2<1))&&(voting_3<1))&&(voting_4<1))&&(voting_5<1))&&(voting_6<1))&&(voting_7<1))&&(voting_8<1))&&(voting_9<1))")))))))
Formula 0 simplified : !X((XF"(ready_0<1)" | G"((((((((((voting_0<1)&&(voting_1<1))&&(voting_2<1))&&(voting_3<1))&&(voting_4<1))&&(voting_5<1))&&(voting_6<1))&&(voting_7<1))&&(voting_8<1))&&(voting_9<1))") U ("((((((((((voting_0>=1)||(voting_1>=1))||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))" & (XF"(ready_0<1)" | G"((((((((((voting_0<1)&&(voting_1<1))&&(voting_2<1))&&(voting_3<1))&&(voting_4<1))&&(voting_5<1))&&(voting_6<1))&&(voting_7<1))&&(voting_8<1))&&(voting_9<1))")))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/10/11
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.070814,17188,1,0,43,555,53,17,295,442,43
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0010-07 finished in 2108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:32] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:32] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2021-05-17 13:38:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:32] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:32] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-COL-0010-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p1))), (F (G (NOT p0))), (NOT p1), p0]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
[2021-05-17 13:38:33] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:38:33] [INFO ] Flatten gal took : 15 ms
[2021-05-17 13:38:33] [INFO ] Time to serialize gal into /tmp/LTL2884771662847684398.gal : 1 ms
[2021-05-17 13:38:33] [INFO ] Time to serialize properties into /tmp/LTL8769645648020199395.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/LTL2884771662847684398.gal, -t, CGAL, -LTL, /tmp/LTL8769645648020199395.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/LTL2884771662847684398.gal -t CGAL -LTL /tmp/LTL8769645648020199395.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(ready_0>=1)"))||(F("((((((((((voting_0>=1)||(voting_1>=1))||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))"))))
Formula 0 simplified : !(G"(ready_0>=1)" | F"((((((((((voting_0>=1)||(voting_1>=1))||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/10/11
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.015614,16540,1,0,43,538,47,18,297,427,42
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0010-09 finished in 1223 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(p0)&&(G(p0)||X(X(p1))))) U !p1))], workingDir=/home/mcc/execution]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:33] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 368 ms :[p1, (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Referendum-COL-0010-10 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s0 1), p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-10 finished in 454 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:33] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:33] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:33] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND p0 (NOT p1)), (NOT p1), true]
Running random walk in product with property : Referendum-COL-0010-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 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 175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:34] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:34] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:34] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:34] [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.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:34] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:38:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Referendum-COL-0010-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p0))), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Support contains 10 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-17 13:38:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
[2021-05-17 13:38:35] [INFO ] Flatten gal took : 1 ms
[2021-05-17 13:38:35] [INFO ] Flatten gal took : 1 ms
[2021-05-17 13:38:35] [INFO ] Time to serialize gal into /tmp/LTL6425707433904304828.gal : 1 ms
[2021-05-17 13:38:35] [INFO ] Time to serialize properties into /tmp/LTL8803104009252791747.ltl : 0 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/LTL6425707433904304828.gal, -t, CGAL, -LTL, /tmp/LTL8803104009252791747.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/LTL6425707433904304828.gal -t CGAL -LTL /tmp/LTL8803104009252791747.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("((((((((((voting_0>=1)||(voting_1>=1))||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))")))
Formula 0 simplified : !X"((((((((((voting_0>=1)||(voting_1>=1))||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/10/11
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.023321,16340,1,0,42,537,40,16,284,423,32
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0010-13 finished in 1496 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:35] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:35] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-17 13:38:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 13:38:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:38:35] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, p0]
Running random walk in product with property : Referendum-COL-0010-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8333 reset in 100 ms.
Product exploration explored 100000 steps with 8333 reset in 92 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p0))), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, p0]
Product exploration explored 100000 steps with 8333 reset in 81 ms.
Product exploration explored 100000 steps with 8333 reset in 93 ms.
[2021-05-17 13:38:36] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:38:36] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:38:36] [INFO ] Time to serialize gal into /tmp/LTL13164680877288136225.gal : 1 ms
[2021-05-17 13:38:36] [INFO ] Time to serialize properties into /tmp/LTL11756950242855939726.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/LTL13164680877288136225.gal, -t, CGAL, -LTL, /tmp/LTL11756950242855939726.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/LTL13164680877288136225.gal -t CGAL -LTL /tmp/LTL11756950242855939726.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((F("((((((((((voting_0<1)&&(voting_1<1))&&(voting_2<1))&&(voting_3<1))&&(voting_4<1))&&(voting_5<1))&&(voting_6<1))&&(voting_7<1))&&(voting_8<1))&&(voting_9<1))"))&&("((((((((((voting_0>=1)||(voting_1>=1))||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))"))))
Formula 0 simplified : !F("((((((((((voting_0>=1)||(voting_1>=1))||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))" & F"((((((((((voting_0<1)&&(voting_1<1))&&(voting_2<1))&&(voting_3<1))&&(voting_4<1))&&(voting_5<1))&&(voting_6<1))&&(voting_7<1))&&(voting_8<1))&&(voting_9<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/10/11
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.015532,16568,1,0,75,1027,52,44,294,1525,134
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0010-15 finished in 849 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621258717193
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 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 r178-tajo-162089415800453"
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 [ "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 '
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 ;