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.r078-tall-165260110100316.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 EGFr-PT-10421, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110100316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.0K Apr 29 20:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 20:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 29 19:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 19:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 9 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw------- 1 mcc users 672K 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 EGFr-PT-10421-LTLFireability-00
FORMULA_NAME EGFr-PT-10421-LTLFireability-01
FORMULA_NAME EGFr-PT-10421-LTLFireability-02
FORMULA_NAME EGFr-PT-10421-LTLFireability-03
FORMULA_NAME EGFr-PT-10421-LTLFireability-04
FORMULA_NAME EGFr-PT-10421-LTLFireability-05
FORMULA_NAME EGFr-PT-10421-LTLFireability-06
FORMULA_NAME EGFr-PT-10421-LTLFireability-07
FORMULA_NAME EGFr-PT-10421-LTLFireability-08
FORMULA_NAME EGFr-PT-10421-LTLFireability-09
FORMULA_NAME EGFr-PT-10421-LTLFireability-10
FORMULA_NAME EGFr-PT-10421-LTLFireability-11
FORMULA_NAME EGFr-PT-10421-LTLFireability-12
FORMULA_NAME EGFr-PT-10421-LTLFireability-13
FORMULA_NAME EGFr-PT-10421-LTLFireability-14
FORMULA_NAME EGFr-PT-10421-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652659267658

