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.r408-oct2-167903726900097.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 marciexred
Input is ShieldIIPs-PT-050B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-oct2-167903726900097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 846K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679766643796

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=marciexred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-25 17:50:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-25 17:50:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 17:50:46] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2023-03-25 17:50:47] [INFO ] Transformed 3003 places.
[2023-03-25 17:50:47] [INFO ] Transformed 2953 transitions.
[2023-03-25 17:50:47] [INFO ] Found NUPN structural information;
[2023-03-25 17:50:47] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 511 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 3003 transition count 2702
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2752 transition count 2702
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2752 transition count 2451
Deduced a syphon composed of 251 places in 70 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2501 transition count 2451
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 1200
Deduced a syphon composed of 1200 places in 5 ms
Reduce places removed 1200 places and 0 transitions.
Iterating global reduction 2 with 2400 rules applied. Total rules applied 3404 place count 1301 transition count 1251
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3404 rules in 597 ms. Remains 1301 /3003 variables (removed 1702) and now considering 1251/2953 (removed 1702) transitions.
// Phase 1: matrix 1251 rows 1301 cols
[2023-03-25 17:50:47] [INFO ] Computed 451 place invariants in 41 ms
[2023-03-25 17:50:50] [INFO ] Implicit Places using invariants in 2694 ms returned []
[2023-03-25 17:50:50] [INFO ] Invariant cache hit.
[2023-03-25 17:50:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-25 17:50:52] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned [1286]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5313 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1300/3003 places, 1251/2953 transitions.
Applied a total of 0 rules in 46 ms. Remains 1300 /1300 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 5959 ms. Remains : 1300/3003 places, 1251/2953 transitions.
Discarding 300 transitions out of 1251. Remains 951
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 802 ms. (steps per millisecond=12 ) properties (out of 950) seen :892
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Running SMT prover for 58 properties.
// Phase 1: matrix 1251 rows 1300 cols
[2023-03-25 17:50:54] [INFO ] Computed 450 place invariants in 6 ms
[2023-03-25 17:50:56] [INFO ] [Real]Absence check using 450 positive place invariants in 201 ms returned sat
[2023-03-25 17:51:06] [INFO ] After 11899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:58
[2023-03-25 17:51:09] [INFO ] [Nat]Absence check using 450 positive place invariants in 119 ms returned sat
[2023-03-25 17:51:20] [INFO ] After 9424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :58
[2023-03-25 17:51:21] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 26 ms to minimize.
[2023-03-25 17:51:21] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-25 17:51:21] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-25 17:51:21] [INFO ] Deduced a trap composed of 11 places in 443 ms of which 1 ms to minimize.
[2023-03-25 17:51:22] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2023-03-25 17:51:22] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2023-03-25 17:51:22] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 8 ms to minimize.
[2023-03-25 17:51:22] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2023-03-25 17:51:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1933 ms
[2023-03-25 17:51:22] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-25 17:51:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-25 17:51:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2023-03-25 17:51:23] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2023-03-25 17:51:23] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2023-03-25 17:51:24] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 0 ms to minimize.
[2023-03-25 17:51:24] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2023-03-25 17:51:24] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 26 ms to minimize.
[2023-03-25 17:51:24] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2023-03-25 17:51:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1688 ms
[2023-03-25 17:51:25] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2023-03-25 17:51:25] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2023-03-25 17:51:25] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-03-25 17:51:26] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-25 17:51:26] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-25 17:51:26] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-25 17:51:26] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2023-03-25 17:51:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1628 ms
[2023-03-25 17:51:27] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-25 17:51:28] [INFO ] Deduced a trap composed of 11 places in 601 ms of which 5 ms to minimize.
[2023-03-25 17:51:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 904 ms
[2023-03-25 17:51:28] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2023-03-25 17:51:29] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2023-03-25 17:51:29] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-25 17:51:29] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 14 ms to minimize.
[2023-03-25 17:51:29] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-25 17:51:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1375 ms
[2023-03-25 17:51:30] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2023-03-25 17:51:30] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2023-03-25 17:51:30] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-25 17:51:30] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 4 ms to minimize.
[2023-03-25 17:51:31] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2023-03-25 17:51:31] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-25 17:51:31] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2023-03-25 17:51:31] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-25 17:51:32] [INFO ] Deduced a trap composed of 3 places in 772 ms of which 1 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-25 17:51:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-25 17:51:32] [INFO ] After 25793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:58
Parikh walk visited 34 properties in 30719 ms.
Support contains 68 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1251/1251 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1250 transition count 1201
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1250 transition count 1201
Partial Free-agglomeration rule applied 305 times.
Drop transitions removed 305 transitions
Iterating global reduction 0 with 305 rules applied. Total rules applied 405 place count 1250 transition count 1201
Applied a total of 405 rules in 243 ms. Remains 1250 /1300 variables (removed 50) and now considering 1201/1251 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 1250/1300 places, 1201/1251 transitions.
Finished random walk after 34930 steps, including 8 resets, run visited all 24 properties in 917 ms. (steps per millisecond=38 )
Able to resolve query QuasiLiveness after proving 951 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 77742 ms.
ITS solved all properties within timeout

BK_STOP 1679766724521

--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-050B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 marciexred"
echo " Input is ShieldIIPs-PT-050B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r408-oct2-167903726900097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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