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-171620521300008.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 CANConstruction-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-171620521300008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 8.5K 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 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 18:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 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 173K 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 CANConstruction-PT-010-LTLFireability-00
FORMULA_NAME CANConstruction-PT-010-LTLFireability-01
FORMULA_NAME CANConstruction-PT-010-LTLFireability-02
FORMULA_NAME CANConstruction-PT-010-LTLFireability-03
FORMULA_NAME CANConstruction-PT-010-LTLFireability-04
FORMULA_NAME CANConstruction-PT-010-LTLFireability-05
FORMULA_NAME CANConstruction-PT-010-LTLFireability-06
FORMULA_NAME CANConstruction-PT-010-LTLFireability-07
FORMULA_NAME CANConstruction-PT-010-LTLFireability-08
FORMULA_NAME CANConstruction-PT-010-LTLFireability-09
FORMULA_NAME CANConstruction-PT-010-LTLFireability-10
FORMULA_NAME CANConstruction-PT-010-LTLFireability-11
FORMULA_NAME CANConstruction-PT-010-LTLFireability-12
FORMULA_NAME CANConstruction-PT-010-LTLFireability-13
FORMULA_NAME CANConstruction-PT-010-LTLFireability-14
FORMULA_NAME CANConstruction-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716215663049

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=CANConstruction-PT-010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 14:34:24] [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 14:34:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:34:24] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-20 14:34:24] [INFO ] Transformed 322 places.
[2024-05-20 14:34:24] [INFO ] Transformed 480 transitions.
[2024-05-20 14:34:24] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 251 transition count 338
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 251 transition count 338
Applied a total of 142 rules in 47 ms. Remains 251 /322 variables (removed 71) and now considering 338/480 (removed 142) transitions.
// Phase 1: matrix 338 rows 251 cols
[2024-05-20 14:34:25] [INFO ] Computed 21 invariants in 16 ms
[2024-05-20 14:34:25] [INFO ] Implicit Places using invariants in 241 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 268 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/322 places, 338/480 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 233 transition count 329
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 233 transition count 329
Applied a total of 18 rules in 13 ms. Remains 233 /242 variables (removed 9) and now considering 329/338 (removed 9) transitions.
// Phase 1: matrix 329 rows 233 cols
[2024-05-20 14:34:25] [INFO ] Computed 12 invariants in 9 ms
[2024-05-20 14:34:25] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-20 14:34:25] [INFO ] Invariant cache hit.
[2024-05-20 14:34:25] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:25] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 233/322 places, 329/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 711 ms. Remains : 233/322 places, 329/480 transitions.
Support contains 35 out of 233 places after structural reductions.
[2024-05-20 14:34:25] [INFO ] Flatten gal took : 43 ms
[2024-05-20 14:34:25] [INFO ] Flatten gal took : 19 ms
[2024-05-20 14:34:26] [INFO ] Input system was already deterministic with 329 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 30) seen :26
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 14:34:26] [INFO ] Invariant cache hit.
[2024-05-20 14:34:26] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-20 14:34:26] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 14:34:26] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-20 14:34:26] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:26] [INFO ] After 39ms SMT Verify possible using 190 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-20 14:34:26] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-20 14:34:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 14:34:27] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 20 ms returned sat
[2024-05-20 14:34:27] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-20 14:34:27] [INFO ] After 79ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-20 14:34:27] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-20 14:34:27] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 9 ms.
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 329/329 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 233 transition count 265
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 169 transition count 265
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 128 place count 169 transition count 256
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 146 place count 160 transition count 256
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 152 transition count 240
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 152 transition count 240
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 167 place count 152 transition count 235
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 172 place count 147 transition count 235
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 192 place count 137 transition count 225
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 212 place count 127 transition count 294
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 127 transition count 294
Applied a total of 213 rules in 189 ms. Remains 127 /233 variables (removed 106) and now considering 294/329 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 127/233 places, 294/329 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1703 steps, run visited all 1 properties in 40 ms. (steps per millisecond=42 )
Probabilistic random walk after 1703 steps, saw 502 distinct states, run finished after 48 ms. (steps per millisecond=35 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 32 stabilizing places and 41 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' '!(X(F(p0)))'
Support contains 1 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 225 transition count 313
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 225 transition count 313
Applied a total of 16 rules in 9 ms. Remains 225 /233 variables (removed 8) and now considering 313/329 (removed 16) transitions.
// Phase 1: matrix 313 rows 225 cols
[2024-05-20 14:34:28] [INFO ] Computed 12 invariants in 4 ms
[2024-05-20 14:34:28] [INFO ] Implicit Places using invariants in 438 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 441 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/233 places, 313/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 312
Applied a total of 2 rules in 6 ms. Remains 223 /224 variables (removed 1) and now considering 312/313 (removed 1) transitions.
// Phase 1: matrix 312 rows 223 cols
[2024-05-20 14:34:28] [INFO ] Computed 11 invariants in 4 ms
[2024-05-20 14:34:28] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-20 14:34:28] [INFO ] Invariant cache hit.
[2024-05-20 14:34:28] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:29] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/233 places, 312/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 980 ms. Remains : 223/233 places, 312/329 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 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s188 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 130 steps with 0 reset in 13 ms.
FORMULA CANConstruction-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-00 finished in 1253 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(X(p0)))||G((F(p1)||X(X(!p0))))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 224 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 224 transition count 311
Applied a total of 18 rules in 11 ms. Remains 224 /233 variables (removed 9) and now considering 311/329 (removed 18) transitions.
// Phase 1: matrix 311 rows 224 cols
[2024-05-20 14:34:29] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 14:34:29] [INFO ] Implicit Places using invariants in 83 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/233 places, 311/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 5 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-05-20 14:34:29] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 14:34:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 14:34:29] [INFO ] Invariant cache hit.
[2024-05-20 14:34:29] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:29] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/233 places, 310/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 458 ms. Remains : 222/233 places, 310/329 transitions.
Stuttering acceptance computed with spot in 553 ms :[false, false, false, false, false, (AND (NOT p1) (NOT p0)), false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p0), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 11}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 8}], [{ cond=true, acceptance={} source=10 dest: 10}, { cond=(NOT p1), acceptance={} source=10 dest: 11}], [{ cond=(NOT p1), acceptance={} source=11 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s42 1) (GEQ s95 1) (GEQ s114 1)), p0:(AND (GEQ s95 1) (GEQ s114 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22180 reset in 414 ms.
Product exploration explored 100000 steps with 22296 reset in 227 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 12 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[false, false, false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Finished random walk after 6037 steps, including 35 resets, run visited all 4 properties in 40 ms. (steps per millisecond=150 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[false, false, false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 309 ms :[false, false, false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 310/310 transitions.
Applied a total of 0 rules in 4 ms. Remains 222 /222 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2024-05-20 14:34:32] [INFO ] Invariant cache hit.
[2024-05-20 14:34:32] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-20 14:34:32] [INFO ] Invariant cache hit.
[2024-05-20 14:34:32] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:32] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-20 14:34:32] [INFO ] Invariant cache hit.
[2024-05-20 14:34:33] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 222/222 places, 310/310 transitions.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[false, false, false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 60 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :3
Finished Best-First random walk after 1742 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=435 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[false, false, false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 307 ms :[false, false, false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 344 ms :[false, false, false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 15807 reset in 172 ms.
Product exploration explored 100000 steps with 15755 reset in 218 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 310 ms :[false, false, false, false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 310/310 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 222 transition count 310
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 38 place count 222 transition count 310
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 50 place count 222 transition count 310
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 70 place count 202 transition count 290
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 90 place count 202 transition count 290
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 126 place count 202 transition count 290
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 170 place count 158 transition count 246
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 214 place count 158 transition count 246
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 224 place count 158 transition count 336
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 224 rules in 55 ms. Remains 158 /222 variables (removed 64) and now considering 336/310 (removed -26) transitions.
[2024-05-20 14:34:35] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 336 rows 158 cols
[2024-05-20 14:34:35] [INFO ] Computed 11 invariants in 2 ms
[2024-05-20 14:34:35] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/222 places, 336/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 158/222 places, 336/310 transitions.
Built C files in :
/tmp/ltsmin4278682133436864697
[2024-05-20 14:34:35] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4278682133436864697
Running compilation step : cd /tmp/ltsmin4278682133436864697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 522 ms.
Running link step : cd /tmp/ltsmin4278682133436864697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4278682133436864697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6842141871237938439.hoa' '--buchi-type=spotba'
LTSmin run took 2779 ms.
FORMULA CANConstruction-PT-010-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-010-LTLFireability-01 finished in 9796 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((p0&&G((F(!p0)||X(G(p1)))))))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 329/329 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 233 transition count 265
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 169 transition count 265
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 128 place count 169 transition count 256
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 146 place count 160 transition count 256
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 153 place count 153 transition count 242
Iterating global reduction 2 with 7 rules applied. Total rules applied 160 place count 153 transition count 242
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 165 place count 153 transition count 237
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 170 place count 148 transition count 237
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 192 place count 137 transition count 226
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 212 place count 127 transition count 294
Applied a total of 212 rules in 32 ms. Remains 127 /233 variables (removed 106) and now considering 294/329 (removed 35) transitions.
// Phase 1: matrix 294 rows 127 cols
[2024-05-20 14:34:39] [INFO ] Computed 12 invariants in 1 ms
[2024-05-20 14:34:39] [INFO ] Implicit Places using invariants in 86 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/233 places, 294/329 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 292
Applied a total of 4 rules in 11 ms. Remains 124 /126 variables (removed 2) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 124 cols
[2024-05-20 14:34:39] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 14:34:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-20 14:34:39] [INFO ] Invariant cache hit.
[2024-05-20 14:34:39] [INFO ] State equation strengthened by 278 read => feed constraints.
[2024-05-20 14:34:39] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/233 places, 292/329 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 509 ms. Remains : 124/233 places, 292/329 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s91 1), p1:(AND (GEQ s50 1) (GEQ s91 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-02 finished in 717 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((p0&&G(p1))))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 329/329 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 233 transition count 265
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 169 transition count 265
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 128 place count 169 transition count 256
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 146 place count 160 transition count 256
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 152 transition count 240
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 152 transition count 240
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 167 place count 152 transition count 235
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 172 place count 147 transition count 235
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 192 place count 137 transition count 225
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 212 place count 127 transition count 294
Applied a total of 212 rules in 34 ms. Remains 127 /233 variables (removed 106) and now considering 294/329 (removed 35) transitions.
// Phase 1: matrix 294 rows 127 cols
[2024-05-20 14:34:39] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 14:34:39] [INFO ] Implicit Places using invariants in 77 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/233 places, 294/329 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 292
Applied a total of 4 rules in 9 ms. Remains 124 /126 variables (removed 2) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 124 cols
[2024-05-20 14:34:40] [INFO ] Computed 11 invariants in 2 ms
[2024-05-20 14:34:40] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-20 14:34:40] [INFO ] Invariant cache hit.
[2024-05-20 14:34:40] [INFO ] State equation strengthened by 279 read => feed constraints.
[2024-05-20 14:34:40] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/233 places, 292/329 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 473 ms. Remains : 124/233 places, 292/329 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s112 1), p1:(AND (GEQ s22 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-03 finished in 581 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(X(G(p0)))&&F(p1))))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 225 transition count 313
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 225 transition count 313
Applied a total of 16 rules in 6 ms. Remains 225 /233 variables (removed 8) and now considering 313/329 (removed 16) transitions.
// Phase 1: matrix 313 rows 225 cols
[2024-05-20 14:34:40] [INFO ] Computed 12 invariants in 4 ms
[2024-05-20 14:34:40] [INFO ] Implicit Places using invariants in 93 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/233 places, 313/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 312
Applied a total of 2 rules in 4 ms. Remains 223 /224 variables (removed 1) and now considering 312/313 (removed 1) transitions.
// Phase 1: matrix 312 rows 223 cols
[2024-05-20 14:34:40] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 14:34:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 14:34:40] [INFO ] Invariant cache hit.
[2024-05-20 14:34:40] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:40] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/233 places, 312/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 475 ms. Remains : 223/233 places, 312/329 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s216 1), p0:(AND (GEQ s66 1) (GEQ s163 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-04 finished in 730 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)||F(G(p1)))))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 224 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 224 transition count 311
Applied a total of 18 rules in 9 ms. Remains 224 /233 variables (removed 9) and now considering 311/329 (removed 18) transitions.
// Phase 1: matrix 311 rows 224 cols
[2024-05-20 14:34:41] [INFO ] Computed 12 invariants in 1 ms
[2024-05-20 14:34:41] [INFO ] Implicit Places using invariants in 89 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/233 places, 311/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 4 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-05-20 14:34:41] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 14:34:41] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-20 14:34:41] [INFO ] Invariant cache hit.
[2024-05-20 14:34:41] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:41] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/233 places, 310/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 476 ms. Remains : 222/233 places, 310/329 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s0 1) (LT s38 1)), p1:(GEQ s104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-07 finished in 615 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)))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 224 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 224 transition count 311
Applied a total of 18 rules in 10 ms. Remains 224 /233 variables (removed 9) and now considering 311/329 (removed 18) transitions.
// Phase 1: matrix 311 rows 224 cols
[2024-05-20 14:34:41] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 14:34:41] [INFO ] Implicit Places using invariants in 91 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/233 places, 311/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 4 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-05-20 14:34:41] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 14:34:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 14:34:42] [INFO ] Invariant cache hit.
[2024-05-20 14:34:42] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:42] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/233 places, 310/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 456 ms. Remains : 222/233 places, 310/329 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-09 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 (GEQ s42 1) (GEQ s180 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 211 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-09 finished in 563 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(G(((X(p1) U p2)&&p0)))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 225 transition count 313
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 225 transition count 313
Applied a total of 16 rules in 14 ms. Remains 225 /233 variables (removed 8) and now considering 313/329 (removed 16) transitions.
// Phase 1: matrix 313 rows 225 cols
[2024-05-20 14:34:42] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 14:34:42] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-20 14:34:42] [INFO ] Invariant cache hit.
[2024-05-20 14:34:42] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:42] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-20 14:34:42] [INFO ] Invariant cache hit.
[2024-05-20 14:34:42] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/233 places, 313/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 225/233 places, 313/329 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s120 1) (GEQ s122 1)), p2:(AND (GEQ s18 1) (GEQ s162 1)), p1:(AND (GEQ s18 1) (GEQ s162 1) (GEQ s200 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-11 finished in 731 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((F(p0)||(p1 U p2)))))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 224 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 224 transition count 311
Applied a total of 18 rules in 6 ms. Remains 224 /233 variables (removed 9) and now considering 311/329 (removed 18) transitions.
// Phase 1: matrix 311 rows 224 cols
[2024-05-20 14:34:43] [INFO ] Computed 12 invariants in 1 ms
[2024-05-20 14:34:43] [INFO ] Implicit Places using invariants in 91 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/233 places, 311/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 3 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-05-20 14:34:43] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 14:34:43] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-20 14:34:43] [INFO ] Invariant cache hit.
[2024-05-20 14:34:43] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:43] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/233 places, 310/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 453 ms. Remains : 222/233 places, 310/329 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s66 1) (GEQ s200 1) (OR (LT s6 1) (LT s213 1))), p2:(AND (GEQ s6 1) (GEQ s213 1)), p1:(OR (AND (GEQ s95 1) (GEQ s102 1)) (AND (GEQ s6 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 166 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-12 finished in 679 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(((p0 U X(p1))&&(F(!p2) U p3))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 227 transition count 317
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 227 transition count 317
Applied a total of 12 rules in 4 ms. Remains 227 /233 variables (removed 6) and now considering 317/329 (removed 12) transitions.
// Phase 1: matrix 317 rows 227 cols
[2024-05-20 14:34:43] [INFO ] Computed 12 invariants in 1 ms
[2024-05-20 14:34:43] [INFO ] Implicit Places using invariants in 81 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 226/233 places, 317/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 316
Applied a total of 2 rules in 3 ms. Remains 225 /226 variables (removed 1) and now considering 316/317 (removed 1) transitions.
// Phase 1: matrix 316 rows 225 cols
[2024-05-20 14:34:43] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 14:34:43] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-20 14:34:43] [INFO ] Invariant cache hit.
[2024-05-20 14:34:44] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:44] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 225/233 places, 316/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 492 ms. Remains : 225/233 places, 316/329 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p3) (NOT p1)), (NOT p1), (NOT p3), (OR (AND p2 (NOT p3)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p3 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s210 1), p3:(GEQ s135 1), p2:(AND (GEQ s11 1) (GEQ s18 1)), p1:(GEQ s141 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 157 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-14 finished in 844 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&&F((G(p2)||p1))))))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 329/329 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 224 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 224 transition count 311
Applied a total of 18 rules in 5 ms. Remains 224 /233 variables (removed 9) and now considering 311/329 (removed 18) transitions.
// Phase 1: matrix 311 rows 224 cols
[2024-05-20 14:34:44] [INFO ] Computed 12 invariants in 1 ms
[2024-05-20 14:34:44] [INFO ] Implicit Places using invariants in 83 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/233 places, 311/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 4 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-05-20 14:34:44] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 14:34:44] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-20 14:34:44] [INFO ] Invariant cache hit.
[2024-05-20 14:34:44] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 14:34:45] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/233 places, 310/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 472 ms. Remains : 222/233 places, 310/329 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s213 1)) (AND (GEQ s90 1) (GEQ s165 1))), p1:(OR (LT s18 1) (LT s71 1)), p2:(AND (GEQ s18 1) (GEQ s71 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]]
Stuttering criterion allowed to conclude after 405 steps with 2 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-15 finished in 622 ms.
All properties solved by simple procedures.
Total runtime 20706 ms.

BK_STOP 1716215686204

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

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