fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r135-smll-167819414600532
Last Updated
May 14, 2023

About the Execution of LoLa+red for DoubleLock-PT-p2s1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
344.367 17800.00 34224.00 730.90 FFFFFFFFFTTFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414600532.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DoubleLock-PT-p2s1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414600532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 14:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 14:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 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 DoubleLock-PT-p2s1-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p2s1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678395790007

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s1
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 21:03:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 21:03:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 21:03:14] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-09 21:03:14] [INFO ] Transformed 64 places.
[2023-03-09 21:03:14] [INFO ] Transformed 212 transitions.
[2023-03-09 21:03:14] [INFO ] Parsed PT model containing 64 places and 212 transitions and 860 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
FORMULA DoubleLock-PT-p2s1-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 204/204 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 204
Applied a total of 4 rules in 45 ms. Remains 52 /56 variables (removed 4) and now considering 204/204 (removed 0) transitions.
[2023-03-09 21:03:14] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 52 cols
[2023-03-09 21:03:14] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-09 21:03:15] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-09 21:03:15] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2023-03-09 21:03:15] [INFO ] Invariant cache hit.
[2023-03-09 21:03:15] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-09 21:03:15] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-09 21:03:15] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2023-03-09 21:03:15] [INFO ] Invariant cache hit.
[2023-03-09 21:03:15] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 204/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 52/56 places, 204/204 transitions.
Support contains 31 out of 52 places after structural reductions.
[2023-03-09 21:03:16] [INFO ] Flatten gal took : 96 ms
[2023-03-09 21:03:16] [INFO ] Flatten gal took : 37 ms
[2023-03-09 21:03:16] [INFO ] Input system was already deterministic with 204 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 977 ms. (steps per millisecond=10 ) properties (out of 24) seen :21
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 21:03:17] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2023-03-09 21:03:17] [INFO ] Invariant cache hit.
[2023-03-09 21:03:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 21:03:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 21:03:17] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA DoubleLock-PT-p2s1-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 24 stable transitions
FORMULA DoubleLock-PT-p2s1-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 192
Applied a total of 6 rules in 55 ms. Remains 49 /52 variables (removed 3) and now considering 192/204 (removed 12) transitions.
[2023-03-09 21:03:18] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
// Phase 1: matrix 143 rows 49 cols
[2023-03-09 21:03:18] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-09 21:03:18] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-09 21:03:18] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:18] [INFO ] Invariant cache hit.
[2023-03-09 21:03:18] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 21:03:18] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-09 21:03:18] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-09 21:03:18] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:18] [INFO ] Invariant cache hit.
[2023-03-09 21:03:19] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/52 places, 192/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 750 ms. Remains : 49/52 places, 192/204 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-00 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:(AND (GEQ s3 1) (GEQ s20 1)), p0:(OR (LT s0 1) (LT s14 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 182 steps with 5 reset in 17 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLFireability-00 finished in 1246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&F(p1)&&G(!p2)))))'
Support contains 8 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Applied a total of 0 rules in 17 ms. Remains 52 /52 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-09 21:03:19] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 52 cols
[2023-03-09 21:03:19] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 21:03:19] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 21:03:19] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2023-03-09 21:03:19] [INFO ] Invariant cache hit.
[2023-03-09 21:03:19] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-09 21:03:19] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-09 21:03:19] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-09 21:03:19] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2023-03-09 21:03:19] [INFO ] Invariant cache hit.
[2023-03-09 21:03:19] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 52/52 places, 204/204 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (OR (NOT p1) p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), p2, p0]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=5, aps=[p2:(AND (GEQ s1 1) (GEQ s32 1)), p1:(OR (AND (GEQ s2 1) (GEQ s20 1)) (AND (GEQ s8 1) (GEQ s41 1)) (AND (GEQ s0 1) (GEQ s13 1))), p0:(AND (GEQ s8 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3611 steps with 22 reset in 100 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLFireability-01 finished in 1026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 192
Applied a total of 6 rules in 32 ms. Remains 49 /52 variables (removed 3) and now considering 192/204 (removed 12) transitions.
[2023-03-09 21:03:20] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
// Phase 1: matrix 143 rows 49 cols
[2023-03-09 21:03:20] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 21:03:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 21:03:20] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:20] [INFO ] Invariant cache hit.
[2023-03-09 21:03:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 21:03:20] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-09 21:03:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 21:03:20] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:20] [INFO ] Invariant cache hit.
[2023-03-09 21:03:21] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/52 places, 192/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 49/52 places, 192/204 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 772 steps with 11 reset in 18 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLFireability-02 finished in 689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 192
Applied a total of 6 rules in 28 ms. Remains 49 /52 variables (removed 3) and now considering 192/204 (removed 12) transitions.
[2023-03-09 21:03:21] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:21] [INFO ] Invariant cache hit.
[2023-03-09 21:03:21] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 21:03:21] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:21] [INFO ] Invariant cache hit.
[2023-03-09 21:03:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 21:03:21] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-09 21:03:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 21:03:21] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:21] [INFO ] Invariant cache hit.
[2023-03-09 21:03:21] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/52 places, 192/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 534 ms. Remains : 49/52 places, 192/204 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s25 1)), p0:(AND (GEQ s2 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 210 steps with 3 reset in 6 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLFireability-04 finished in 679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 192
Applied a total of 6 rules in 14 ms. Remains 49 /52 variables (removed 3) and now considering 192/204 (removed 12) transitions.
[2023-03-09 21:03:21] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:21] [INFO ] Invariant cache hit.
[2023-03-09 21:03:21] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-09 21:03:21] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:21] [INFO ] Invariant cache hit.
[2023-03-09 21:03:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 21:03:22] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-09 21:03:22] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:22] [INFO ] Invariant cache hit.
[2023-03-09 21:03:22] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/52 places, 192/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 49/52 places, 192/204 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLFireability-06 finished in 701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((!p2 U (p3||G(!p2)))&&p1))&&p0)))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-09 21:03:22] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 52 cols
[2023-03-09 21:03:22] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 21:03:22] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-09 21:03:22] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2023-03-09 21:03:22] [INFO ] Invariant cache hit.
[2023-03-09 21:03:22] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-09 21:03:22] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-09 21:03:22] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2023-03-09 21:03:22] [INFO ] Invariant cache hit.
[2023-03-09 21:03:23] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 52/52 places, 204/204 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), true, (OR (NOT p1) (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p3) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s14 1)), p1:(AND (GEQ s11 1) (GEQ s41 1)), p3:(AND (GEQ s11 1) (GEQ s41 1) (NOT (AND (GEQ s2 1) (GEQ s48 1)))), p2:(AND (GEQ s2 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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 0 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLFireability-07 finished in 920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 192
Applied a total of 6 rules in 29 ms. Remains 49 /52 variables (removed 3) and now considering 192/204 (removed 12) transitions.
[2023-03-09 21:03:23] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
// Phase 1: matrix 143 rows 49 cols
[2023-03-09 21:03:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 21:03:23] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-09 21:03:23] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:23] [INFO ] Invariant cache hit.
[2023-03-09 21:03:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 21:03:23] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-09 21:03:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:03:23] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:23] [INFO ] Invariant cache hit.
[2023-03-09 21:03:23] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/52 places, 192/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 49/52 places, 192/204 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s33 1)), p1:(AND (GEQ s1 1) (GEQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLFireability-08 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 49 transition count 192
Applied a total of 6 rules in 32 ms. Remains 49 /52 variables (removed 3) and now considering 192/204 (removed 12) transitions.
[2023-03-09 21:03:24] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:24] [INFO ] Invariant cache hit.
[2023-03-09 21:03:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-09 21:03:24] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:24] [INFO ] Invariant cache hit.
[2023-03-09 21:03:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 21:03:24] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-09 21:03:24] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2023-03-09 21:03:24] [INFO ] Invariant cache hit.
[2023-03-09 21:03:24] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/52 places, 192/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 49/52 places, 192/204 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s10 1) (LT s45 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 454 ms.
Product exploration explored 100000 steps with 33333 reset in 562 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p2s1-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p2s1-LTLFireability-10 finished in 1876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((!p1 U G(p1))))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 200
Applied a total of 2 rules in 3 ms. Remains 51 /52 variables (removed 1) and now considering 200/204 (removed 4) transitions.
[2023-03-09 21:03:25] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
// Phase 1: matrix 148 rows 51 cols
[2023-03-09 21:03:25] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 21:03:26] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 21:03:26] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2023-03-09 21:03:26] [INFO ] Invariant cache hit.
[2023-03-09 21:03:26] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-09 21:03:26] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-09 21:03:26] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2023-03-09 21:03:26] [INFO ] Invariant cache hit.
[2023-03-09 21:03:26] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/52 places, 200/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 51/52 places, 200/204 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (GEQ s9 1) (GEQ s49 1)), p0:(AND (GEQ s11 1) (GEQ s44 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s1-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLFireability-14 finished in 600 ms.
All properties solved by simple procedures.
Total runtime 12380 ms.
ITS solved all properties within timeout

BK_STOP 1678395807807

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="DoubleLock-PT-p2s1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DoubleLock-PT-p2s1, 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 r135-smll-167819414600532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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