fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271820500156
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for JoinFreeModules-PT-0005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
293.447 8157.00 16183.00 70.70 FFFTTFTTFTFFFTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 30 02:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 02:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 02:17 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 15K 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 16K 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-0005-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652746617648

Running Version 202205111006
[2022-05-17 00:16:58] [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:16:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:16:59] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2022-05-17 00:16:59] [INFO ] Transformed 26 places.
[2022-05-17 00:16:59] [INFO ] Transformed 41 transitions.
[2022-05-17 00:16:59] [INFO ] Parsed PT model containing 26 places and 41 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0005-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:16:59] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-17 00:16:59] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:16:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 00:16:59] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:16:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:16:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:16:59] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:16:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 00:16:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Support contains 16 out of 25 places after structural reductions.
[2022-05-17 00:16:59] [INFO ] Flatten gal took : 18 ms
[2022-05-17 00:16:59] [INFO ] Flatten gal took : 9 ms
[2022-05-17 00:16:59] [INFO ] Input system was already deterministic with 41 transitions.
Finished random walk after 1158 steps, including 1 resets, run visited all 23 properties in 41 ms. (steps per millisecond=28 )
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' '!(G(X(X((X(p0)&&p1)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-17 00:17:00] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:00] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-17 00:17:00] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(GEQ s23 4), p0:(GEQ s0 3)], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-00 finished in 528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 00:17:00] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:00] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:00] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-01 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 s18 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-01 finished in 259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!(!X(p0) U G(p1)) U !(X(p2) U p3)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:00] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:00] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 619 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), true, (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), p0, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p1 p3), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(NOT p3), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) p0 p2), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 10}, { cond=(NOT p2), acceptance={} source=7 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) p0 p2), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p3) p0 p2), acceptance={} source=8 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0) p2), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p0) p2), acceptance={} source=9 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=9 dest: 13}], [{ cond=p0, acceptance={} source=10 dest: 5}], [{ cond=(NOT p1), acceptance={} source=11 dest: 10}, { cond=p1, acceptance={} source=11 dest: 11}, { cond=(NOT p1), acceptance={0} source=11 dest: 11}, { cond=p1, acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p1) p0), acceptance={} source=12 dest: 5}, { cond=(AND p1 p0), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=13 dest: 13}]], initial=0, aps=[p3:(GEQ s0 5), p1:(GEQ s21 2), p2:(LT s12 2), p0:(GEQ s23 4)], 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-0005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-02 finished in 777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&(F(p1)||p2))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:01] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 00:17:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LT s18 4), p1:(LT s15 3), p0:(LT s8 3)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 210 ms.
Product exploration explored 100000 steps with 50000 reset in 191 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 p2 p1 p0), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0005-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0005-LTLFireability-04 finished in 878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(G(p0)))&&F(p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:02] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:02] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-17 00:17:02] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:02] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-17 00:17:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-05 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=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s3 3), p0:(GEQ s23 4)], 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-0005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-05 finished in 286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X((G(p1)&&F(p2)))||X(p3)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:02] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:02] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), true]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LT s12 1), p2:(GEQ s23 3), p3:(LT s3 4), p0:(LT s0 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 p0), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) p1 p2))), (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 8 factoid took 184 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0005-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0005-LTLFireability-06 finished in 983 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!((G(p0) U p0)&&p1)) U p2))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:03] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:03] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:03] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-17 00:17:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:03] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), true, (AND p0 p1)]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s17 2), p2:(GEQ s19 5), p1:(GEQ s13 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-08 finished in 220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((!(p0 U G(p1))&&p2)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:03] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LT s9 5), p1:(GEQ s5 3), p0:(GEQ s22 1)], 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 1076 steps with 48 reset in 17 ms.
FORMULA JoinFreeModules-PT-0005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-10 finished in 373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G(X(G(F(p0)))))&&p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-17 00:17:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s7 2), p0:(LT s23 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-0005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-11 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G((G(X(G(p0)))&&G(X(p0))))))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-17 00:17:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s15 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 52 reset in 157 ms.
Stack based approach found an accepted trace after 2629 steps with 2 reset with depth 222 and stack size 210 in 6 ms.
FORMULA JoinFreeModules-PT-0005-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-12 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p1))||p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:04] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:04] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s12 1) (GEQ s3 3)), p1:(GEQ s12 1)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 157 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 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0005-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0005-LTLFireability-14 finished in 609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:05] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-17 00:17:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:05] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:05] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:05] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-17 00:17:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 00:17:05] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-17 00:17:05] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:17:05] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s14 5), p1:(GEQ s8 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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-0005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0005-LTLFireability-15 finished in 272 ms.
All properties solved by simple procedures.
Total runtime 6913 ms.

BK_STOP 1652746625805

--------------------
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
++ 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 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-0005"
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-0005, 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-165271820500156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0005.tgz
mv JoinFreeModules-PT-0005 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 ;