Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r276-smll-165307352900067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-COL-Z2T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307352900067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 8.4K Apr 29 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 UtilityControlRoom-COL-Z2T4N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653118588546

Running Version 202205111006
[2022-05-21 07:36:31] [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]
[2022-05-21 07:36:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:36:31] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 07:36:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 07:36:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1142 ms
[2022-05-21 07:36:32] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 140 PT places and 216.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 07:36:32] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 11 ms.
[2022-05-21 07:36:32] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 13 cols
[2022-05-21 07:36:33] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-21 07:36:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 07:36:33] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-21 07:36:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-21 07:36:33] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 07:36:34] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-21 07:36:34] [INFO ] Flatten gal took : 19 ms
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 07:36:34] [INFO ] Flatten gal took : 4 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 07:36:34] [INFO ] Unfolded HLPN to a Petri net with 140 places and 216 transitions 680 arcs in 18 ms.
[2022-05-21 07:36:34] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 57 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 20 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2022-05-21 07:36:34] [INFO ] Computed 19 place invariants in 8 ms
[2022-05-21 07:36:34] [INFO ] Implicit Places using invariants in 171 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/140 places, 168/184 transitions.
Support contains 57 out of 123 places after structural reductions.
[2022-05-21 07:36:34] [INFO ] Flatten gal took : 51 ms
[2022-05-21 07:36:34] [INFO ] Flatten gal took : 46 ms
[2022-05-21 07:36:34] [INFO ] Input system was already deterministic with 168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:36:34] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-21 07:36:34] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2022-05-21 07:36:34] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 123 transition count 152
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 107 transition count 152
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 112 place count 67 transition count 112
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 128 place count 67 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 66 transition count 80
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 65 transition count 80
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 139 place count 57 transition count 64
Iterating global reduction 1 with 8 rules applied. Total rules applied 147 place count 57 transition count 64
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 155 place count 49 transition count 56
Iterating global reduction 1 with 8 rules applied. Total rules applied 163 place count 49 transition count 56
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 171 place count 49 transition count 48
Applied a total of 171 rules in 48 ms. Remains 49 /123 variables (removed 74) and now considering 48/168 (removed 120) transitions.
// Phase 1: matrix 48 rows 49 cols
[2022-05-21 07:36:35] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 07:36:35] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 48 rows 49 cols
[2022-05-21 07:36:35] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 07:36:35] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2022-05-21 07:36:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 49 cols
[2022-05-21 07:36:35] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 07:36:35] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/123 places, 48/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/123 places, 48/168 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s25 s26 s27 s28 s29 s30 s31 s32))], 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][true]]
Product exploration explored 100000 steps with 15881 reset in 574 ms.
Stack based approach found an accepted trace after 2191 steps with 340 reset with depth 9 and stack size 9 in 17 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-01 finished in 1157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((F(p0)&&X(p1)))&&p2)))'
Support contains 33 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:36:36] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 07:36:36] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:36:36] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 07:36:36] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:36:36] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:36:36] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GT (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25) s82), p0:(LEQ 2 (ADD s91 s92 s93 s94 s95 s96 s97 s98)), p1:(GT 2 (ADD s83 s84...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4953 reset in 522 ms.
Product exploration explored 100000 steps with 4936 reset in 434 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 465 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 52 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F p2), (F p0), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 10 factoid took 734 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:36:39] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:36:39] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned unsat
Proved EG (NOT p2)
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:36:39] [INFO ] Computed 18 place invariants in 2 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F p2), (F p0), (F (AND p2 (NOT p0))), (G (NOT p2)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 10 factoid took 426 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-03 finished in 4311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 17 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 83 transition count 128
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 96 place count 83 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 82 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 82 transition count 96
Applied a total of 98 rules in 31 ms. Remains 82 /123 variables (removed 41) and now considering 96/168 (removed 72) transitions.
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:40] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:36:40] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:40] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:36:40] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2022-05-21 07:36:40] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:40] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 07:36:40] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/123 places, 96/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/123 places, 96/168 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-05 automaton TGBA Formula[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:(LEQ (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56) s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2219 reset in 347 ms.
Product exploration explored 100000 steps with 2143 reset in 587 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 17 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 96/96 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:42] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:36:42] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:42] [INFO ] Computed 18 place invariants in 7 ms
[2022-05-21 07:36:43] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-05-21 07:36:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:43] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:36:43] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2182 reset in 359 ms.
Product exploration explored 100000 steps with 2238 reset in 397 ms.
Built C files in :
/tmp/ltsmin1685445580173925710
[2022-05-21 07:36:44] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2022-05-21 07:36:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:36:44] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2022-05-21 07:36:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:36:44] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2022-05-21 07:36:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:36:44] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1685445580173925710
Running compilation step : cd /tmp/ltsmin1685445580173925710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 604 ms.
Running link step : cd /tmp/ltsmin1685445580173925710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin1685445580173925710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5487036463100382904.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 17 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:59] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-21 07:36:59] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:59] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:36:59] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-05-21 07:36:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 82 cols
[2022-05-21 07:36:59] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:00] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin6807210527230074975
[2022-05-21 07:37:00] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2022-05-21 07:37:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:37:00] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2022-05-21 07:37:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:37:00] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2022-05-21 07:37:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:37:00] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6807210527230074975
Running compilation step : cd /tmp/ltsmin6807210527230074975;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 339 ms.
Running link step : cd /tmp/ltsmin6807210527230074975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6807210527230074975;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16069328385999311709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:37:15] [INFO ] Flatten gal took : 11 ms
[2022-05-21 07:37:15] [INFO ] Flatten gal took : 10 ms
[2022-05-21 07:37:15] [INFO ] Time to serialize gal into /tmp/LTL7980177390404256964.gal : 3 ms
[2022-05-21 07:37:15] [INFO ] Time to serialize properties into /tmp/LTL3594565268397833713.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7980177390404256964.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3594565268397833713.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7980177...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((StartSecuring_0+StartSecuring_1)+(StartSecuring_2+StartSecuring_3))+((StartSecuring_4+StartSecuring_5)+(StartSecuring_6+S...336
Formula 0 simplified : !GF"(((((StartSecuring_0+StartSecuring_1)+(StartSecuring_2+StartSecuring_3))+((StartSecuring_4+StartSecuring_5)+(StartSecuring_6+Sta...330
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
64 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.686928,35524,1,0,35,100732,24,1,2254,73264,89
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-05 finished in 35499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 123 transition count 152
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 107 transition count 152
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 80 place count 83 transition count 128
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 96 place count 83 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 82 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 74 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 74 transition count 88
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 122 place count 66 transition count 72
Iterating global reduction 1 with 8 rules applied. Total rules applied 130 place count 66 transition count 72
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 138 place count 58 transition count 64
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 58 transition count 64
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 154 place count 58 transition count 56
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 170 place count 50 transition count 48
Applied a total of 170 rules in 44 ms. Remains 50 /123 variables (removed 73) and now considering 48/168 (removed 120) transitions.
// Phase 1: matrix 48 rows 50 cols
[2022-05-21 07:37:16] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-21 07:37:16] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 48 rows 50 cols
[2022-05-21 07:37:16] [INFO ] Computed 18 place invariants in 8 ms
[2022-05-21 07:37:16] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-05-21 07:37:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 50 cols
[2022-05-21 07:37:16] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:16] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/123 places, 48/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/123 places, 48/168 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s18 s19 s20 s21 s22 s23 s24 s25))], 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 0 reset in 312 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-06 finished in 673 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(F(F(p0)))))'
Support contains 16 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 123 transition count 152
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 107 transition count 152
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 80 place count 83 transition count 128
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 96 place count 83 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 82 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 74 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 74 transition count 88
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 122 place count 66 transition count 72
Iterating global reduction 1 with 8 rules applied. Total rules applied 130 place count 66 transition count 72
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 138 place count 58 transition count 64
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 58 transition count 64
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 154 place count 58 transition count 56
Applied a total of 154 rules in 35 ms. Remains 58 /123 variables (removed 65) and now considering 56/168 (removed 112) transitions.
// Phase 1: matrix 56 rows 58 cols
[2022-05-21 07:37:16] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:16] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 56 rows 58 cols
[2022-05-21 07:37:16] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-21 07:37:16] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2022-05-21 07:37:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 56 rows 58 cols
[2022-05-21 07:37:16] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:17] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/123 places, 56/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/123 places, 56/168 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s26 s27 s28 s29 s30 s31 s32 s33) (ADD s34 s35 s36 s37 s38 s39 s40 s41))], 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][true]]
Product exploration explored 100000 steps with 4001 reset in 342 ms.
Stack based approach found an accepted trace after 26932 steps with 1077 reset with depth 41 and stack size 41 in 103 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-07 finished in 883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(((F(p0) U p0)&&!p0) U !X(F(p1))))'
Support contains 16 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:17] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 07:37:17] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:17] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:17] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:17] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:18] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 (ADD s74 s75 s76 s77 s78 s79 s80 s81)), p1:(LEQ 2 (ADD s91 s92 s93 s94 s95 s96 s97 s98))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2015 reset in 362 ms.
Product exploration explored 100000 steps with 2033 reset in 419 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 336 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:20] [INFO ] Computed 18 place invariants in 2 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-08 finished in 3056 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:20] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:20] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:20] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:21] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:21] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:21] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 2 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-10 finished in 730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Support contains 17 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 123 transition count 152
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 107 transition count 152
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 96 place count 75 transition count 120
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 112 place count 75 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 74 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 74 transition count 88
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 122 place count 66 transition count 72
Iterating global reduction 1 with 8 rules applied. Total rules applied 130 place count 66 transition count 72
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 138 place count 58 transition count 64
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 58 transition count 64
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 154 place count 58 transition count 56
Applied a total of 154 rules in 16 ms. Remains 58 /123 variables (removed 65) and now considering 56/168 (removed 112) transitions.
// Phase 1: matrix 56 rows 58 cols
[2022-05-21 07:37:21] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:21] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 56 rows 58 cols
[2022-05-21 07:37:21] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-21 07:37:21] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-21 07:37:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 56 rows 58 cols
[2022-05-21 07:37:21] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-21 07:37:21] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/123 places, 56/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/123 places, 56/168 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s33 (ADD s42 s43 s44 s45 s46 s47 s48 s49)), p0:(LEQ 1 (ADD s25 s26 s27 s28 s29 s30 s31 s32))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 34237 reset in 330 ms.
Product exploration explored 100000 steps with 34170 reset in 381 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 493 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 42 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 453 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 56 rows 58 cols
[2022-05-21 07:37:23] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-21 07:37:23] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-13 finished in 2796 ms.
All properties solved by simple procedures.
Total runtime 53147 ms.

BK_STOP 1653118644344

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="UtilityControlRoom-COL-Z2T4N08"
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 UtilityControlRoom-COL-Z2T4N08, 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 r276-smll-165307352900067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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