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.r132-tall-165271820500163.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 JoinFreeModules-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820500163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.3K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 31K 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 JoinFreeModules-PT-0010-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652747128766

Running Version 202205111006
[2022-05-17 00:25:29] [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-17 00:25:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:25:30] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2022-05-17 00:25:30] [INFO ] Transformed 51 places.
[2022-05-17 00:25:30] [INFO ] Transformed 81 transitions.
[2022-05-17 00:25:30] [INFO ] Parsed PT model containing 51 places and 81 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:30] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-17 00:25:30] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:30] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 00:25:30] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:30] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-17 00:25:30] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Support contains 32 out of 50 places after structural reductions.
[2022-05-17 00:25:30] [INFO ] Flatten gal took : 29 ms
[2022-05-17 00:25:30] [INFO ] Flatten gal took : 10 ms
[2022-05-17 00:25:30] [INFO ] Input system was already deterministic with 81 transitions.
Finished random walk after 255 steps, including 0 resets, run visited all 32 properties in 33 ms. (steps per millisecond=7 )
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((F(X(p0))&&F((X(p1)&&p2))&&G(p1))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:31] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:31] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-17 00:25:31] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:31] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=0 dest: 5}, { cond=(AND p2 p1 p0), acceptance={0} source=0 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(GT 3 s29), p1:(LEQ 2 s35), p0:(LEQ s26 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-00 finished in 675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||X(p1)))||X(p2)))'
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:32] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:32] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:32] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GT s26 s8), p2:(LEQ s3 s44), p0:(GT s37 s15)], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 573 steps with 220 reset in 13 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-01 finished in 535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&G(p0)))))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:32] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:32] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 10 ms
[2022-05-17 00:25:32] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s22 s13)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-03 finished in 275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((p0 U p1))&&p2))||G(X(!p2))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 00:25:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:32] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:32] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(LEQ s1 s42), p1:(LEQ 3 s21), p0:(LEQ s22 s40)], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-04 finished in 360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:33] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:33] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 00:25:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:33] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 2 s2)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-05 finished in 317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 12 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:33] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:33] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-17 00:25:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:33] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-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:(GT s0 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-06 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-17 00:25:33] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:33] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:33] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT s38 s14), p0:(GT 3 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-07 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p1)&&p0))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:34] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:34] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT 3 s49) (GT s3 s26)), p1:(GT 1 s35)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-08 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(F(X(p0))) U p1) U p2))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:34] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:34] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:34] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:34] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:34] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:34] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 3 s12), p1:(AND (LEQ s23 s46) (OR (LEQ 3 s12) (LEQ s21 s34))), p0:(GT s23 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 531 reset in 383 ms.
Stack based approach found an accepted trace after 483 steps with 2 reset with depth 151 and stack size 150 in 3 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-09 finished in 750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:35] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:35] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:35] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:35] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:35] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:35] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s1 s45)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-10 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&X(p2)))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:35] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:35] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:35] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-17 00:25:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:35] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:35] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s4 s22), p2:(LEQ s18 s9), p1:(GT 3 s47)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 197 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 p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-11 finished in 850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(((p0 U p1)||p2)))&&(G(p1) U p1)&&p0)))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:36] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:36] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:36] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s23), p1:(LEQ s28 s16), p2:(LEQ 2 s34)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-12 finished in 381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U F(p1))&&X((X(p1) U F(!F(p2))))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:36] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-17 00:25:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:36] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) p2), (NOT p1), p2]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s37 s35), p2:(LEQ s18 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-13 finished in 337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:36] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:36] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:36] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:36] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s33 s16)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-14 finished in 248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((X(G(p0))&&p1)))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:37] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:25:37] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:37] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 00:25:37] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-17 00:25:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2022-05-17 00:25:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 00:25:37] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s34 s45), p0:(LEQ s9 s40)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 375 ms.
Stack based approach found an accepted trace after 106 steps with 0 reset with depth 107 and stack size 107 in 0 ms.
FORMULA JoinFreeModules-PT-0010-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0010-LTLCardinality-15 finished in 759 ms.
All properties solved by simple procedures.
Total runtime 7886 ms.

BK_STOP 1652747137904

--------------------
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="JoinFreeModules-PT-0010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0010.tgz
mv JoinFreeModules-PT-0010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;