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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.9K Apr 29 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 167K 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 CANConstruction-PT-005-LTLFireability-00
FORMULA_NAME CANConstruction-PT-005-LTLFireability-01
FORMULA_NAME CANConstruction-PT-005-LTLFireability-02
FORMULA_NAME CANConstruction-PT-005-LTLFireability-03
FORMULA_NAME CANConstruction-PT-005-LTLFireability-04
FORMULA_NAME CANConstruction-PT-005-LTLFireability-05
FORMULA_NAME CANConstruction-PT-005-LTLFireability-06
FORMULA_NAME CANConstruction-PT-005-LTLFireability-07
FORMULA_NAME CANConstruction-PT-005-LTLFireability-08
FORMULA_NAME CANConstruction-PT-005-LTLFireability-09
FORMULA_NAME CANConstruction-PT-005-LTLFireability-10
FORMULA_NAME CANConstruction-PT-005-LTLFireability-11
FORMULA_NAME CANConstruction-PT-005-LTLFireability-12
FORMULA_NAME CANConstruction-PT-005-LTLFireability-13
FORMULA_NAME CANConstruction-PT-005-LTLFireability-14
FORMULA_NAME CANConstruction-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652642197732

Running Version 202205111006
[2022-05-15 19:16:38] [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-15 19:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:16:39] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-05-15 19:16:39] [INFO ] Transformed 112 places.
[2022-05-15 19:16:39] [INFO ] Transformed 140 transitions.
[2022-05-15 19:16:39] [INFO ] Parsed PT model containing 112 places and 140 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-005-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 103 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 103 transition count 122
Applied a total of 18 rules in 18 ms. Remains 103 /112 variables (removed 9) and now considering 122/140 (removed 18) transitions.
// Phase 1: matrix 122 rows 103 cols
[2022-05-15 19:16:39] [INFO ] Computed 11 place invariants in 13 ms
[2022-05-15 19:16:39] [INFO ] Implicit Places using invariants in 178 ms returned [12, 26, 40, 68]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 207 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/112 places, 122/140 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 96 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 119
Applied a total of 6 rules in 11 ms. Remains 96 /99 variables (removed 3) and now considering 119/122 (removed 3) transitions.
// Phase 1: matrix 119 rows 96 cols
[2022-05-15 19:16:39] [INFO ] Computed 7 place invariants in 7 ms
[2022-05-15 19:16:39] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 119 rows 96 cols
[2022-05-15 19:16:39] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 19:16:39] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:39] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/112 places, 119/140 transitions.
Finished structural reductions, in 2 iterations. Remains : 96/112 places, 119/140 transitions.
Support contains 34 out of 96 places after structural reductions.
[2022-05-15 19:16:39] [INFO ] Flatten gal took : 30 ms
[2022-05-15 19:16:39] [INFO ] Flatten gal took : 13 ms
[2022-05-15 19:16:39] [INFO ] Input system was already deterministic with 119 transitions.
Support contains 31 out of 96 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 119 rows 96 cols
[2022-05-15 19:16:40] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-15 19:16:40] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-15 19:16:40] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 19:16:40] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 19:16:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 19:16:40] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 19:16:40] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 19:16:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:40] [INFO ] After 15ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 19:16:40] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-15 19:16:40] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 119/119 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 96 transition count 86
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 63 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 66 place count 63 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 59 transition count 82
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 54 transition count 72
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 54 transition count 72
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 54 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 53 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 96 place count 48 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 43 transition count 75
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 43 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 42 transition count 74
Applied a total of 108 rules in 53 ms. Remains 42 /96 variables (removed 54) and now considering 74/119 (removed 45) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/96 places, 74/119 transitions.
Incomplete random walk after 10000 steps, including 411 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 1905 states, properties seen :0
Probabilistic random walk after 11107 steps, saw 1905 distinct states, run finished after 63 ms. (steps per millisecond=176 ) properties seen :0
Explored full state space saw : 1905 states, properties seen :0
Exhaustive walk after 11107 steps, saw 1905 distinct states, run finished after 13 ms. (steps per millisecond=854 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 18 stabilizing places and 22 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 108
Applied a total of 12 rules in 10 ms. Remains 90 /96 variables (removed 6) and now considering 108/119 (removed 11) transitions.
// Phase 1: matrix 108 rows 90 cols
[2022-05-15 19:16:41] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 19:16:41] [INFO ] Implicit Places using invariants in 79 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 108/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 12 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:41] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:41] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:41] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 19:16:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:41] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/96 places, 107/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 88/96 places, 107/119 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s74 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]]
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-005-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLFireability-01 finished in 1593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!((p0 U p1) U p0))&&F(p2)))'
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 108
Applied a total of 12 rules in 9 ms. Remains 90 /96 variables (removed 6) and now considering 108/119 (removed 11) transitions.
// Phase 1: matrix 108 rows 90 cols
[2022-05-15 19:16:42] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants in 46 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 108/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 3 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 19:16:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/96 places, 107/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 88/96 places, 107/119 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) p0), (NOT p2), p0, true]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s35 1) (GEQ s42 1)), p1:(AND (GEQ s54 1) (GEQ s78 1)), p0:(GEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 99 steps with 1 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-02 finished in 381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!F(p0) U F((G((p0 U p1))&&X(F(p2)))))))'
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 96 transition count 87
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 64 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 64 place count 64 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 59 transition count 82
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 54 transition count 72
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 54 transition count 72
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 54 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 53 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 92 place count 50 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 102 place count 45 transition count 77
Applied a total of 102 rules in 16 ms. Remains 45 /96 variables (removed 51) and now considering 77/119 (removed 42) transitions.
// Phase 1: matrix 77 rows 45 cols
[2022-05-15 19:16:42] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants in 38 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/96 places, 77/119 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 75
Applied a total of 4 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 75/77 (removed 2) transitions.
// Phase 1: matrix 75 rows 42 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 75 rows 42 cols
[2022-05-15 19:16:43] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 19:16:43] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 19:16:43] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/96 places, 75/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 42/96 places, 75/119 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s33 1), p1:(LT s19 1), p0:(AND (GEQ s10 1) (GEQ s15 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 57 steps with 2 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-03 finished in 368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((p0 U G(p1))||!(true U !p2)))))'
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 106
Applied a total of 14 rules in 2 ms. Remains 89 /96 variables (removed 7) and now considering 106/119 (removed 13) transitions.
// Phase 1: matrix 106 rows 89 cols
[2022-05-15 19:16:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 19:16:43] [INFO ] Implicit Places using invariants in 52 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/96 places, 106/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 2 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:43] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:43] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-15 19:16:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:43] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/96 places, 105/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/96 places, 105/119 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s40 1), p2:(AND (GEQ s54 1) (GEQ s68 1)), p1:(GEQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-04 finished in 523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 106
Applied a total of 14 rules in 6 ms. Remains 89 /96 variables (removed 7) and now considering 106/119 (removed 13) transitions.
// Phase 1: matrix 106 rows 89 cols
[2022-05-15 19:16:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 19:16:43] [INFO ] Implicit Places using invariants in 45 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/96 places, 106/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 7 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:43] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:43] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/96 places, 105/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/96 places, 105/119 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s18 1) (LT s35 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-06 finished in 318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(p0) U p1)&&F((F(p2)||p3))))'
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 109
Applied a total of 10 rules in 4 ms. Remains 91 /96 variables (removed 5) and now considering 109/119 (removed 10) transitions.
// Phase 1: matrix 109 rows 91 cols
[2022-05-15 19:16:44] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 40 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 109/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 108
Applied a total of 2 rules in 2 ms. Remains 89 /90 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 89 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 108 rows 89 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 19:16:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/96 places, 108/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 89/96 places, 108/119 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) p0), (AND (NOT p3) (NOT p2)), true]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s18 1)), p3:(GEQ s87 1), p2:(AND (GEQ s1 1) (GEQ s27 1)), p0:(GEQ s17 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-07 finished in 315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X((!(p0 U (X(p1)&&p0))&&G(p1)))))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 96 transition count 89
Reduce places removed 30 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 35 rules applied. Total rules applied 65 place count 66 transition count 84
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 70 place count 61 transition count 84
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 70 place count 61 transition count 80
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 57 transition count 80
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 83 place count 52 transition count 70
Iterating global reduction 3 with 5 rules applied. Total rules applied 88 place count 52 transition count 70
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 52 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 51 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 100 place count 46 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 110 place count 41 transition count 73
Applied a total of 110 rules in 9 ms. Remains 41 /96 variables (removed 55) and now considering 73/119 (removed 46) transitions.
// Phase 1: matrix 73 rows 41 cols
[2022-05-15 19:16:44] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 38 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/96 places, 73/119 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 71
Applied a total of 4 rules in 4 ms. Remains 38 /40 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 38 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 71 rows 38 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:44] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/96 places, 71/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 38/96 places, 71/119 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s19 1), p1:(AND (GEQ s1 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-08 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(F(p0))) U !p0))))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 106
Applied a total of 14 rules in 2 ms. Remains 89 /96 variables (removed 7) and now considering 106/119 (removed 13) transitions.
// Phase 1: matrix 106 rows 89 cols
[2022-05-15 19:16:44] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 40 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/96 places, 106/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 2 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/96 places, 105/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/96 places, 105/119 transitions.
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 105 ms.
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-005-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLFireability-10 finished in 623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 106
Applied a total of 14 rules in 3 ms. Remains 89 /96 variables (removed 7) and now considering 106/119 (removed 13) transitions.
// Phase 1: matrix 106 rows 89 cols
[2022-05-15 19:16:45] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 19:16:45] [INFO ] Implicit Places using invariants in 47 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/96 places, 106/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 1 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:45] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:45] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/96 places, 105/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/96 places, 105/119 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-005-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLFireability-11 finished in 581 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(p1)||p0)))))'
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 108
Applied a total of 12 rules in 4 ms. Remains 90 /96 variables (removed 6) and now considering 108/119 (removed 11) transitions.
// Phase 1: matrix 108 rows 90 cols
[2022-05-15 19:16:45] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 19:16:45] [INFO ] Implicit Places using invariants in 48 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 108/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 1 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:46] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:46] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:46] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/96 places, 107/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 88/96 places, 107/119 transitions.
Stuttering acceptance computed with spot in 631 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s0 1) (GEQ s50 1)), p0:(OR (LT s82 1) (AND (GEQ s42 1) (GEQ s66 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 469 steps with 6 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-13 finished in 829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(p1) U !p2) U p3)))'
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 96 transition count 88
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 65 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 64 transition count 87
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 64 place count 64 transition count 84
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 61 transition count 84
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 56 transition count 74
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 56 transition count 74
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 56 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 55 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 90 place count 51 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 100 place count 46 transition count 78
Applied a total of 100 rules in 16 ms. Remains 46 /96 variables (removed 50) and now considering 78/119 (removed 41) transitions.
// Phase 1: matrix 78 rows 46 cols
[2022-05-15 19:16:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 19:16:46] [INFO ] Implicit Places using invariants in 37 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/96 places, 78/119 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 43 transition count 76
Applied a total of 4 rules in 3 ms. Remains 43 /45 variables (removed 2) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 43 cols
[2022-05-15 19:16:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:46] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 76 rows 43 cols
[2022-05-15 19:16:46] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:46] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 19:16:46] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/96 places, 76/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 43/96 places, 76/119 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p3), true, (NOT p1), p2, (NOT p3)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s4 1) (GEQ s26 1)), p0:(GEQ s6 1), p2:(GEQ s10 1), p1:(GEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-14 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 119/119 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 106
Applied a total of 14 rules in 2 ms. Remains 89 /96 variables (removed 7) and now considering 106/119 (removed 13) transitions.
// Phase 1: matrix 106 rows 89 cols
[2022-05-15 19:16:47] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 19:16:47] [INFO ] Implicit Places using invariants in 38 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/96 places, 106/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 1 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:47] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:47] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 19:16:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:47] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/96 places, 105/119 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/96 places, 105/119 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s52 1), p0:(GEQ s43 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 94 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-15 finished in 322 ms.
All properties solved by simple procedures.
Total runtime 8538 ms.

BK_STOP 1652642207492

--------------------
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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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-165251918600484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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