Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976300158.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 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 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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 ShieldRVs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679243180558

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:26:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 16:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:26:23] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-19 16:26:23] [INFO ] Transformed 2003 places.
[2023-03-19 16:26:23] [INFO ] Transformed 2253 transitions.
[2023-03-19 16:26:23] [INFO ] Found NUPN structural information;
[2023-03-19 16:26:23] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 14) seen :7
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2023-03-19 16:26:25] [INFO ] Computed 201 place invariants in 54 ms
[2023-03-19 16:26:26] [INFO ] After 1115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 16:26:27] [INFO ] [Nat]Absence check using 201 positive place invariants in 117 ms returned sat
[2023-03-19 16:26:31] [INFO ] After 3659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 16:26:32] [INFO ] Deduced a trap composed of 25 places in 917 ms of which 12 ms to minimize.
[2023-03-19 16:26:33] [INFO ] Deduced a trap composed of 19 places in 855 ms of which 2 ms to minimize.
[2023-03-19 16:26:34] [INFO ] Deduced a trap composed of 27 places in 615 ms of which 2 ms to minimize.
[2023-03-19 16:26:35] [INFO ] Deduced a trap composed of 20 places in 1065 ms of which 1 ms to minimize.
[2023-03-19 16:26:36] [INFO ] Deduced a trap composed of 22 places in 775 ms of which 14 ms to minimize.
[2023-03-19 16:26:37] [INFO ] Deduced a trap composed of 20 places in 895 ms of which 2 ms to minimize.
[2023-03-19 16:26:38] [INFO ] Deduced a trap composed of 33 places in 621 ms of which 2 ms to minimize.
[2023-03-19 16:26:39] [INFO ] Deduced a trap composed of 37 places in 716 ms of which 2 ms to minimize.
[2023-03-19 16:26:39] [INFO ] Deduced a trap composed of 27 places in 734 ms of which 1 ms to minimize.
[2023-03-19 16:26:40] [INFO ] Deduced a trap composed of 26 places in 684 ms of which 2 ms to minimize.
[2023-03-19 16:26:41] [INFO ] Deduced a trap composed of 24 places in 664 ms of which 2 ms to minimize.
[2023-03-19 16:26:42] [INFO ] Deduced a trap composed of 22 places in 672 ms of which 2 ms to minimize.
[2023-03-19 16:26:42] [INFO ] Deduced a trap composed of 23 places in 656 ms of which 2 ms to minimize.
[2023-03-19 16:26:43] [INFO ] Deduced a trap composed of 26 places in 684 ms of which 2 ms to minimize.
[2023-03-19 16:26:44] [INFO ] Deduced a trap composed of 24 places in 662 ms of which 1 ms to minimize.
[2023-03-19 16:26:45] [INFO ] Deduced a trap composed of 27 places in 661 ms of which 1 ms to minimize.
[2023-03-19 16:26:46] [INFO ] Deduced a trap composed of 25 places in 769 ms of which 1 ms to minimize.
[2023-03-19 16:26:46] [INFO ] Deduced a trap composed of 34 places in 616 ms of which 1 ms to minimize.
[2023-03-19 16:26:47] [INFO ] Deduced a trap composed of 25 places in 570 ms of which 1 ms to minimize.
[2023-03-19 16:26:48] [INFO ] Deduced a trap composed of 21 places in 777 ms of which 1 ms to minimize.
[2023-03-19 16:26:49] [INFO ] Deduced a trap composed of 39 places in 616 ms of which 1 ms to minimize.
[2023-03-19 16:26:49] [INFO ] Deduced a trap composed of 34 places in 655 ms of which 2 ms to minimize.
[2023-03-19 16:26:50] [INFO ] Deduced a trap composed of 30 places in 718 ms of which 1 ms to minimize.
[2023-03-19 16:26:51] [INFO ] Deduced a trap composed of 35 places in 755 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-19 16:26:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:26:51] [INFO ] After 25383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 868 ms.
Support contains 82 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 2003 transition count 2075
Reduce places removed 178 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 188 rules applied. Total rules applied 366 place count 1825 transition count 2065
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 376 place count 1815 transition count 2065
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 376 place count 1815 transition count 1817
Deduced a syphon composed of 248 places in 4 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 872 place count 1567 transition count 1817
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 1187 place count 1252 transition count 1502
Iterating global reduction 3 with 315 rules applied. Total rules applied 1502 place count 1252 transition count 1502
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 1502 place count 1252 transition count 1378
Deduced a syphon composed of 124 places in 5 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 1750 place count 1128 transition count 1378
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 4 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2426 place count 790 transition count 1040
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 3 with 88 rules applied. Total rules applied 2514 place count 790 transition count 1040
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2515 place count 789 transition count 1039
Applied a total of 2515 rules in 828 ms. Remains 789 /2003 variables (removed 1214) and now considering 1039/2253 (removed 1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 830 ms. Remains : 789/2003 places, 1039/2253 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1039 rows 789 cols
[2023-03-19 16:26:54] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-19 16:26:54] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 16:26:54] [INFO ] [Nat]Absence check using 201 positive place invariants in 59 ms returned sat
[2023-03-19 16:26:55] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 16:26:55] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 0 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-19 16:26:57] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 6 ms to minimize.
[2023-03-19 16:26:57] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-19 16:26:57] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2023-03-19 16:26:57] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 5 ms to minimize.
[2023-03-19 16:26:58] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-19 16:26:58] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2023-03-19 16:26:58] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:26:58] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2023-03-19 16:26:58] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2023-03-19 16:26:58] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:27:00] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:27:00] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:27:00] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:27:00] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:27:00] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:27:00] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-19 16:27:01] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:27:01] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-19 16:27:01] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 11 ms to minimize.
[2023-03-19 16:27:01] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:27:01] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5799 ms
[2023-03-19 16:27:01] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:27:01] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2023-03-19 16:27:02] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2023-03-19 16:27:02] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-19 16:27:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 687 ms
[2023-03-19 16:27:02] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2023-03-19 16:27:02] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 0 ms to minimize.
[2023-03-19 16:27:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2023-03-19 16:27:02] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:27:03] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:27:03] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2023-03-19 16:27:03] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:27:03] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2023-03-19 16:27:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 821 ms
[2023-03-19 16:27:03] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 8 ms to minimize.
[2023-03-19 16:27:04] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-19 16:27:04] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-19 16:27:04] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2023-03-19 16:27:04] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:27:04] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-19 16:27:04] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:27:05] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:27:05] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2023-03-19 16:27:05] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2023-03-19 16:27:05] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 0 ms to minimize.
[2023-03-19 16:27:06] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:27:06] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-19 16:27:06] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2023-03-19 16:27:06] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3006 ms
[2023-03-19 16:27:06] [INFO ] After 11773ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-19 16:27:06] [INFO ] After 12339ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 31 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1039/1039 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 789 transition count 1034
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 784 transition count 1034
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 784 transition count 1025
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 28 place count 775 transition count 1025
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 6 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 98 place count 740 transition count 990
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 111 place count 740 transition count 990
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 734 transition count 984
Applied a total of 117 rules in 171 ms. Remains 734 /789 variables (removed 55) and now considering 984/1039 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 734/789 places, 984/1039 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 984 rows 734 cols
[2023-03-19 16:27:07] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-19 16:27:07] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 16:27:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-19 16:27:08] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 16:27:08] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:27:08] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1896 ms
[2023-03-19 16:27:10] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-19 16:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 0 ms to minimize.
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-19 16:27:14] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-19 16:27:14] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2882 ms
[2023-03-19 16:27:14] [INFO ] After 6085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-19 16:27:14] [INFO ] After 6552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 138 ms.
Support contains 27 out of 734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 734/734 places, 984/984 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 730 transition count 980
Applied a total of 8 rules in 69 ms. Remains 730 /734 variables (removed 4) and now considering 980/984 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 730/734 places, 980/984 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 148182 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{0=1, 3=1}
Probabilistic random walk after 148182 steps, saw 72416 distinct states, run finished after 3015 ms. (steps per millisecond=49 ) properties seen :2
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 980 rows 730 cols
[2023-03-19 16:27:18] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-19 16:27:18] [INFO ] [Real]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-19 16:27:18] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:27:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 282 ms returned sat
[2023-03-19 16:27:25] [INFO ] After 6684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:26] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-19 16:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-19 16:27:26] [INFO ] After 7007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-19 16:27:26] [INFO ] After 7700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 730 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 730/730 places, 980/980 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 730 transition count 978
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 728 transition count 978
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 728 transition count 977
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 727 transition count 977
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 712 transition count 962
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 712 transition count 962
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 711 transition count 961
Applied a total of 38 rules in 110 ms. Remains 711 /730 variables (removed 19) and now considering 961/980 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 711/730 places, 961/980 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 124923 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124923 steps, saw 122392 distinct states, run finished after 3014 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 711 cols
[2023-03-19 16:27:29] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-19 16:27:29] [INFO ] [Real]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-19 16:27:30] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:27:30] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2023-03-19 16:27:30] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2023-03-19 16:27:31] [INFO ] After 895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-19 16:27:31] [INFO ] After 1178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 8 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 961/961 transitions.
Applied a total of 0 rules in 26 ms. Remains 711 /711 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 711/711 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 961/961 transitions.
Applied a total of 0 rules in 44 ms. Remains 711 /711 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-19 16:27:31] [INFO ] Invariant cache hit.
[2023-03-19 16:27:36] [INFO ] Implicit Places using invariants in 5158 ms returned []
[2023-03-19 16:27:36] [INFO ] Invariant cache hit.
[2023-03-19 16:27:37] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 6010 ms to find 0 implicit places.
[2023-03-19 16:27:37] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-19 16:27:37] [INFO ] Invariant cache hit.
[2023-03-19 16:27:38] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6637 ms. Remains : 711/711 places, 961/961 transitions.
Applied a total of 0 rules in 23 ms. Remains 711 /711 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 16:27:38] [INFO ] Invariant cache hit.
[2023-03-19 16:27:38] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-19 16:27:38] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:27:38] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-19 16:27:39] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:39] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-19 16:27:39] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-19 16:27:39] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-19 16:27:39] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-19 16:27:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 668 ms
[2023-03-19 16:27:39] [INFO ] After 1016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-19 16:27:40] [INFO ] After 1199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-19 16:27:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 711 places, 961 transitions and 4674 arcs took 7 ms.
[2023-03-19 16:27:40] [INFO ] Flatten gal took : 168 ms
Total runtime 77080 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-050B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
ReachabilityCardinality

FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679243261080

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/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/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k: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 # 10 (type EXCL) for 0 ShieldRVs-PT-050B-ReachabilityCardinality-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 ShieldRVs-PT-050B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 ShieldRVs-PT-050B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 0 ShieldRVs-PT-050B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 9 (type SRCH) for ShieldRVs-PT-050B-ReachabilityCardinality-07
lola: result : true
lola: markings : 67
lola: fired transitions : 66
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for ShieldRVs-PT-050B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 7 (type EQUN) for ShieldRVs-PT-050B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 10 (type EXCL) for ShieldRVs-PT-050B-ReachabilityCardinality-07 (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 # 16 (type EXCL) for 3 ShieldRVs-PT-050B-ReachabilityCardinality-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 ShieldRVs-PT-050B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 ShieldRVs-PT-050B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 ShieldRVs-PT-050B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type FNDP) for ShieldRVs-PT-050B-ReachabilityCardinality-07
lola: result : unknown
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for ShieldRVs-PT-050B-ReachabilityCardinality-10
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for ShieldRVs-PT-050B-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 13 (type EQUN) for ShieldRVs-PT-050B-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldRVs-PT-050B-ReachabilityCardinality-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-050B-ReachabilityCardinality-07: EF true tandem / insertion
ShieldRVs-PT-050B-ReachabilityCardinality-10: EF false tandem / insertion


Time elapsed: 1 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="ShieldRVs-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldRVs-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976300158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;