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-167903715300463.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 ShieldPPPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715300463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:05 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.6K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 02:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 349K 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 ShieldPPPs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679275800045

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=ShieldPPPs-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:30:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:30:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:30:02] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-20 01:30:02] [INFO ] Transformed 1363 places.
[2023-03-20 01:30:02] [INFO ] Transformed 1263 transitions.
[2023-03-20 01:30:02] [INFO ] Found NUPN structural information;
[2023-03-20 01:30:02] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 16) seen :13
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2023-03-20 01:30:02] [INFO ] Computed 221 place invariants in 33 ms
[2023-03-20 01:30:03] [INFO ] After 587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:30:03] [INFO ] [Nat]Absence check using 221 positive place invariants in 75 ms returned sat
[2023-03-20 01:30:05] [INFO ] After 1434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:30:06] [INFO ] Deduced a trap composed of 26 places in 503 ms of which 6 ms to minimize.
[2023-03-20 01:30:06] [INFO ] Deduced a trap composed of 29 places in 370 ms of which 1 ms to minimize.
[2023-03-20 01:30:07] [INFO ] Deduced a trap composed of 19 places in 460 ms of which 1 ms to minimize.
[2023-03-20 01:30:07] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 1 ms to minimize.
[2023-03-20 01:30:08] [INFO ] Deduced a trap composed of 24 places in 343 ms of which 2 ms to minimize.
[2023-03-20 01:30:08] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 1 ms to minimize.
[2023-03-20 01:30:08] [INFO ] Deduced a trap composed of 32 places in 352 ms of which 1 ms to minimize.
[2023-03-20 01:30:09] [INFO ] Deduced a trap composed of 19 places in 345 ms of which 1 ms to minimize.
[2023-03-20 01:30:09] [INFO ] Deduced a trap composed of 18 places in 435 ms of which 2 ms to minimize.
[2023-03-20 01:30:10] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 1 ms to minimize.
[2023-03-20 01:30:10] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 1 ms to minimize.
[2023-03-20 01:30:11] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 0 ms to minimize.
[2023-03-20 01:30:11] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 1 ms to minimize.
[2023-03-20 01:30:11] [INFO ] Deduced a trap composed of 32 places in 425 ms of which 11 ms to minimize.
[2023-03-20 01:30:12] [INFO ] Deduced a trap composed of 42 places in 346 ms of which 0 ms to minimize.
[2023-03-20 01:30:12] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 1 ms to minimize.
[2023-03-20 01:30:13] [INFO ] Deduced a trap composed of 21 places in 321 ms of which 1 ms to minimize.
[2023-03-20 01:30:13] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 1 ms to minimize.
[2023-03-20 01:30:14] [INFO ] Deduced a trap composed of 34 places in 331 ms of which 2 ms to minimize.
[2023-03-20 01:30:14] [INFO ] Deduced a trap composed of 31 places in 433 ms of which 2 ms to minimize.
[2023-03-20 01:30:15] [INFO ] Deduced a trap composed of 25 places in 330 ms of which 3 ms to minimize.
[2023-03-20 01:30:15] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 24 ms to minimize.
[2023-03-20 01:30:15] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 1 ms to minimize.
[2023-03-20 01:30:16] [INFO ] Deduced a trap composed of 23 places in 472 ms of which 2 ms to minimize.
[2023-03-20 01:30:16] [INFO ] Deduced a trap composed of 24 places in 381 ms of which 2 ms to minimize.
[2023-03-20 01:30:17] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 0 ms to minimize.
[2023-03-20 01:30:17] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 1 ms to minimize.
[2023-03-20 01:30:18] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 1 ms to minimize.
[2023-03-20 01:30:18] [INFO ] Deduced a trap composed of 28 places in 327 ms of which 0 ms to minimize.
[2023-03-20 01:30:18] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2023-03-20 01:30:19] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 1 ms to minimize.
[2023-03-20 01:30:19] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 0 ms to minimize.
[2023-03-20 01:30:19] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 1 ms to minimize.
[2023-03-20 01:30:20] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 0 ms to minimize.
[2023-03-20 01:30:20] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 1 ms to minimize.
[2023-03-20 01:30:20] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 1 ms to minimize.
[2023-03-20 01:30:21] [INFO ] Deduced a trap composed of 20 places in 346 ms of which 2 ms to minimize.
[2023-03-20 01:30:21] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 0 ms to minimize.
[2023-03-20 01:30:22] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 1 ms to minimize.
[2023-03-20 01:30:22] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 1 ms to minimize.
[2023-03-20 01:30:22] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 1 ms to minimize.
[2023-03-20 01:30:23] [INFO ] Deduced a trap composed of 26 places in 381 ms of which 1 ms to minimize.
[2023-03-20 01:30:23] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 1 ms to minimize.
[2023-03-20 01:30:24] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 2 ms to minimize.
[2023-03-20 01:30:24] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 1 ms to minimize.
[2023-03-20 01:30:24] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 1 ms to minimize.
[2023-03-20 01:30:25] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 0 ms to minimize.
[2023-03-20 01:30:25] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 1 ms to minimize.
[2023-03-20 01:30:25] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2023-03-20 01:30:26] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 1 ms to minimize.
[2023-03-20 01:30:26] [INFO ] Deduced a trap composed of 26 places in 417 ms of which 48 ms to minimize.
[2023-03-20 01:30:27] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 12 ms to minimize.
[2023-03-20 01:30:27] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 1 ms to minimize.
[2023-03-20 01:30:27] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 1 ms to minimize.
[2023-03-20 01:30:28] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 1 ms to minimize.
[2023-03-20 01:30:28] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 1 ms to minimize.
[2023-03-20 01:30:29] [INFO ] Deduced a trap composed of 16 places in 796 ms of which 2 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-20 01:30:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:30:29] [INFO ] After 25831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 78 ms.
Support contains 99 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1363 transition count 1143
Reduce places removed 120 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 127 rules applied. Total rules applied 247 place count 1243 transition count 1136
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 254 place count 1236 transition count 1136
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 254 place count 1236 transition count 1040
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 446 place count 1140 transition count 1040
Discarding 126 places :
Symmetric choice reduction at 3 with 126 rule applications. Total rules 572 place count 1014 transition count 914
Iterating global reduction 3 with 126 rules applied. Total rules applied 698 place count 1014 transition count 914
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 698 place count 1014 transition count 874
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 778 place count 974 transition count 874
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 256
Deduced a syphon composed of 256 places in 0 ms
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 3 with 512 rules applied. Total rules applied 1290 place count 718 transition count 618
Partial Free-agglomeration rule applied 151 times.
Drop transitions removed 151 transitions
Iterating global reduction 3 with 151 rules applied. Total rules applied 1441 place count 718 transition count 618
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1442 place count 717 transition count 617
Applied a total of 1442 rules in 423 ms. Remains 717 /1363 variables (removed 646) and now considering 617/1263 (removed 646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 ms. Remains : 717/1363 places, 617/1263 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 617 rows 717 cols
[2023-03-20 01:30:30] [INFO ] Computed 221 place invariants in 20 ms
[2023-03-20 01:30:30] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:30:30] [INFO ] [Nat]Absence check using 215 positive place invariants in 77 ms returned sat
[2023-03-20 01:30:30] [INFO ] [Nat]Absence check using 215 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:30:31] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:30:31] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-20 01:30:31] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-20 01:30:32] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:30:32] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2023-03-20 01:30:32] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-20 01:30:33] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2023-03-20 01:30:33] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2023-03-20 01:30:33] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 3 ms to minimize.
[2023-03-20 01:30:33] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2023-03-20 01:30:34] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 1 ms to minimize.
[2023-03-20 01:30:34] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:30:34] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
[2023-03-20 01:30:34] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2023-03-20 01:30:35] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-20 01:30:35] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2023-03-20 01:30:35] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2023-03-20 01:30:35] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-20 01:30:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4219 ms
[2023-03-20 01:30:35] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:30:36] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-20 01:30:36] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:30:36] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2023-03-20 01:30:36] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-20 01:30:36] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 01:30:37] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2023-03-20 01:30:37] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-20 01:30:37] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2023-03-20 01:30:37] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-20 01:30:37] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-20 01:30:38] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 0 ms to minimize.
[2023-03-20 01:30:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2389 ms
[2023-03-20 01:30:38] [INFO ] After 7604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 475 ms.
[2023-03-20 01:30:38] [INFO ] After 8307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 81 ms.
Support contains 53 out of 717 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 717/717 places, 617/617 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 717 transition count 613
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 713 transition count 613
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 8 place count 713 transition count 603
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 703 transition count 603
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 82 place count 676 transition count 576
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 676 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 675 transition count 575
Applied a total of 90 rules in 99 ms. Remains 675 /717 variables (removed 42) and now considering 575/617 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 675/717 places, 575/617 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 251457 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{0=1}
Probabilistic random walk after 251457 steps, saw 77799 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :1
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 575 rows 675 cols
[2023-03-20 01:30:42] [INFO ] Computed 221 place invariants in 17 ms
[2023-03-20 01:30:42] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:30:42] [INFO ] [Nat]Absence check using 214 positive place invariants in 42 ms returned sat
[2023-03-20 01:30:42] [INFO ] [Nat]Absence check using 214 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-20 01:30:42] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:30:43] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2023-03-20 01:30:43] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:30:43] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:30:43] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2023-03-20 01:30:44] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 0 ms to minimize.
[2023-03-20 01:30:44] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-20 01:30:44] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-20 01:30:44] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-20 01:30:44] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:30:44] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2023-03-20 01:30:45] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 0 ms to minimize.
[2023-03-20 01:30:45] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-20 01:30:45] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-20 01:30:45] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-20 01:30:46] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 0 ms to minimize.
[2023-03-20 01:30:46] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2023-03-20 01:30:46] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:30:46] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3670 ms
[2023-03-20 01:30:46] [INFO ] After 4080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 01:30:46] [INFO ] After 4320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 15 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 575/575 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 675 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 674 transition count 574
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 674 transition count 569
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 669 transition count 569
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 72 place count 639 transition count 539
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 85 place count 639 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 638 transition count 538
Applied a total of 86 rules in 87 ms. Remains 638 /675 variables (removed 37) and now considering 538/575 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 638/675 places, 538/575 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 334083 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334083 steps, saw 264003 distinct states, run finished after 3003 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 538 rows 638 cols
[2023-03-20 01:30:49] [INFO ] Computed 221 place invariants in 20 ms
[2023-03-20 01:30:49] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:30:50] [INFO ] [Nat]Absence check using 205 positive place invariants in 33 ms returned sat
[2023-03-20 01:30:50] [INFO ] [Nat]Absence check using 205 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-20 01:30:50] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:30:50] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2023-03-20 01:30:50] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2023-03-20 01:30:51] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-20 01:30:51] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-20 01:30:51] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 26 ms to minimize.
[2023-03-20 01:30:51] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-20 01:30:51] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-20 01:30:51] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-20 01:30:51] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2023-03-20 01:30:52] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-03-20 01:30:52] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2023-03-20 01:30:52] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-20 01:30:52] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2023-03-20 01:30:52] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:30:52] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 15 ms to minimize.
[2023-03-20 01:30:52] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 10 ms to minimize.
[2023-03-20 01:30:53] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-20 01:30:53] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-20 01:30:53] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2023-03-20 01:30:53] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2023-03-20 01:30:53] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2023-03-20 01:30:53] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2023-03-20 01:30:53] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-20 01:30:54] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-20 01:30:54] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2023-03-20 01:30:54] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-20 01:30:54] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-20 01:30:54] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-20 01:30:54] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4294 ms
[2023-03-20 01:30:54] [INFO ] After 4616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-20 01:30:54] [INFO ] After 4851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 15 out of 638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 47 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 638/638 places, 538/538 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 27 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2023-03-20 01:30:54] [INFO ] Invariant cache hit.
[2023-03-20 01:30:55] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-20 01:30:55] [INFO ] Invariant cache hit.
[2023-03-20 01:30:56] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-03-20 01:30:56] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-20 01:30:56] [INFO ] Invariant cache hit.
[2023-03-20 01:30:56] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1616 ms. Remains : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 15 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 01:30:56] [INFO ] Invariant cache hit.
[2023-03-20 01:30:56] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:30:56] [INFO ] [Nat]Absence check using 205 positive place invariants in 34 ms returned sat
[2023-03-20 01:30:56] [INFO ] [Nat]Absence check using 205 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-20 01:30:56] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:30:57] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-20 01:30:57] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2023-03-20 01:30:57] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-20 01:30:57] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:30:57] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-20 01:30:57] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2023-03-20 01:30:58] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2023-03-20 01:30:58] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2023-03-20 01:30:58] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-20 01:30:58] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-20 01:30:58] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-20 01:30:58] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:30:59] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-20 01:30:59] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-20 01:30:59] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-20 01:30:59] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2023-03-20 01:30:59] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:30:59] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2757 ms
[2023-03-20 01:30:59] [INFO ] After 3033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-20 01:30:59] [INFO ] After 3248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:30:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-20 01:30:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 638 places, 538 transitions and 2333 arcs took 8 ms.
[2023-03-20 01:31:00] [INFO ] Flatten gal took : 122 ms
Total runtime 58159 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-020B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679275860690

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.xml
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 # 8 (type EXCL) for 0 ShieldPPPs-PT-020B-ReachabilityFireability-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 ShieldPPPs-PT-020B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 ShieldPPPs-PT-020B-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: LAUNCH task # 7 (type SRCH) for 0 ShieldPPPs-PT-020B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for ShieldPPPs-PT-020B-ReachabilityFireability-14
lola: result : false
lola: markings : 75
lola: fired transitions : 102
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 5 (type EQUN) for ShieldPPPs-PT-020B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 8 (type EXCL) for ShieldPPPs-PT-020B-ReachabilityFireability-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-020B-ReachabilityFireability-14: AG true tandem / insertion


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="ShieldPPPs-PT-020B"
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 ShieldPPPs-PT-020B, 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-167903715300463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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