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-165271820500180.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-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820500180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 8.0K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.4K 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 17K 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 152K 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-0050-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652748984647

Running Version 202205111006
[2022-05-17 00:56:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 00:56:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:56:26] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2022-05-17 00:56:26] [INFO ] Transformed 251 places.
[2022-05-17 00:56:26] [INFO ] Transformed 401 transitions.
[2022-05-17 00:56:26] [INFO ] Parsed PT model containing 251 places and 401 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0050-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 30 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:26] [INFO ] Computed 50 place invariants in 16 ms
[2022-05-17 00:56:26] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:26] [INFO ] Computed 50 place invariants in 11 ms
[2022-05-17 00:56:26] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:26] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 00:56:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:26] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:26] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-17 00:56:26] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Support contains 69 out of 250 places after structural reductions.
[2022-05-17 00:56:27] [INFO ] Flatten gal took : 54 ms
[2022-05-17 00:56:27] [INFO ] Flatten gal took : 23 ms
[2022-05-17 00:56:27] [INFO ] Input system was already deterministic with 401 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 25) seen :24
Finished Best-First random walk after 508 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=84 )
FORMULA JoinFreeModules-PT-0050-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(X((G(p0) U X(p0)))))))))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 33 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:27] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:27] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:27] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:28] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:28] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 00:56:28] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:28] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2022-05-17 00:56:28] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:28] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 00:56:28] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-00 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:(GEQ s38 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-00 finished in 1011 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 19 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:28] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:28] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:28] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:28] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:28] [INFO ] Computed 50 place invariants in 8 ms
[2022-05-17 00:56:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-05-17 00:56:29] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:29] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:29] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-01 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:(GEQ s0 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-01 finished in 639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(G(X((G((p0 U G(p1)))||p2))))))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:29] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:29] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:29] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:29] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:29] [INFO ] Computed 50 place invariants in 6 ms
[2022-05-17 00:56:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:29] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2022-05-17 00:56:29] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:29] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:29] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 p1) (AND p1 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s143 3), p1:(GEQ s224 5), p0:(GEQ s3 3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-02 finished in 735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((X(X(p0))&&p0)))&&G((F(p0)&&p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:30] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:30] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:30] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:30] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:30] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:30] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-05-17 00:56:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:30] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:30] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s26 2), p0:(GEQ s79 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-04 finished in 617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:31] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:31] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:31] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:31] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:31] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:31] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:31] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:32] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s176 2), p1:(GEQ s212 2)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-05 finished in 1488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(p0))&&p1))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:32] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:32] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:32] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:32] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:32] [INFO ] Computed 50 place invariants in 11 ms
[2022-05-17 00:56:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:32] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-05-17 00:56:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:32] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:32] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 48 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s25 5), p0:(LT s111 2)], 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-0050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-06 finished in 611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))&&X(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:32] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:32] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:32] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:33] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:33] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:33] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:33] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:33] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-08 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=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(GEQ s201 2), p1:(GEQ s216 2)], 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, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-08 finished in 796 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(G((F(X(p1))||X(X(X(G(p0)))))))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:33] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:33] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:33] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:33] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:33] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:33] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-05-17 00:56:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:33] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:34] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s14 5), p1:(GEQ s235 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-10 finished in 624 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U G((X((p1 U p2)) U (F(p1)&&p3))))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:34] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 00:56:34] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:34] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 00:56:34] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:34] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:34] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:34] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:34] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:34] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p3) (NOT p1)), (NOT p2), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p1 (NOT p3)) (AND (NOT p1) p2)), (NOT p1), true, (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 5}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=6 dest: 1}, { cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND (NOT p3) (NOT p0) p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p0 p2), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p3) p1 p0) (AND (NOT p3) p0 p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(GEQ s112 2), p3:(GEQ s21 2), p1:(GEQ s2 2), p2:(LT s90 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-12 finished in 1024 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&p1))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:35] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:35] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:35] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:35] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:35] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:35] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:35] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:35] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-17 00:56:35] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LT s77 2), p0:(GEQ s90 3)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-13 finished in 584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(p0)))))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:35] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:36] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:36] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:36] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:36] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 00:56:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:36] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:36] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:36] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-14 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:(GEQ s55 5)], 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-0050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-14 finished in 644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U F(X((F(p0)||p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:36] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 00:56:36] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:36] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:36] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:36] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-17 00:56:36] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2022-05-17 00:56:36] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 00:56:37] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s214 5), p1:(LT s115 3)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 801 ms.
Product exploration explored 100000 steps with 50000 reset in 739 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0050-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0050-LTLFireability-15 finished in 2352 ms.
All properties solved by simple procedures.
Total runtime 13025 ms.

BK_STOP 1652748998902

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-0050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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