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

About the Execution of LoLa+red for ShieldIIPs-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1681.176 227096.00 284032.00 56.10 TTTTFFFFTFFTTFFT 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-167903714900167.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 ShieldIIPs-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-167903714900167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 868K 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 ShieldIIPs-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679269096805

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=ShieldIIPs-PT-100A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:38:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:38:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:38:19] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2023-03-19 23:38:19] [INFO ] Transformed 2503 places.
[2023-03-19 23:38:19] [INFO ] Transformed 2403 transitions.
[2023-03-19 23:38:19] [INFO ] Found NUPN structural information;
[2023-03-19 23:38:19] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:38:21] [INFO ] Computed 901 place invariants in 55 ms
[2023-03-19 23:38:23] [INFO ] [Real]Absence check using 901 positive place invariants in 518 ms returned sat
[2023-03-19 23:38:24] [INFO ] After 2015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 23:38:25] [INFO ] [Nat]Absence check using 901 positive place invariants in 270 ms returned sat
[2023-03-19 23:38:38] [INFO ] After 13386ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-19 23:38:39] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 11 ms to minimize.
[2023-03-19 23:38:39] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-19 23:38:40] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-19 23:38:40] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-19 23:38:40] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2023-03-19 23:38:41] [INFO ] Deduced a trap composed of 9 places in 449 ms of which 0 ms to minimize.
[2023-03-19 23:38:41] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2023-03-19 23:38:41] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:38:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2543 ms
[2023-03-19 23:38:49] [INFO ] After 23514ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 23:38:49] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2451 ms.
Support contains 217 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 590 times.
Drop transitions removed 590 transitions
Iterating global reduction 0 with 590 rules applied. Total rules applied 594 place count 2501 transition count 2401
Applied a total of 594 rules in 568 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 49377 steps, run timeout after 3007 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49377 steps, saw 47004 distinct states, run finished after 3008 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:38:56] [INFO ] Computed 901 place invariants in 101 ms
[2023-03-19 23:38:57] [INFO ] [Real]Absence check using 873 positive place invariants in 369 ms returned sat
[2023-03-19 23:38:57] [INFO ] [Real]Absence check using 873 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-19 23:38:57] [INFO ] After 1204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 23:38:58] [INFO ] [Nat]Absence check using 873 positive place invariants in 268 ms returned sat
[2023-03-19 23:38:58] [INFO ] [Nat]Absence check using 873 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-19 23:39:19] [INFO ] After 19758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:39:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:39:22] [INFO ] After 3887ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 23:39:22] [INFO ] After 3890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 23:39:22] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1485 ms.
Support contains 217 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 110 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 94 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:39:24] [INFO ] Invariant cache hit.
[2023-03-19 23:39:27] [INFO ] Implicit Places using invariants in 2638 ms returned []
[2023-03-19 23:39:27] [INFO ] Invariant cache hit.
[2023-03-19 23:39:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:39:33] [INFO ] Implicit Places using invariants and state equation in 6116 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8798 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 117 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9010 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 52375 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52375 steps, saw 49790 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:39:37] [INFO ] Computed 900 place invariants in 47 ms
[2023-03-19 23:39:38] [INFO ] [Real]Absence check using 872 positive place invariants in 235 ms returned sat
[2023-03-19 23:39:38] [INFO ] [Real]Absence check using 872 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-19 23:39:38] [INFO ] After 1040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 23:39:39] [INFO ] [Nat]Absence check using 872 positive place invariants in 229 ms returned sat
[2023-03-19 23:39:39] [INFO ] [Nat]Absence check using 872 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-19 23:39:54] [INFO ] After 14276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 23:39:55] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 27 ms to minimize.
[2023-03-19 23:39:57] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 13 ms to minimize.
[2023-03-19 23:40:00] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-19 23:40:00] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-19 23:40:01] [INFO ] Deduced a trap composed of 5 places in 437 ms of which 2 ms to minimize.
[2023-03-19 23:40:01] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-19 23:40:01] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 0 ms to minimize.
[2023-03-19 23:40:01] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 3 ms to minimize.
[2023-03-19 23:40:02] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 0 ms to minimize.
[2023-03-19 23:40:02] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2023-03-19 23:40:02] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-19 23:40:03] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-19 23:40:03] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:40:03] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-19 23:40:03] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2023-03-19 23:40:03] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:40:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:40:03] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 1629 ms.
Support contains 217 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:40:05] [INFO ] Invariant cache hit.
[2023-03-19 23:40:08] [INFO ] Implicit Places using invariants in 2446 ms returned []
[2023-03-19 23:40:08] [INFO ] Invariant cache hit.
[2023-03-19 23:40:12] [INFO ] Implicit Places using invariants and state equation in 4199 ms returned []
Implicit Place search using SMT with State Equation took 6672 ms to find 0 implicit places.
[2023-03-19 23:40:12] [INFO ] Redundant transitions in 405 ms returned []
[2023-03-19 23:40:12] [INFO ] Invariant cache hit.
[2023-03-19 23:40:14] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8914 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 130 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-19 23:40:14] [INFO ] Invariant cache hit.
[2023-03-19 23:40:15] [INFO ] [Real]Absence check using 872 positive place invariants in 342 ms returned sat
[2023-03-19 23:40:15] [INFO ] [Real]Absence check using 872 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-19 23:40:15] [INFO ] After 1163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 23:40:17] [INFO ] [Nat]Absence check using 872 positive place invariants in 283 ms returned sat
[2023-03-19 23:40:17] [INFO ] [Nat]Absence check using 872 positive and 28 generalized place invariants in 150 ms returned sat
[2023-03-19 23:40:34] [INFO ] After 16893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:40:35] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 1 ms to minimize.
[2023-03-19 23:40:35] [INFO ] Deduced a trap composed of 5 places in 365 ms of which 0 ms to minimize.
[2023-03-19 23:40:36] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 2 ms to minimize.
[2023-03-19 23:40:36] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2023-03-19 23:40:41] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 1 ms to minimize.
[2023-03-19 23:40:42] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 2 ms to minimize.
[2023-03-19 23:40:42] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
[2023-03-19 23:40:43] [INFO ] Deduced a trap composed of 5 places in 484 ms of which 0 ms to minimize.
[2023-03-19 23:40:43] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 1 ms to minimize.
[2023-03-19 23:40:43] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2023-03-19 23:40:44] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2023-03-19 23:40:44] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 1 ms to minimize.
[2023-03-19 23:40:45] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 0 ms to minimize.
[2023-03-19 23:40:45] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 1 ms to minimize.
[2023-03-19 23:40:45] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2023-03-19 23:40:46] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 14 ms to minimize.
[2023-03-19 23:40:46] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2023-03-19 23:40:47] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-19 23:40:47] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 14 ms to minimize.
[2023-03-19 23:40:47] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2023-03-19 23:40:47] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2023-03-19 23:40:48] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-19 23:40:48] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
[2023-03-19 23:40:49] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2023-03-19 23:40:49] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-19 23:40:49] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:40:50] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 3 ms to minimize.
[2023-03-19 23:40:50] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-19 23:40:50] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 0 ms to minimize.
[2023-03-19 23:40:51] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 5 ms to minimize.
[2023-03-19 23:40:51] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-19 23:40:52] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 10 ms to minimize.
[2023-03-19 23:40:53] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 1 ms to minimize.
[2023-03-19 23:40:53] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 1 ms to minimize.
[2023-03-19 23:40:53] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 0 ms to minimize.
[2023-03-19 23:40:54] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-19 23:40:54] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:40:54] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-19 23:40:57] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 1 ms to minimize.
[2023-03-19 23:40:57] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 14 ms to minimize.
[2023-03-19 23:40:57] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-19 23:40:58] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2023-03-19 23:40:58] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-19 23:40:58] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-19 23:40:59] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 3 ms to minimize.
[2023-03-19 23:40:59] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 14 ms to minimize.
[2023-03-19 23:41:00] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2023-03-19 23:41:00] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-19 23:41:00] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2023-03-19 23:41:01] [INFO ] Deduced a trap composed of 9 places in 457 ms of which 1 ms to minimize.
[2023-03-19 23:41:01] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-19 23:41:01] [INFO ] Deduced a trap composed of 5 places in 370 ms of which 1 ms to minimize.
[2023-03-19 23:41:02] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-19 23:41:02] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-19 23:41:02] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-19 23:41:02] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 6 ms to minimize.
[2023-03-19 23:41:03] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2023-03-19 23:41:03] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2023-03-19 23:41:03] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-19 23:41:04] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-19 23:41:04] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 29519 ms
[2023-03-19 23:41:10] [INFO ] Deduced a trap composed of 18 places in 406 ms of which 1 ms to minimize.
[2023-03-19 23:41:11] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 0 ms to minimize.
[2023-03-19 23:41:11] [INFO ] Deduced a trap composed of 12 places in 296 ms of which 1 ms to minimize.
[2023-03-19 23:41:12] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 1 ms to minimize.
[2023-03-19 23:41:12] [INFO ] Deduced a trap composed of 13 places in 340 ms of which 0 ms to minimize.
[2023-03-19 23:41:13] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 1 ms to minimize.
[2023-03-19 23:41:13] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-19 23:41:14] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2023-03-19 23:41:14] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2023-03-19 23:41:19] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 1 ms to minimize.
[2023-03-19 23:41:19] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 1 ms to minimize.
[2023-03-19 23:41:20] [INFO ] Deduced a trap composed of 9 places in 417 ms of which 3 ms to minimize.
[2023-03-19 23:41:20] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 1 ms to minimize.
[2023-03-19 23:41:21] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 0 ms to minimize.
[2023-03-19 23:41:21] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-19 23:41:22] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 2 ms to minimize.
[2023-03-19 23:41:22] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2023-03-19 23:41:22] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 0 ms to minimize.
[2023-03-19 23:41:23] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2023-03-19 23:41:23] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 13330 ms
[2023-03-19 23:41:27] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 26 ms to minimize.
[2023-03-19 23:41:27] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 0 ms to minimize.
[2023-03-19 23:41:28] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2023-03-19 23:41:28] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 1 ms to minimize.
[2023-03-19 23:41:29] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 1 ms to minimize.
[2023-03-19 23:41:29] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-19 23:41:30] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 0 ms to minimize.
[2023-03-19 23:41:30] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 0 ms to minimize.
[2023-03-19 23:41:30] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-19 23:41:31] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2023-03-19 23:41:31] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-19 23:41:31] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-19 23:41:32] [INFO ] Deduced a trap composed of 12 places in 715 ms of which 1 ms to minimize.
[2023-03-19 23:41:33] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-19 23:41:33] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-19 23:41:34] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2023-03-19 23:41:34] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-19 23:41:35] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 1 ms to minimize.
[2023-03-19 23:41:35] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 16 ms to minimize.
[2023-03-19 23:41:36] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 13 ms to minimize.
[2023-03-19 23:41:36] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2023-03-19 23:41:36] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-19 23:41:37] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-19 23:41:37] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:41:38] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 0 ms to minimize.
[2023-03-19 23:41:38] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 11310 ms
[2023-03-19 23:41:38] [INFO ] After 80570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9389 ms.
[2023-03-19 23:41:47] [INFO ] After 91815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-19 23:41:47] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-19 23:41:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12067 arcs took 16 ms.
[2023-03-19 23:41:48] [INFO ] Flatten gal took : 436 ms
Total runtime 209362 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
ReachabilityFireability

FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679269323901

--------------------
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/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
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: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 # 19 (type EXCL) for 6 ShieldIIPs-PT-100A-ReachabilityFireability-12
lola: time limit : 717 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 6 ShieldIIPs-PT-100A-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 6 ShieldIIPs-PT-100A-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type SRCH) for 6 ShieldIIPs-PT-100A-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 18 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityFireability-12
lola: result : true
lola: markings : 199
lola: fired transitions : 198
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 16 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 19 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityFireability-12 (obsolete)
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 # 25 (type EXCL) for 0 ShieldIIPs-PT-100A-ReachabilityFireability-02
lola: time limit : 896 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 0 ShieldIIPs-PT-100A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 0 ShieldIIPs-PT-100A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 0 ShieldIIPs-PT-100A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityFireability-12
lola: result : true
lola: fired transitions : 197
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 21 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityFireability-02
lola: result : true
lola: fired transitions : 211
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 22 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 24 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityFireability-02 (obsolete)
sara: try reading problem file /home/mcc/execution/378/ReachabilityFireability-16.sara.
sara: try reading problem file /home/mcc/execution/378/ReachabilityFireability-22.sara.
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 # 32 (type EXCL) for 9 ShieldIIPs-PT-100A-ReachabilityFireability-14
lola: time limit : 1195 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 28 (type FNDP) for 9 ShieldIIPs-PT-100A-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type EQUN) for 9 ShieldIIPs-PT-100A-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type SRCH) for 9 ShieldIIPs-PT-100A-ReachabilityFireability-14
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: FINISHED task # 28 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityFireability-14
lola: result : true
lola: fired transitions : 197
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 29 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 31 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 32 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityFireability-14 (obsolete)
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 # 38 (type EXCL) for 12 ShieldIIPs-PT-100A-ReachabilityFireability-15
lola: time limit : 1793 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 34 (type FNDP) for 12 ShieldIIPs-PT-100A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 12 ShieldIIPs-PT-100A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type SRCH) for 12 ShieldIIPs-PT-100A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 34 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityFireability-15
lola: result : true
lola: fired transitions : 205
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 35 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 37 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 38 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityFireability-15 (obsolete)
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 # 45 (type EXCL) for 3 ShieldIIPs-PT-100A-ReachabilityFireability-06
lola: time limit : 3586 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 41 (type FNDP) for 3 ShieldIIPs-PT-100A-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 42 (type EQUN) for 3 ShieldIIPs-PT-100A-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type SRCH) for 3 ShieldIIPs-PT-100A-ReachabilityFireability-06
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: FINISHED task # 44 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityFireability-06
lola: result : true
lola: markings : 130
lola: fired transitions : 129
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 41 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 42 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 45 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityFireability-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100A-ReachabilityFireability-02: EF true findpath
ShieldIIPs-PT-100A-ReachabilityFireability-06: AG false tandem / insertion
ShieldIIPs-PT-100A-ReachabilityFireability-12: EF true tandem / insertion
ShieldIIPs-PT-100A-ReachabilityFireability-14: AG false findpath
ShieldIIPs-PT-100A-ReachabilityFireability-15: EF true findpath


Time elapsed: 14 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="ShieldIIPs-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 ShieldIIPs-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-167903714900167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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