Running Version 202205111006
[2022-05-16 00:01:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:01:09] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2022-05-16 00:01:09] [INFO ] Transformed 208 places.
[2022-05-16 00:01:09] [INFO ] Transformed 378 transitions.
[2022-05-16 00:01:09] [INFO ] Parsed PT model containing 208 places and 378 transitions in 229 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 5 formulas.
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 77 places and 239 transitions.
Reduce places removed 21 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA EGFr-PT-10421-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 139/139 transitions.
Applied a total of 0 rules in 12 ms. Remains 110 /110 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2022-05-16 00:01:09] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:09] [INFO ] Computed 55 place invariants in 6 ms
[2022-05-16 00:01:09] [INFO ] Implicit Places using invariants in 212 ms returned []
[2022-05-16 00:01:09] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:09] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-16 00:01:09] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-16 00:01:09] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2022-05-16 00:01:09] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:09] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 00:01:09] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 139/139 transitions.
Support contains 8 out of 110 places after structural reductions.
[2022-05-16 00:01:09] [INFO ] Flatten gal took : 32 ms
[2022-05-16 00:01:09] [INFO ] Flatten gal took : 15 ms
[2022-05-16 00:01:09] [INFO ] Input system was already deterministic with 139 transitions.
Finished random walk after 115 steps, including 0 resets, run visited all 4 properties in 24 ms. (steps per millisecond=4 )
FORMULA EGFr-PT-10421-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8 stabilizing places and 4 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X((!p0 U p0)))&&p1))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 139/139 transitions.
Applied a total of 0 rules in 13 ms. Remains 110 /110 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2022-05-16 00:01:10] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:10] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-16 00:01:10] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-16 00:01:10] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:10] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-16 00:01:10] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-16 00:01:10] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-05-16 00:01:10] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-16 00:01:10] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:10] [INFO ] Computed 55 place invariants in 6 ms
[2022-05-16 00:01:10] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 139/139 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EGFr-PT-10421-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s45 1) (GEQ s88 1)), p1:(OR (LT s23 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2078 reset in 349 ms.
Stack based approach found an accepted trace after 1106 steps with 23 reset with depth 93 and stack size 93 in 4 ms.
FORMULA EGFr-PT-10421-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EGFr-PT-10421-LTLFireability-02 finished in 996 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(!(F(X((G(p0)||F(p1)))) U p0)))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 139/139 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2022-05-16 00:01:11] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:11] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-16 00:01:11] [INFO ] Implicit Places using invariants in 183 ms returned []
[2022-05-16 00:01:11] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:11] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 00:01:11] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-16 00:01:11] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2022-05-16 00:01:11] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-16 00:01:11] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:11] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-16 00:01:11] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 139/139 transitions.
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, (AND p0 p1)]
Running random walk in product with property : EGFr-PT-10421-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 3}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s34 1) (GEQ s77 1)), p1:(AND (GEQ s23 1) (GEQ s98 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 409 reset in 319 ms.
Product exploration explored 100000 steps with 406 reset in 361 ms.
Computed a total of 8 stabilizing places and 4 stable transitions
Computed a total of 8 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 486 ms. Reduced automaton from 4 states, 12 edges and 2 AP to 4 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[p0, p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 00:01:13] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:13] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 00:01:13] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-16 00:01:13] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:01:13] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2022-05-16 00:01:13] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:01:13] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-16 00:01:13] [INFO ] After 8ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 00:01:13] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 00:01:13] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 139/139 transitions.
Graph (complete) has 278 edges and 110 vertex of which 38 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.2 ms
Discarding 72 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 38 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 37 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 37 transition count 48
Applied a total of 42 rules in 10 ms. Remains 37 /110 variables (removed 73) and now considering 48/139 (removed 91) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/110 places, 48/139 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Finished Best-First random walk after 3538 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=707 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 513 ms. Reduced automaton from 4 states, 12 edges and 2 AP to 4 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 138 ms :[p0, p0, p0, (AND p0 p1)]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 139/139 transitions.
Applied a total of 0 rules in 11 ms. Remains 110 /110 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2022-05-16 00:01:14] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:14] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-16 00:01:14] [INFO ] Implicit Places using invariants in 78 ms returned []
[2022-05-16 00:01:14] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:14] [INFO ] Computed 55 place invariants in 9 ms
[2022-05-16 00:01:14] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-16 00:01:14] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2022-05-16 00:01:14] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-16 00:01:14] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:14] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 00:01:14] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 139/139 transitions.
Computed a total of 8 stabilizing places and 4 stable transitions
Computed a total of 8 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 7 factoid took 484 ms. Reduced automaton from 4 states, 12 edges and 2 AP to 4 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 00:01:15] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2022-05-16 00:01:15] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-16 00:01:15] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-16 00:01:15] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:01:15] [INFO ] [Nat]Absence check using 55 positive place invariants in 6 ms returned sat
[2022-05-16 00:01:15] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:01:15] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-16 00:01:15] [INFO ] After 11ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 00:01:15] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 00:01:15] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 139/139 transitions.
Graph (complete) has 278 edges and 110 vertex of which 38 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.0 ms
Discarding 72 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 38 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 37 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 37 transition count 48
Applied a total of 42 rules in 4 ms. Remains 37 /110 variables (removed 73) and now considering 48/139 (removed 91) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/110 places, 48/139 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 6885 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=983 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 514 ms. Reduced automaton from 4 states, 12 edges and 2 AP to 4 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 209 ms :[p0, p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 397 reset in 272 ms.
Product exploration explored 100000 steps with 406 reset in 324 ms.
Built C files in :
/tmp/ltsmin16441492530386922414
[2022-05-16 00:01:17] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2022-05-16 00:01:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:01:17] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2022-05-16 00:01:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:01:17] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2022-05-16 00:01:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:01:17] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16441492530386922414
Running compilation step : cd /tmp/ltsmin16441492530386922414;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 360 ms.
Running link step : cd /tmp/ltsmin16441492530386922414;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16441492530386922414;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11910268743977095012.hoa' '--buchi-type=spotba'
LTSmin run took 277 ms.
FORMULA EGFr-PT-10421-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EGFr-PT-10421-LTLFireability-11 finished in 6734 ms.
All properties solved by simple procedures.
Total runtime 8972 ms.

BK_STOP 1652659277809

--------------------
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="EGFr-PT-10421"
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 EGFr-PT-10421, 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 r078-tall-165260110100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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