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.r024-tall-165251918800652.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 CSRepetitions-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800652
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 115K Apr 30 06:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 425K Apr 30 06:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 234K Apr 30 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 987K Apr 30 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 67K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 72K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 232K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 42K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 424K May 10 09:33 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 CSRepetitions-PT-07-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652674416654

Running Version 202205111006
[2022-05-16 04:13:37] [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-16 04:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 04:13:38] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2022-05-16 04:13:38] [INFO ] Transformed 498 places.
[2022-05-16 04:13:38] [INFO ] Transformed 833 transitions.
[2022-05-16 04:13:38] [INFO ] Parsed PT model containing 498 places and 833 transitions in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CSRepetitions-PT-07-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 498 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 17 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:38] [INFO ] Computed 56 place invariants in 39 ms
[2022-05-16 04:13:38] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:38] [INFO ] Computed 56 place invariants in 13 ms
[2022-05-16 04:13:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:38] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:38] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-16 04:13:39] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Support contains 498 out of 498 places after structural reductions.
[2022-05-16 04:13:39] [INFO ] Flatten gal took : 111 ms
[2022-05-16 04:13:39] [INFO ] Flatten gal took : 92 ms
[2022-05-16 04:13:39] [INFO ] Input system was already deterministic with 833 transitions.
Finished random walk after 1373 steps, including 13 resets, run visited all 15 properties in 60 ms. (steps per millisecond=22 )
FORMULA CSRepetitions-PT-07-LTLFireability-04 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' '!(X((G(p0)||p1)))'
Support contains 56 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 42 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:40] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-16 04:13:40] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:40] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-16 04:13:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:41] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:41] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-16 04:13:41] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (OR (AND (GEQ s255 1) (GEQ s360 1)) (AND (GEQ s121 1) (GEQ s327 1)) (AND (GEQ s233 1) (GEQ s255 1)) (AND (GEQ s201 1) (GEQ s481 1)) (AND (GEQ s33 ...], 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 847 ms.
Product exploration explored 100000 steps with 50000 reset in 721 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 p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-PT-07-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-07-LTLFireability-00 finished in 3098 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(G(p0))&&X(F(G((X(p2)&&p1))))))))'
Support contains 155 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 53 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:43] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-16 04:13:43] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:43] [INFO ] Computed 56 place invariants in 14 ms
[2022-05-16 04:13:43] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:44] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2022-05-16 04:13:44] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:44] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-16 04:13:44] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s255 1) (GEQ s360 1)) (AND (GEQ s121 1) (GEQ s327 1)) (AND (GEQ s233 1) (GEQ s255 1)) (AND (GEQ s201 1) (GEQ s481 1)) (AND (GEQ s33 1) (G...], 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 127 steps with 0 reset in 17 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-01 finished in 1266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1 U G(p2))))'
Support contains 490 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 30 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:44] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-16 04:13:44] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:44] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-16 04:13:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:45] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2022-05-16 04:13:45] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:45] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-16 04:13:45] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s267 1) (GEQ s447 1)) (AND (GEQ s220 1) (GEQ s276 1)) (AND (GEQ s24 1) (GEQ s276 1)) (AND (GEQ s411 1) (GEQ s417 1)) (AND (GEQ s172 1) (G...], 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 135 steps with 0 reset in 7 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-05 finished in 996 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 441 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 27 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:45] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-16 04:13:45] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:45] [INFO ] Computed 56 place invariants in 13 ms
[2022-05-16 04:13:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:46] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2022-05-16 04:13:46] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:46] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-16 04:13:46] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s267 1) (GEQ s447 1)) (AND (GEQ s220 1) (GEQ s276 1)) (AND (GEQ s24 1) (GEQ s276 1)) (AND (GEQ s411 1) (GEQ s417 1)) (AND (GEQ s172 1) (G...], 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 150 steps with 2 reset in 6 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-06 finished in 908 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 400 transition count 784
Discarding 336 places :
Symmetric choice reduction at 0 with 336 rule applications. Total rules 483 place count 64 transition count 448
Iterating global reduction 0 with 336 rules applied. Total rules applied 819 place count 64 transition count 448
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 840 place count 50 transition count 441
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Iterating post reduction 0 with 294 rules applied. Total rules applied 1134 place count 50 transition count 147
Applied a total of 1134 rules in 48 ms. Remains 50 /498 variables (removed 448) and now considering 147/833 (removed 686) transitions.
// Phase 1: matrix 147 rows 50 cols
[2022-05-16 04:13:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 04:13:46] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 147 rows 50 cols
[2022-05-16 04:13:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 04:13:46] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-16 04:13:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 147 rows 50 cols
[2022-05-16 04:13:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 04:13:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/498 places, 147/833 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/498 places, 147/833 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-07 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:(OR (GEQ s17 1) (GEQ s34 1) (GEQ s8 1) (GEQ s18 1) (GEQ s35 1) (GEQ s10 1) (GEQ s37 1) (GEQ s28 1) (GEQ s11 1) (GEQ s12 1) (GEQ s19 1) (GEQ s2 1) (GEQ ...], 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 28 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-07 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U (p0 U F(p0)))||G(X(p1)))))'
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 12 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:46] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-16 04:13:47] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:47] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-16 04:13:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:47] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:47] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-16 04:13:48] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-10 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: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s80 1) (GEQ s211 1)), p0:(GEQ s110 1)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-10 finished in 1398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 12 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:48] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-16 04:13:48] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:48] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-16 04:13:48] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:49] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:49] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-16 04:13:49] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s139 1)], 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]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-11 finished in 1288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(X(((X(p1) U p2)&&p0))))&&(X(p3)||p1))))'
Support contains 5 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 22 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:49] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-16 04:13:49] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:49] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-16 04:13:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:50] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:50] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-16 04:13:50] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s432 1), p0:(AND (GEQ s47 1) (GEQ s80 1)), p2:(GEQ s82 1), p3:(AND (GEQ s80 1) (GEQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-12 finished in 1424 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U X(p1))))'
Support contains 5 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 18 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:50] [INFO ] Computed 56 place invariants in 10 ms
[2022-05-16 04:13:51] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:51] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-16 04:13:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 04:13:51] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
// Phase 1: matrix 833 rows 498 cols
[2022-05-16 04:13:51] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-16 04:13:52] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 101 ms :[p1, p1, p1, true]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s255 1) (GEQ s336 1)), p1:(OR (LT s82 1) (AND (GEQ s29 1) (GEQ s142 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-14 finished in 1300 ms.
All properties solved by simple procedures.
Total runtime 14485 ms.

BK_STOP 1652674432318

--------------------
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="CSRepetitions-PT-07"
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 CSRepetitions-PT-07, 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 r024-tall-165251918800652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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