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.r114-smll-165264477100043.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 GlobalResAllocation-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477100043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 9.6K Apr 30 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 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 GlobalResAllocation-COL-10-LTLCardinality-00
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-01
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-02
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-03
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-04
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-05
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-06
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-07
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-08
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-09
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-10
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-11
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-12
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-13
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-14
FORMULA_NAME GlobalResAllocation-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652685915669

Running Version 202205111006
[2022-05-16 07:25:18] [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-16 07:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:25:18] [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-16 07:25:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 07:25:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1405 ms
[2022-05-16 07:25:19] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 250 PT places and 1688410.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA GlobalResAllocation-COL-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 07:25:20] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 11 ms.
[2022-05-16 07:25:20] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10006 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=115 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
Normalized transition count is 6 out of 7 initially.
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 07:25:20] [INFO ] Computed 3 place invariants in 9 ms
[2022-05-16 07:25:20] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 07:25:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:25:20] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:25:20] [INFO ] After 51ms SMT Verify possible using all constraints in natural 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 11 simplifications.
[2022-05-16 07:25:20] [INFO ] Flatten gal took : 28 ms
[2022-05-16 07:25:20] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 20
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2022-05-16 07:25:20] [INFO ] Unfolded HLPN to a Petri net with 41 places and 70 transitions 290 arcs in 19 ms.
[2022-05-16 07:25:20] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 70/70 transitions.
Reduce isomorphic (modulo) transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 60
Applied a total of 20 rules in 11 ms. Remains 41 /41 variables (removed 0) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:20] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-16 07:25:20] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:20] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 07:25:20] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:20] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-16 07:25:21] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:21] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:21] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/41 places, 60/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/70 transitions.
Support contains 41 out of 41 places after structural reductions.
[2022-05-16 07:25:21] [INFO ] Flatten gal took : 24 ms
[2022-05-16 07:25:21] [INFO ] Flatten gal took : 22 ms
[2022-05-16 07:25:21] [INFO ] Input system was already deterministic with 60 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:21] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-16 07:25:21] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 07:25:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-16 07:25:22] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-16 07:25:22] [INFO ] After 46ms SMT Verify possible using all constraints in natural 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 11 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' '!(X(p0))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 3 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:22] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:22] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:22] [INFO ] Computed 11 place invariants in 13 ms
[2022-05-16 07:25:22] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:22] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:22] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:22] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-16 07:25:22] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-00 automaton TGBA Formula[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:(LEQ s10 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 2 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-00 finished in 642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(G(G(p1)))||F(p2)))&&p0)))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:22] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:25:23] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:23] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-16 07:25:23] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:23] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:23] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:23] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-16 07:25:23] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) s10) (LEQ s10 (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40))), p2:(LEQ (ADD s21 s22 s23 s24 s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2398 reset in 827 ms.
Stack based approach found an accepted trace after 239 steps with 6 reset with depth 30 and stack size 30 in 2 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-01 finished in 1724 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 2 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:24] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:24] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:24] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:24] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:24] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:24] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:24] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:24] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-03 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:(AND (LEQ 2 s10) (LEQ s10 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 GlobalResAllocation-COL-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-03 finished in 459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||F(G(p1))))))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 7 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:25] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:25] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:25] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:25] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:25] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:25] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-16 07:25:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:25] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:25] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) s10), p0:(LEQ 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2310 reset in 545 ms.
Stack based approach found an accepted trace after 37057 steps with 846 reset with depth 14 and stack size 14 in 314 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-04 finished in 1275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:26] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-16 07:25:26] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:26] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:26] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:26] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:26] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:26] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-16 07:25:26] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) s10), p1:(GT 3 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 429 ms.
Stack based approach found an accepted trace after 770 steps with 2 reset with depth 759 and stack size 759 in 4 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-05 finished in 918 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 4 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:27] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:27] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:27] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:27] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:27] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-16 07:25:27] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2022-05-16 07:25:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:27] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:27] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-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 3 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 296 ms.
Stack based approach found an accepted trace after 3964 steps with 0 reset with depth 3965 and stack size 3951 in 21 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-06 finished in 649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X((p1&&X(p2))))))))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 3 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:28] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:28] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:28] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:28] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p1:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) s10), p2:(GT 3 (ADD s11 s12 s13 s14 s15 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 595 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-07 finished in 1390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((X(p1)&&X(p2))||p0))))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 1 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:29] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:29] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:29] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 1 s10), p2:(LEQ 2 s10), p0:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)) (LEQ 2 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 508 ms.
Product exploration explored 100000 steps with 0 reset in 674 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 p1 p2 p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 318 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:31] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:31] [INFO ] After 36ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (OR (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 p2)))]
Knowledge based reduction with 7 factoid took 494 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 21 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:32] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 07:25:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:32] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:32] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:33] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:33] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:33] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 60/60 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 : [(AND p1 p2 p0), (X p0), (X (X p0)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :2
Finished Best-First random walk after 175 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (X p0)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 5 factoid took 437 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 190 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 516 ms.
Product exploration explored 100000 steps with 0 reset in 507 ms.
Built C files in :
/tmp/ltsmin655376925165799883
[2022-05-16 07:25:35] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin655376925165799883
Running compilation step : cd /tmp/ltsmin655376925165799883;'/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 480 ms.
Running link step : cd /tmp/ltsmin655376925165799883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin655376925165799883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3063765673717802276.hoa' '--buchi-type=spotba'
LTSmin run took 6652 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-09 finished in 13601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 2 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:43] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:43] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 07:25:43] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:43] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:43] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:43] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 07:25:43] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9)), p0:(LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 2 reset in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-10 finished in 530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(F(X(X(p1)))||G(p0)))))'
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 2 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:43] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:43] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:43] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:43] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:43] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(LEQ 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-11 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 4 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:43] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:44] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:44] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:44] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:44] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:44] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-16 07:25:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:44] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:44] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLCardinality-15 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:(GT (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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 35 reset in 431 ms.
Product exploration explored 100000 steps with 29 reset in 455 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:45] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-16 07:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:25:45] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-16 07:25:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:25:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-16 07:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:25:45] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-16 07:25:45] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 07:25:46] [INFO ] Added : 10 causal constraints over 2 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:46] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:46] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-16 07:25:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:46] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 60/60 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:46] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-16 07:25:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:25:46] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 07:25:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:25:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-16 07:25:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:25:47] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-16 07:25:47] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 07:25:47] [INFO ] Added : 10 causal constraints over 2 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 48 reset in 439 ms.
Product exploration explored 100000 steps with 6 reset in 427 ms.
Built C files in :
/tmp/ltsmin15724810456232019817
[2022-05-16 07:25:48] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2022-05-16 07:25:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:25:48] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2022-05-16 07:25:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:25:48] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2022-05-16 07:25:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:25:48] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15724810456232019817
Running compilation step : cd /tmp/ltsmin15724810456232019817;'/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 204 ms.
Running link step : cd /tmp/ltsmin15724810456232019817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15724810456232019817;'/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/stateBased17753895840227235120.hoa' '--buchi-type=spotba'
LTSmin run took 220 ms.
FORMULA GlobalResAllocation-COL-10-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-10-LTLCardinality-15 finished in 4581 ms.
All properties solved by simple procedures.
Total runtime 30483 ms.

BK_STOP 1652685948738

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="GlobalResAllocation-COL-10"
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 GlobalResAllocation-COL-10, 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 r114-smll-165264477100043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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