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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 11K Apr 29 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 21:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 21:14 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 5.3K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-PT-V04P05N02-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652578559950

Running Version 202205111006
[2022-05-15 01:36:01] [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 01:36:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 01:36:01] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2022-05-15 01:36:01] [INFO ] Transformed 28 places.
[2022-05-15 01:36:01] [INFO ] Transformed 52 transitions.
[2022-05-15 01:36:01] [INFO ] Parsed PT model containing 28 places and 52 transitions in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Applied a total of 2 rules in 9 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:36:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:02] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:36:02] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
[2022-05-15 01:36:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:02] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-15 01:36:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:02] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:36:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:02] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-15 01:36:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:02] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 26/28 places, 52/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/28 places, 52/52 transitions.
Support contains 24 out of 26 places after structural reductions.
[2022-05-15 01:36:02] [INFO ] Flatten gal took : 21 ms
[2022-05-15 01:36:02] [INFO ] Flatten gal took : 12 ms
[2022-05-15 01:36:02] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-15 01:36:03] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:03] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:36:03] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2022-05-15 01:36:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:36:03] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-15 01:36:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:03] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2022-05-15 01:36:03] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 4 ms to minimize.
[2022-05-15 01:36:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-15 01:36:03] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :0
[2022-05-15 01:36:03] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 20 stable transitions
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0))&&X(p0)&&p1))))'
Support contains 13 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 12 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:36:03] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:03] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2022-05-15 01:36:03] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:03] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:36:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-15 01:36:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:36:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-15 01:36:04] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 01:36:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/26 places, 51/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)) (AND (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s9 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 finished in 429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!F(p0)&&p1)) U (X((p3 U X(p0)))||p2))))'
Support contains 13 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:36:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2022-05-15 01:36:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-15 01:36:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:36:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 432 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), false, (NOT p0), false, true, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p3 (NOT p1)) (AND p3 p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 p3 p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=3 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 6}, { cond=(AND p2 p3 p1 (NOT p0)), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 8}, { cond=(NOT p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (AND (GEQ s5 1) (GEQ s9 1) (GEQ s10 1) (GEQ s20 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s5 1) (GEQ s9 1) (GEQ s10 1) (GEQ...], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-03 finished in 588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(!G(p0))&&G((F(p0)&&p1))) U G(X(p2))))'
Support contains 10 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:36:04] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:04] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2022-05-15 01:36:04] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-15 01:36:04] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 150 ms :[p2, p2, false, (AND p1 p2 p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s7 1), p2:(OR (AND (GEQ s5 1) (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)) (AND (GEQ s4 1) (GEQ s6 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Detected a total of 16/25 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 10 factoid took 1420 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-04 finished in 2087 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G((p1||G(p2))))&&p0))))'
Support contains 13 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:36:06] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:07] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:07] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:07] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-05 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: 3}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (OR (LT s7 1) (LT s9 1) (LT s11 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s12 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s13 1) (LT s15 1)) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-05 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:07] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:07] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 66 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s2 1))) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 61 steps with 7 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-06 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((G(p1)&&p0))&&X(G(p2))))))'
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:07] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:07] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 81 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s7 5) (GEQ s17 1)), p0:(AND (GEQ s15 1) (GEQ s22 1)), p2:(OR (LT s16 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-11 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(X(G(p0))))||X(F(p1)))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:36:07] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:08] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2022-05-15 01:36:08] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 01:36:08] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:36:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:08] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s7 1) (GEQ s9 1) (GEQ s12 1) (GEQ s15 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10276 reset in 115 ms.
Product exploration explored 100000 steps with 10365 reset in 240 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Detected a total of 16/25 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-15 01:36:09] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2022-05-15 01:36:09] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:36:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:36:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-15 01:36:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:36:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:36:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-15 01:36:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:09] [INFO ] [Nat]Added 6 Read/Feed constraints in 13 ms returned sat
[2022-05-15 01:36:09] [INFO ] Computed and/alt/rep : 25/103/25 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-15 01:36:09] [INFO ] Added : 14 causal constraints over 3 iterations in 33 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:36:09] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2022-05-15 01:36:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:09] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2022-05-15 01:36:09] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2022-05-15 01:36:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-15 01:36:09] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2022-05-15 01:36:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:09] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-15 01:36:09] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2022-05-15 01:36:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 52/52 transitions.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Detected a total of 16/25 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-15 01:36:10] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2022-05-15 01:36:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:36:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-15 01:36:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:36:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:36:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-15 01:36:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:36:10] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2022-05-15 01:36:10] [INFO ] Computed and/alt/rep : 25/103/25 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-15 01:36:10] [INFO ] Added : 14 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10312 reset in 112 ms.
Product exploration explored 100000 steps with 10420 reset in 112 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:36:12] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2022-05-15 01:36:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:36:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2022-05-15 01:36:12] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 01:36:12] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2022-05-15 01:36:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:36:12] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 52/52 transitions.
Product exploration explored 100000 steps with 10404 reset in 166 ms.
Product exploration explored 100000 steps with 10422 reset in 166 ms.
Built C files in :
/tmp/ltsmin11977355101986180776
[2022-05-15 01:36:12] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11977355101986180776
Running compilation step : cd /tmp/ltsmin11977355101986180776;'/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 242 ms.
Running link step : cd /tmp/ltsmin11977355101986180776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin11977355101986180776;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17646498444917943319.hoa' '--buchi-type=spotba'
LTSmin run took 91 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-14 finished in 5456 ms.
All properties solved by simple procedures.
Total runtime 11620 ms.

BK_STOP 1652578573495

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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-165251918100164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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