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

About the Execution of LoLa+red for ShieldIIPt-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1917.936 39110.00 64574.00 33.10 FTFTFTTTTFTTFFFF 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.r391-oct2-167903715100310.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-040A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:24 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.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 212K 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-040A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679272691884

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:38:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:38:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:38:14] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-20 00:38:14] [INFO ] Transformed 763 places.
[2023-03-20 00:38:14] [INFO ] Transformed 563 transitions.
[2023-03-20 00:38:14] [INFO ] Found NUPN structural information;
[2023-03-20 00:38:14] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 12) seen :1
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :1
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 562 rows 763 cols
[2023-03-20 00:38:15] [INFO ] Computed 361 place invariants in 11 ms
[2023-03-20 00:38:16] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 00:38:16] [INFO ] [Nat]Absence check using 361 positive place invariants in 91 ms returned sat
[2023-03-20 00:38:18] [INFO ] After 1446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 00:38:19] [INFO ] After 2831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 875 ms.
[2023-03-20 00:38:20] [INFO ] After 4399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 971 ms.
Support contains 93 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 57 place count 762 transition count 561
Applied a total of 57 rules in 120 ms. Remains 762 /763 variables (removed 1) and now considering 561/562 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 762/763 places, 561/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 9) seen :1
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 561 rows 762 cols
[2023-03-20 00:38:22] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-20 00:38:22] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 00:38:23] [INFO ] [Nat]Absence check using 361 positive place invariants in 61 ms returned sat
[2023-03-20 00:38:24] [INFO ] After 1116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 00:38:24] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-20 00:38:25] [INFO ] After 651ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 00:38:26] [INFO ] After 1699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 836 ms.
[2023-03-20 00:38:27] [INFO ] After 4102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 701 ms.
Support contains 83 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 561/561 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Applied a total of 2 rules in 62 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 762/762 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 133774 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{1=1, 2=1, 3=1, 4=1, 6=1, 7=1}
Probabilistic random walk after 133774 steps, saw 131716 distinct states, run finished after 3003 ms. (steps per millisecond=44 ) properties seen :6
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 561 rows 762 cols
[2023-03-20 00:38:31] [INFO ] Computed 361 place invariants in 7 ms
[2023-03-20 00:38:31] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:38:32] [INFO ] [Nat]Absence check using 361 positive place invariants in 68 ms returned sat
[2023-03-20 00:38:32] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:38:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 00:38:33] [INFO ] After 322ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 00:38:33] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-20 00:38:33] [INFO ] After 1782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 109 ms.
Support contains 41 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 561/561 transitions.
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 762 transition count 561
Applied a total of 14 rules in 113 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 762/762 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 195817 steps, run timeout after 3002 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195817 steps, saw 191585 distinct states, run finished after 3004 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 561 rows 762 cols
[2023-03-20 00:38:37] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-20 00:38:37] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:38:37] [INFO ] [Nat]Absence check using 361 positive place invariants in 75 ms returned sat
[2023-03-20 00:38:38] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:38:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 00:38:38] [INFO ] After 320ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 00:38:38] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-20 00:38:39] [INFO ] After 1863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 75 ms.
Support contains 41 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 561/561 transitions.
Applied a total of 0 rules in 16 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 762/762 places, 561/561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 561/561 transitions.
Applied a total of 0 rules in 26 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2023-03-20 00:38:39] [INFO ] Invariant cache hit.
[2023-03-20 00:38:39] [INFO ] Implicit Places using invariants in 548 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 551 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 761/762 places, 561/561 transitions.
Applied a total of 0 rules in 17 ms. Remains 761 /761 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 594 ms. Remains : 761/762 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 211810 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211810 steps, saw 207145 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 561 rows 761 cols
[2023-03-20 00:38:43] [INFO ] Computed 360 place invariants in 6 ms
[2023-03-20 00:38:43] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:38:43] [INFO ] [Nat]Absence check using 360 positive place invariants in 72 ms returned sat
[2023-03-20 00:38:44] [INFO ] After 587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:38:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 00:38:44] [INFO ] After 337ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 00:38:44] [INFO ] After 708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 459 ms.
[2023-03-20 00:38:45] [INFO ] After 2023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 93 ms.
Support contains 41 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 561/561 transitions.
Applied a total of 0 rules in 15 ms. Remains 761 /761 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 761/761 places, 561/561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 561/561 transitions.
Applied a total of 0 rules in 51 ms. Remains 761 /761 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2023-03-20 00:38:45] [INFO ] Invariant cache hit.
[2023-03-20 00:38:46] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-20 00:38:46] [INFO ] Invariant cache hit.
[2023-03-20 00:38:46] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 00:38:47] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2126 ms to find 0 implicit places.
[2023-03-20 00:38:47] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-20 00:38:47] [INFO ] Invariant cache hit.
[2023-03-20 00:38:48] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2851 ms. Remains : 761/761 places, 561/561 transitions.
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 761 transition count 561
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 761 transition count 527
Applied a total of 68 rules in 43 ms. Remains 761 /761 variables (removed 0) and now considering 527/561 (removed 34) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 527 rows 761 cols
[2023-03-20 00:38:48] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-20 00:38:48] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:38:48] [INFO ] [Nat]Absence check using 360 positive place invariants in 66 ms returned sat
[2023-03-20 00:38:49] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:38:49] [INFO ] After 826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-20 00:38:49] [INFO ] After 1353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 00:38:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 15 ms.
[2023-03-20 00:38:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 761 places, 561 transitions and 2576 arcs took 3 ms.
[2023-03-20 00:38:50] [INFO ] Flatten gal took : 124 ms
Total runtime 36117 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-040A
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679272730994

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 0 ShieldIIPt-PT-040A-ReachabilityCardinality-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 ShieldIIPt-PT-040A-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 ShieldIIPt-PT-040A-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type SRCH) for 0 ShieldIIPt-PT-040A-ReachabilityCardinality-00
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: FINISHED task # 11 (type EXCL) for ShieldIIPt-PT-040A-ReachabilityCardinality-00
lola: result : true
lola: markings : 236
lola: fired transitions : 235
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for ShieldIIPt-PT-040A-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 8 (type EQUN) for ShieldIIPt-PT-040A-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 10 (type SRCH) for ShieldIIPt-PT-040A-ReachabilityCardinality-00 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 3 ShieldIIPt-PT-040A-ReachabilityCardinality-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 ShieldIIPt-PT-040A-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 ShieldIIPt-PT-040A-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 3 ShieldIIPt-PT-040A-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type FNDP) for ShieldIIPt-PT-040A-ReachabilityCardinality-00
lola: result : unknown
lola: fired transitions : 2099
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-14.sara.
lola: FINISHED task # 17 (type EXCL) for ShieldIIPt-PT-040A-ReachabilityCardinality-10
lola: result : true
lola: markings : 500
lola: fired transitions : 499
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for ShieldIIPt-PT-040A-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 14 (type EQUN) for ShieldIIPt-PT-040A-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 16 (type SRCH) for ShieldIIPt-PT-040A-ReachabilityCardinality-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040A-ReachabilityCardinality-00: AG false tandem / relaxed
ShieldIIPt-PT-040A-ReachabilityCardinality-10: EF true tandem / relaxed


Time elapsed: 0 secs. Pages in use: 2

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-040A"
export BK_EXAMINATION="ReachabilityCardinality"
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-040A, examination is ReachabilityCardinality"
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-167903715100310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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