Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521400063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANInsertWithFailure-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 698K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716223612885

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 16:46:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 16:46:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:46:54] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-20 16:46:54] [INFO ] Transformed 324 places.
[2024-05-20 16:46:55] [INFO ] Transformed 660 transitions.
[2024-05-20 16:46:55] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 1013 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 33 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 16:46:55] [INFO ] Computed 12 invariants in 28 ms
[2024-05-20 16:46:55] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-20 16:46:55] [INFO ] Invariant cache hit.
[2024-05-20 16:46:56] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:56] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-20 16:46:56] [INFO ] Invariant cache hit.
[2024-05-20 16:46:56] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1082 ms. Remains : 323/324 places, 660/660 transitions.
Support contains 32 out of 323 places after structural reductions.
[2024-05-20 16:46:57] [INFO ] Flatten gal took : 64 ms
[2024-05-20 16:46:57] [INFO ] Flatten gal took : 36 ms
[2024-05-20 16:46:57] [INFO ] Input system was already deterministic with 660 transitions.
Support contains 31 out of 323 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 16:46:57] [INFO ] Invariant cache hit.
[2024-05-20 16:46:57] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-20 16:46:57] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-20 16:46:57] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-20 16:46:57] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:57] [INFO ] After 75ms SMT Verify possible using 190 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:46:57] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:46:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-20 16:46:57] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 16:46:58] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:46:58] [INFO ] After 107ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:46:58] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-20 16:46:58] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 323 transition count 596
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 259 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 258 transition count 595
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 130 place count 258 transition count 593
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 256 transition count 593
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 308 place count 169 transition count 506
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 3 with 71 rules applied. Total rules applied 379 place count 169 transition count 435
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 382 place count 169 transition count 432
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 385 place count 166 transition count 432
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 4 with 113 rules applied. Total rules applied 498 place count 166 transition count 432
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 518 place count 166 transition count 432
Applied a total of 518 rules in 95 ms. Remains 166 /323 variables (removed 157) and now considering 432/660 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 166/323 places, 432/660 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 984991 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 984991 steps, saw 131029 distinct states, run finished after 3002 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 432 rows 166 cols
[2024-05-20 16:47:01] [INFO ] Computed 12 invariants in 11 ms
[2024-05-20 16:47:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 16:47:01] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 16:47:01] [INFO ] After 98ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-20 16:47:01] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-05-20 16:47:01] [INFO ] After 74ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:47:01] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:47:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 16:47:01] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 16:47:02] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:47:02] [INFO ] After 77ms SMT Verify possible using 397 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:47:02] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-20 16:47:02] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 432/432 transitions.
Applied a total of 0 rules in 11 ms. Remains 166 /166 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 166/166 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 432/432 transitions.
Applied a total of 0 rules in 8 ms. Remains 166 /166 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-05-20 16:47:02] [INFO ] Invariant cache hit.
[2024-05-20 16:47:02] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-20 16:47:02] [INFO ] Invariant cache hit.
[2024-05-20 16:47:02] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-05-20 16:47:03] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2024-05-20 16:47:03] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-20 16:47:03] [INFO ] Invariant cache hit.
[2024-05-20 16:47:03] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 166/166 places, 432/432 transitions.
Graph (trivial) has 332 edges and 166 vertex of which 97 / 166 are part of one of the 2 SCC in 3 ms
Free SCC test removed 95 places
Drop transitions removed 210 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 302 transitions.
Graph (complete) has 194 edges and 71 vertex of which 44 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 44 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 36 place count 44 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 42 transition count 86
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 59 place count 23 transition count 55
Iterating global reduction 1 with 19 rules applied. Total rules applied 78 place count 23 transition count 55
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 90 place count 23 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 22 transition count 42
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 22 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 22 transition count 44
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 21 transition count 41
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 21 transition count 41
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 17 transition count 37
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 17 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 17 transition count 35
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 122 place count 17 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 16 transition count 26
Applied a total of 123 rules in 29 ms. Remains 16 /166 variables (removed 150) and now considering 26/432 (removed 406) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 26 rows 16 cols
[2024-05-20 16:47:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 16:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 16:47:03] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:47:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 16:47:03] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:47:03] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 16:47:03] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 42 stabilizing places and 70 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X((!p0 U (!p1||G(!p0)))))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 16:47:03] [INFO ] Computed 12 invariants in 10 ms
[2024-05-20 16:47:03] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-20 16:47:03] [INFO ] Invariant cache hit.
[2024-05-20 16:47:03] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:04] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-05-20 16:47:04] [INFO ] Invariant cache hit.
[2024-05-20 16:47:04] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 323/323 places, 660/660 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 216 ms :[p0, (AND p0 p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s21 1) (GEQ s271 1)), p1:(AND (GEQ s91 1) (GEQ s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-01 finished in 1929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:47:05] [INFO ] Invariant cache hit.
[2024-05-20 16:47:05] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-20 16:47:05] [INFO ] Invariant cache hit.
[2024-05-20 16:47:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:06] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-20 16:47:06] [INFO ] Invariant cache hit.
[2024-05-20 16:47:06] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 836 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s273 1), p0:(LT s192 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33357 reset in 265 ms.
Product exploration explored 100000 steps with 33359 reset in 261 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1137 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:47:08] [INFO ] Invariant cache hit.
[2024-05-20 16:47:08] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-20 16:47:08] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-20 16:47:08] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:47:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-20 16:47:08] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-20 16:47:08] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:47:08] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:09] [INFO ] After 74ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:47:09] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-20 16:47:09] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 318 place count 164 transition count 501
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 389 place count 164 transition count 430
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 164 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 163 transition count 429
Partial Free-agglomeration rule applied 110 times.
Drop transitions removed 110 transitions
Iterating global reduction 3 with 110 rules applied. Total rules applied 501 place count 163 transition count 429
Applied a total of 501 rules in 41 ms. Remains 163 /323 variables (removed 160) and now considering 429/660 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 163/323 places, 429/660 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1435122 steps, run timeout after 3001 ms. (steps per millisecond=478 ) properties seen :{}
Probabilistic random walk after 1435122 steps, saw 188199 distinct states, run finished after 3001 ms. (steps per millisecond=478 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 429 rows 163 cols
[2024-05-20 16:47:12] [INFO ] Computed 12 invariants in 10 ms
[2024-05-20 16:47:12] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 16:47:12] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 16:47:12] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:47:12] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-20 16:47:12] [INFO ] After 48ms SMT Verify possible using 396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:47:12] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:47:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 16:47:12] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 16:47:12] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:47:12] [INFO ] After 42ms SMT Verify possible using 396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:47:12] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-20 16:47:12] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 429/429 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 163/163 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 429/429 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-05-20 16:47:12] [INFO ] Invariant cache hit.
[2024-05-20 16:47:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-20 16:47:12] [INFO ] Invariant cache hit.
[2024-05-20 16:47:12] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-20 16:47:13] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-20 16:47:13] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-20 16:47:13] [INFO ] Invariant cache hit.
[2024-05-20 16:47:13] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 806 ms. Remains : 163/163 places, 429/429 transitions.
Graph (trivial) has 364 edges and 163 vertex of which 118 / 163 are part of one of the 2 SCC in 0 ms
Free SCC test removed 116 places
Drop transitions removed 276 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 378 transitions.
Graph (complete) has 113 edges and 47 vertex of which 16 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 15 transition count 20
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 7 transition count 12
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 7 transition count 12
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 7 transition count 9
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 6 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 5 transition count 6
Applied a total of 48 rules in 8 ms. Remains 5 /163 variables (removed 158) and now considering 6/429 (removed 423) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 5 cols
[2024-05-20 16:47:13] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 16:47:13] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:47:13] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 16:47:13] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 12 factoid took 213 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-02 finished in 8120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 318 place count 164 transition count 501
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 389 place count 164 transition count 430
Applied a total of 389 rules in 55 ms. Remains 164 /323 variables (removed 159) and now considering 430/660 (removed 230) transitions.
// Phase 1: matrix 430 rows 164 cols
[2024-05-20 16:47:13] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 16:47:13] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-20 16:47:13] [INFO ] Invariant cache hit.
[2024-05-20 16:47:13] [INFO ] State equation strengthened by 287 read => feed constraints.
[2024-05-20 16:47:14] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-20 16:47:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-20 16:47:14] [INFO ] Invariant cache hit.
[2024-05-20 16:47:14] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/323 places, 430/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 671 ms. Remains : 164/323 places, 430/660 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1865 reset in 261 ms.
Stack based approach found an accepted trace after 641 steps with 12 reset with depth 46 and stack size 46 in 3 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-04 finished in 994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!F(X(p0)) U p1))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 16:47:14] [INFO ] Computed 12 invariants in 4 ms
[2024-05-20 16:47:14] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-20 16:47:14] [INFO ] Invariant cache hit.
[2024-05-20 16:47:14] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:15] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-05-20 16:47:15] [INFO ] Invariant cache hit.
[2024-05-20 16:47:15] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 195 ms :[p0, (NOT p1), (NOT p1), (NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=p0, acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(GEQ s254 1), p1:(AND (GEQ s166 1) (NOT (AND (GEQ s2 1) (GEQ s115 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-06 finished in 1149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 323 transition count 594
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 257 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 256 transition count 593
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 134 place count 256 transition count 591
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 290 place count 178 transition count 515
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 3 with 62 rules applied. Total rules applied 352 place count 178 transition count 453
Partial Post-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 370 place count 178 transition count 453
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 378 place count 170 transition count 445
Iterating global reduction 3 with 8 rules applied. Total rules applied 386 place count 170 transition count 445
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 394 place count 170 transition count 437
Applied a total of 394 rules in 51 ms. Remains 170 /323 variables (removed 153) and now considering 437/660 (removed 223) transitions.
// Phase 1: matrix 437 rows 170 cols
[2024-05-20 16:47:15] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 16:47:16] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-20 16:47:16] [INFO ] Invariant cache hit.
[2024-05-20 16:47:16] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-20 16:47:16] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-20 16:47:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 16:47:16] [INFO ] Invariant cache hit.
[2024-05-20 16:47:16] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/323 places, 437/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 760 ms. Remains : 170/323 places, 437/660 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s123 1), p0:(OR (AND (OR (AND (GEQ s48 1) (GEQ s62 1)) (AND (GEQ s25 1) (GEQ s26 1))) (GEQ s160 1) (LT s102 1)) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-07 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(F(p1))))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 16:47:16] [INFO ] Computed 12 invariants in 6 ms
[2024-05-20 16:47:16] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-20 16:47:16] [INFO ] Invariant cache hit.
[2024-05-20 16:47:16] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:17] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-20 16:47:17] [INFO ] Invariant cache hit.
[2024-05-20 16:47:17] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 763 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 684 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s109 1), p1:(GEQ s211 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 241 ms.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-08 finished in 1969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(p1))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:47:18] [INFO ] Invariant cache hit.
[2024-05-20 16:47:18] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-20 16:47:18] [INFO ] Invariant cache hit.
[2024-05-20 16:47:18] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:19] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-20 16:47:19] [INFO ] Invariant cache hit.
[2024-05-20 16:47:19] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (LT s38 1) (GEQ s288 1)), p1:(LT s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-09 finished in 1055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U ((X(!p0)&&(!p1||X(!p2)))||X(G(!p0)))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:47:19] [INFO ] Invariant cache hit.
[2024-05-20 16:47:19] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-20 16:47:19] [INFO ] Invariant cache hit.
[2024-05-20 16:47:19] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:20] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-20 16:47:20] [INFO ] Invariant cache hit.
[2024-05-20 16:47:20] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0, p0]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s208 1) (GEQ s160 1)), p1:(AND (GEQ s12 1) (GEQ s91 1) (GEQ s208 1)), p2:(AND (GEQ s12 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-10 finished in 928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(p0)||X(p1))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:47:20] [INFO ] Invariant cache hit.
[2024-05-20 16:47:20] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-20 16:47:20] [INFO ] Invariant cache hit.
[2024-05-20 16:47:20] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:21] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-20 16:47:21] [INFO ] Invariant cache hit.
[2024-05-20 16:47:21] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, false, false, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s68 1) (LT s91 1)), p1:(AND (GEQ s68 1) (GEQ s91 1) (GEQ s131 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-11 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(p1))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:47:21] [INFO ] Invariant cache hit.
[2024-05-20 16:47:21] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-20 16:47:21] [INFO ] Invariant cache hit.
[2024-05-20 16:47:21] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:47:22] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-20 16:47:22] [INFO ] Invariant cache hit.
[2024-05-20 16:47:22] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s271 1) (AND (GEQ s119 1) (GEQ s321 1))), p1:(GEQ s234 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 328 steps with 1 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-13 finished in 1119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 318 place count 164 transition count 501
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 389 place count 164 transition count 430
Applied a total of 389 rules in 21 ms. Remains 164 /323 variables (removed 159) and now considering 430/660 (removed 230) transitions.
// Phase 1: matrix 430 rows 164 cols
[2024-05-20 16:47:22] [INFO ] Computed 12 invariants in 6 ms
[2024-05-20 16:47:22] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-20 16:47:22] [INFO ] Invariant cache hit.
[2024-05-20 16:47:22] [INFO ] State equation strengthened by 287 read => feed constraints.
[2024-05-20 16:47:23] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-20 16:47:23] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-20 16:47:23] [INFO ] Invariant cache hit.
[2024-05-20 16:47:23] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/323 places, 430/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 597 ms. Remains : 164/323 places, 430/660 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s130 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-14 finished in 706 ms.
All properties solved by simple procedures.
Total runtime 29021 ms.

BK_STOP 1716223645368

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CANInsertWithFailure-PT-010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521400063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;