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.r294-smll-165463872300012.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 CANInsertWithFailure-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872300012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.1K May 30 15:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 15:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 30 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 30 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 30 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 30 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 30 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 698K May 29 12:20 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 CANInsertWithFailure-PT-010-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654643432651

Running Version 202205111006
[2022-06-07 23:10:35] [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-06-07 23:10:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-07 23:10:35] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2022-06-07 23:10:35] [INFO ] Transformed 324 places.
[2022-06-07 23:10:35] [INFO ] Transformed 660 transitions.
[2022-06-07 23:10:35] [INFO ] Parsed PT model containing 324 places and 660 transitions in 593 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 129 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:36] [INFO ] Computed 12 place invariants in 67 ms
[2022-06-07 23:10:37] [INFO ] Implicit Places using invariants in 640 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:37] [INFO ] Computed 12 place invariants in 15 ms
[2022-06-07 23:10:37] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:10:38] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1686 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:38] [INFO ] Computed 12 place invariants in 14 ms
[2022-06-07 23:10:38] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/324 places, 660/660 transitions.
Support contains 40 out of 323 places after structural reductions.
[2022-06-07 23:10:39] [INFO ] Flatten gal took : 144 ms
[2022-06-07 23:10:39] [INFO ] Flatten gal took : 76 ms
[2022-06-07 23:10:39] [INFO ] Input system was already deterministic with 660 transitions.
Support contains 35 out of 323 places (down from 40) after GAL structural reductions.
Finished random walk after 6604 steps, including 30 resets, run visited all 26 properties in 466 ms. (steps per millisecond=14 )
Computed a total of 42 stabilizing places and 70 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((X(G(p0))||p1))) U G((G(p2)||p2))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 28 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:40] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-07 23:10:40] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:40] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-07 23:10:41] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:10:41] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:41] [INFO ] Computed 12 place invariants in 11 ms
[2022-06-07 23:10:42] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 456 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s188 1), p1:(AND (GEQ s63 1) (GEQ s96 1)), p0:(GEQ s254 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-00 finished in 2435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((G((F(p0)||(X(p0)&&p1))) U p2)))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 14 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:42] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-07 23:10:43] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:43] [INFO ] Computed 12 place invariants in 11 ms
[2022-06-07 23:10:43] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:10:44] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:44] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-07 23:10:44] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p2:(OR (GEQ s240 1) (AND (GEQ s35 1) (GEQ s255 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 189 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-01 finished in 2203 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((G(p0) U F(p0))&&p1) U X(p0)))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:44] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-07 23:10:45] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:45] [INFO ] Computed 12 place invariants in 24 ms
[2022-06-07 23:10:45] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:10:46] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:46] [INFO ] Computed 12 place invariants in 11 ms
[2022-06-07 23:10:46] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 4}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=2, aps=[p1:(GEQ s280 1), p0:(AND (GEQ s83 1) (GEQ s84 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, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-02 finished in 1962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 316 place count 165 transition count 502
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 2 with 70 rules applied. Total rules applied 386 place count 165 transition count 432
Applied a total of 386 rules in 152 ms. Remains 165 /323 variables (removed 158) and now considering 432/660 (removed 228) transitions.
// Phase 1: matrix 432 rows 165 cols
[2022-06-07 23:10:47] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-07 23:10:47] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 432 rows 165 cols
[2022-06-07 23:10:47] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-07 23:10:47] [INFO ] State equation strengthened by 286 read => feed constraints.
[2022-06-07 23:10:48] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2022-06-07 23:10:48] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 432 rows 165 cols
[2022-06-07 23:10:48] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-07 23:10:48] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/323 places, 432/660 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/323 places, 432/660 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-04 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 s70 1) (LT s135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1898 reset in 696 ms.
Stack based approach found an accepted trace after 12596 steps with 236 reset with depth 23 and stack size 23 in 70 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-04 finished in 2562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(X(p1)))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 323 transition count 593
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 256 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 136 place count 255 transition count 591
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 282 place count 182 transition count 519
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 3 with 56 rules applied. Total rules applied 338 place count 182 transition count 463
Partial Post-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 372 place count 182 transition count 463
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 388 place count 166 transition count 447
Iterating global reduction 3 with 16 rules applied. Total rules applied 404 place count 166 transition count 447
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 412 place count 166 transition count 439
Applied a total of 412 rules in 143 ms. Remains 166 /323 variables (removed 157) and now considering 439/660 (removed 221) transitions.
// Phase 1: matrix 439 rows 166 cols
[2022-06-07 23:10:49] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-07 23:10:49] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 439 rows 166 cols
[2022-06-07 23:10:49] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-07 23:10:50] [INFO ] State equation strengthened by 295 read => feed constraints.
[2022-06-07 23:10:50] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2022-06-07 23:10:50] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 439 rows 166 cols
[2022-06-07 23:10:50] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-07 23:10:51] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/323 places, 439/660 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/323 places, 439/660 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s36 1) (GEQ s100 1)), p1:(AND (GEQ s13 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 89 steps with 1 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-05 finished in 1784 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(F(!(F(p0) U p1))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 316 place count 165 transition count 502
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 388 place count 165 transition count 430
Applied a total of 388 rules in 73 ms. Remains 165 /323 variables (removed 158) and now considering 430/660 (removed 230) transitions.
// Phase 1: matrix 430 rows 165 cols
[2022-06-07 23:10:51] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-07 23:10:51] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 430 rows 165 cols
[2022-06-07 23:10:51] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-07 23:10:51] [INFO ] State equation strengthened by 286 read => feed constraints.
[2022-06-07 23:10:52] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2022-06-07 23:10:52] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 430 rows 165 cols
[2022-06-07 23:10:52] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-07 23:10:52] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/323 places, 430/660 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/323 places, 430/660 transitions.
Stuttering acceptance computed with spot in 169 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s129 1)), p1:(GEQ s159 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1877 reset in 736 ms.
Stack based approach found an accepted trace after 25135 steps with 465 reset with depth 30 and stack size 30 in 156 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-06 finished in 2254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(F(G(!p0)))||G(p1))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 136 place count 255 transition count 591
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 316 place count 165 transition count 502
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 388 place count 165 transition count 430
Applied a total of 388 rules in 72 ms. Remains 165 /323 variables (removed 158) and now considering 430/660 (removed 230) transitions.
// Phase 1: matrix 430 rows 165 cols
[2022-06-07 23:10:53] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-07 23:10:53] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 430 rows 165 cols
[2022-06-07 23:10:53] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-07 23:10:53] [INFO ] State equation strengthened by 287 read => feed constraints.
[2022-06-07 23:10:54] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2022-06-07 23:10:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 430 rows 165 cols
[2022-06-07 23:10:54] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-07 23:10:54] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/323 places, 430/660 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/323 places, 430/660 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), p0, (AND p0 (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s18 1), p1:(LT s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1442 steps with 38 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-07 finished in 1327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))&&F(X(p1))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 9 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:54] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-07 23:10:55] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:55] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-07 23:10:55] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:10:56] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:56] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-07 23:10:56] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s234 1) (GEQ s157 1) (GEQ s119 1) (GEQ s321 1)), p1:(AND (GEQ s0 1) (GEQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-08 finished in 1767 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(G(p0))||p1))&&F(p2))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:56] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-07 23:10:56] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:56] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-07 23:10:57] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:10:57] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:10:57] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-07 23:10:58] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s216 1), p2:(GEQ s307 1), p0:(AND (GEQ s96 1) (GEQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 195 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-11 finished in 2237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(G((F(p0)&&p1))))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 318 place count 164 transition count 501
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 389 place count 164 transition count 430
Applied a total of 389 rules in 50 ms. Remains 164 /323 variables (removed 159) and now considering 430/660 (removed 230) transitions.
// Phase 1: matrix 430 rows 164 cols
[2022-06-07 23:10:58] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-07 23:10:59] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 430 rows 164 cols
[2022-06-07 23:10:59] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-07 23:10:59] [INFO ] State equation strengthened by 287 read => feed constraints.
[2022-06-07 23:10:59] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2022-06-07 23:10:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 430 rows 164 cols
[2022-06-07 23:10:59] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-07 23:11:00] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/323 places, 430/660 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/323 places, 430/660 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-13 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:(GEQ s95 1), p0:(GEQ s71 1)], 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 62 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-13 finished in 1642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((X(p0)||p1))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:00] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-07 23:11:00] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:00] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-07 23:11:01] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:11:01] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:01] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-07 23:11:02] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s266 1), p0:(LT s143 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 453 reset in 247 ms.
Product exploration explored 100000 steps with 450 reset in 409 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 500 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1935 steps, including 8 resets, run visited all 4 properties in 74 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 616 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:05] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-07 23:11:05] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:05] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-07 23:11:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:11:06] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:06] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-07 23:11:07] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 660/660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (X p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 547 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3512 steps, including 17 resets, run visited all 4 properties in 105 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (X p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 689 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Entered a terminal (fully accepting) state of product in 96405 steps with 434 reset in 267 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-14 finished in 8798 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G((p0 U F(p0))) U p1)||F((p2 U X(p2))))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:09] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-07 23:11:09] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:09] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-07 23:11:09] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-07 23:11:10] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
// Phase 1: matrix 660 rows 323 cols
[2022-06-07 23:11:10] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-07 23:11:11] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s254 1), p2:(GEQ s312 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 202 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-15 finished in 1861 ms.
All properties solved by simple procedures.
Total runtime 35934 ms.

BK_STOP 1654643471335

--------------------
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="CANInsertWithFailure-PT-010"
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 CANInsertWithFailure-PT-010, 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 r294-smll-165463872300012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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