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.r391-oct2-167903715200343.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715200343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.8K Feb 25 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 21:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 539K Mar 5 18:23 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 ShieldIIPt-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679274062877

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:01:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:01:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:01:05] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-20 01:01:05] [INFO ] Transformed 1903 places.
[2023-03-20 01:01:05] [INFO ] Transformed 1403 transitions.
[2023-03-20 01:01:05] [INFO ] Found NUPN structural information;
[2023-03-20 01:01:05] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 16) seen :4
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-20 01:01:08] [INFO ] Computed 901 place invariants in 21 ms
[2023-03-20 01:01:09] [INFO ] After 1084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 01:01:10] [INFO ] [Nat]Absence check using 901 positive place invariants in 231 ms returned sat
[2023-03-20 01:01:19] [INFO ] After 7712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 01:01:26] [INFO ] After 14988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 5089 ms.
[2023-03-20 01:01:31] [INFO ] After 21856ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 4912 ms.
Support contains 440 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 132 times.
Drop transitions removed 132 transitions
Iterating global reduction 0 with 132 rules applied. Total rules applied 136 place count 1901 transition count 1400
Applied a total of 136 rules in 472 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 12) seen :1
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 146860 steps, run timeout after 6003 ms. (steps per millisecond=24 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 10=1}
Probabilistic random walk after 146860 steps, saw 144966 distinct states, run finished after 6004 ms. (steps per millisecond=24 ) properties seen :8
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-20 01:01:45] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-20 01:01:46] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:01:46] [INFO ] [Nat]Absence check using 901 positive place invariants in 351 ms returned sat
[2023-03-20 01:01:50] [INFO ] After 3079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:01:50] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-20 01:01:52] [INFO ] After 2282ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:01:55] [INFO ] After 5054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2339 ms.
[2023-03-20 01:01:57] [INFO ] After 11445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 855 ms.
Support contains 275 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 1901 transition count 1400
Applied a total of 28 rules in 105 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 96296 steps, run timeout after 3004 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96296 steps, saw 94832 distinct states, run finished after 3008 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-20 01:02:02] [INFO ] Computed 901 place invariants in 18 ms
[2023-03-20 01:02:02] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:02:03] [INFO ] [Nat]Absence check using 901 positive place invariants in 234 ms returned sat
[2023-03-20 01:02:06] [INFO ] After 2974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:02:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-20 01:02:08] [INFO ] After 2387ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:02:14] [INFO ] After 8090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2923 ms.
[2023-03-20 01:02:17] [INFO ] After 14668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 848 ms.
Support contains 275 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 112 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 59 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-20 01:02:18] [INFO ] Invariant cache hit.
[2023-03-20 01:02:20] [INFO ] Implicit Places using invariants in 1890 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1900 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 96 ms. Remains 1899 /1899 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2055 ms. Remains : 1899/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 112734 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112734 steps, saw 111129 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1400 rows 1899 cols
[2023-03-20 01:02:24] [INFO ] Computed 899 place invariants in 12 ms
[2023-03-20 01:02:24] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:02:25] [INFO ] [Nat]Absence check using 899 positive place invariants in 191 ms returned sat
[2023-03-20 01:02:28] [INFO ] After 2974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:02:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-20 01:02:30] [INFO ] After 2418ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:02:34] [INFO ] After 6416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2455 ms.
[2023-03-20 01:02:37] [INFO ] After 12580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 816 ms.
Support contains 275 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1400/1400 transitions.
Applied a total of 0 rules in 49 ms. Remains 1899 /1899 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1899/1899 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1400/1400 transitions.
Applied a total of 0 rules in 45 ms. Remains 1899 /1899 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-20 01:02:38] [INFO ] Invariant cache hit.
[2023-03-20 01:02:39] [INFO ] Implicit Places using invariants in 1625 ms returned []
[2023-03-20 01:02:39] [INFO ] Invariant cache hit.
[2023-03-20 01:02:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-20 01:02:45] [INFO ] Implicit Places using invariants and state equation in 5733 ms returned []
Implicit Place search using SMT with State Equation took 7379 ms to find 0 implicit places.
[2023-03-20 01:02:45] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-20 01:02:45] [INFO ] Invariant cache hit.
[2023-03-20 01:02:46] [INFO ] Dead Transitions using invariants and state equation in 1346 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8894 ms. Remains : 1899/1899 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 1899 transition count 1400
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 1899 transition count 1338
Applied a total of 124 rules in 150 ms. Remains 1899 /1899 variables (removed 0) and now considering 1338/1400 (removed 62) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1338 rows 1899 cols
[2023-03-20 01:02:47] [INFO ] Computed 899 place invariants in 12 ms
[2023-03-20 01:02:47] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:02:48] [INFO ] [Nat]Absence check using 899 positive place invariants in 218 ms returned sat
[2023-03-20 01:02:51] [INFO ] After 2727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:02:53] [INFO ] After 5128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2401 ms.
[2023-03-20 01:02:55] [INFO ] After 8283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:02:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2023-03-20 01:02:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1899 places, 1400 transitions and 6397 arcs took 20 ms.
[2023-03-20 01:02:56] [INFO ] Flatten gal took : 287 ms
Total runtime 111177 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-100A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
ReachabilityFireability

FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679274188125

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 17 (type EXCL) for 0 ShieldIIPt-PT-100A-ReachabilityFireability-02
lola: time limit : 1795 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 ShieldIIPt-PT-100A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 ShieldIIPt-PT-100A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 16 (type SRCH) for 0 ShieldIIPt-PT-100A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 12 (type FNDP) for ShieldIIPt-PT-100A-ReachabilityFireability-02
lola: result : true
lola: fired transitions : 401
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for ShieldIIPt-PT-100A-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 16 (type SRCH) for ShieldIIPt-PT-100A-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldIIPt-PT-100A-ReachabilityFireability-02 (obsolete)
lola: LAUNCH task # 20 (type EXCL) for 3 ShieldIIPt-PT-100A-ReachabilityFireability-10
lola: time limit : 1795 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 6 ShieldIIPt-PT-100A-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 6 ShieldIIPt-PT-100A-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 6 ShieldIIPt-PT-100A-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 14 (type EQUN) for ShieldIIPt-PT-100A-ReachabilityFireability-02
lola: result : unknown
lola: FINISHED task # 9 (type FNDP) for ShieldIIPt-PT-100A-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 45795
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 22 (type EQUN) for ShieldIIPt-PT-100A-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 24 (type SRCH) for ShieldIIPt-PT-100A-ReachabilityFireability-13 (obsolete)
lola: LAUNCH task # 10 (type FNDP) for 3 ShieldIIPt-PT-100A-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 3 ShieldIIPt-PT-100A-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 3 ShieldIIPt-PT-100A-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/380/ReachabilityFireability-11.sara.
lola: FINISHED task # 10 (type FNDP) for ShieldIIPt-PT-100A-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 67699
lola: tried executions : 1
lola: time used : 2.000000
lola: memory pages used : 0
lola: CANCELED task # 11 (type EQUN) for ShieldIIPt-PT-100A-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 19 (type SRCH) for ShieldIIPt-PT-100A-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 20 (type EXCL) for ShieldIIPt-PT-100A-ReachabilityFireability-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-100A-ReachabilityFireability-02: EF true findpath
ShieldIIPt-PT-100A-ReachabilityFireability-10: EF true findpath
ShieldIIPt-PT-100A-ReachabilityFireability-13: EF true findpath


Time elapsed: 12 secs. Pages in use: 3

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="ShieldIIPt-PT-100A"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-100A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715200343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;