Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788500104.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPs-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788500104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 868K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716948104213

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 02:01:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 02:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:01:46] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-29 02:01:46] [INFO ] Transformed 2503 places.
[2024-05-29 02:01:46] [INFO ] Transformed 2403 transitions.
[2024-05-29 02:01:46] [INFO ] Found NUPN structural information;
[2024-05-29 02:01:46] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 14) seen :8
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:01:48] [INFO ] Computed 901 invariants in 36 ms
[2024-05-29 02:01:49] [INFO ] After 973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 02:01:50] [INFO ] [Nat]Absence check using 901 positive place invariants in 360 ms returned sat
[2024-05-29 02:02:13] [INFO ] After 22552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 02:02:13] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 9 ms to minimize.
[2024-05-29 02:02:14] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2024-05-29 02:02:14] [INFO ] Deduced a trap composed of 11 places in 93 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 02:02:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:02:14] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 2130 ms.
Support contains 128 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 41 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 622 times.
Drop transitions removed 622 transitions
Iterating global reduction 0 with 622 rules applied. Total rules applied 626 place count 2501 transition count 2401
Applied a total of 626 rules in 622 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 6) seen :1
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:02:18] [INFO ] Computed 901 invariants in 157 ms
[2024-05-29 02:02:18] [INFO ] After 622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 02:02:19] [INFO ] [Nat]Absence check using 880 positive place invariants in 178 ms returned sat
[2024-05-29 02:02:19] [INFO ] [Nat]Absence check using 880 positive and 21 generalized place invariants in 9 ms returned sat
[2024-05-29 02:02:43] [INFO ] After 24015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 02:02:43] [INFO ] State equation strengthened by 4 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 02:02:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:02:43] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 667 ms.
Support contains 85 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 2501 transition count 2401
Applied a total of 34 rules in 192 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 78104 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78104 steps, saw 75219 distinct states, run finished after 3007 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:02:48] [INFO ] Computed 901 invariants in 39 ms
[2024-05-29 02:02:49] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 02:02:50] [INFO ] [Nat]Absence check using 891 positive place invariants in 194 ms returned sat
[2024-05-29 02:02:50] [INFO ] [Nat]Absence check using 891 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-29 02:03:14] [INFO ] After 23985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 02:03:14] [INFO ] State equation strengthened by 4 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 02:03:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:03:14] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 386 ms.
Support contains 85 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 130 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 159 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:03:15] [INFO ] Invariant cache hit.
[2024-05-29 02:03:17] [INFO ] Implicit Places using invariants in 2714 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2733 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 121 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3015 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 74423 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74423 steps, saw 71642 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:03:22] [INFO ] Computed 900 invariants in 25 ms
[2024-05-29 02:03:22] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 02:03:23] [INFO ] [Nat]Absence check using 890 positive place invariants in 177 ms returned sat
[2024-05-29 02:03:23] [INFO ] [Nat]Absence check using 890 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-29 02:03:47] [INFO ] After 24130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 02:03:47] [INFO ] After 24138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 02:03:47] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 515 ms.
Support contains 85 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 101 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 135 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:03:48] [INFO ] Invariant cache hit.
[2024-05-29 02:03:50] [INFO ] Implicit Places using invariants in 1768 ms returned []
[2024-05-29 02:03:50] [INFO ] Invariant cache hit.
[2024-05-29 02:03:55] [INFO ] Implicit Places using invariants and state equation in 5096 ms returned []
Implicit Place search using SMT with State Equation took 6867 ms to find 0 implicit places.
[2024-05-29 02:03:55] [INFO ] Redundant transitions in 243 ms returned []
[2024-05-29 02:03:55] [INFO ] Invariant cache hit.
[2024-05-29 02:03:57] [INFO ] Dead Transitions using invariants and state equation in 1538 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8809 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 02:03:57] [INFO ] Invariant cache hit.
[2024-05-29 02:03:57] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 02:03:58] [INFO ] [Nat]Absence check using 890 positive place invariants in 187 ms returned sat
[2024-05-29 02:03:58] [INFO ] [Nat]Absence check using 890 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-29 02:04:27] [INFO ] After 28350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 02:04:28] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2024-05-29 02:04:28] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2024-05-29 02:04:28] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2024-05-29 02:04:28] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2024-05-29 02:04:29] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2024-05-29 02:04:29] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2024-05-29 02:04:29] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2024-05-29 02:04:29] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 02:04:30] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 02:04:31] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2024-05-29 02:04:32] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2024-05-29 02:04:32] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 02:04:32] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2024-05-29 02:04:32] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2024-05-29 02:04:33] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2024-05-29 02:04:33] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-05-29 02:04:33] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:04:33] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 02:04:35] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2024-05-29 02:04:36] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-29 02:04:36] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2024-05-29 02:04:36] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2024-05-29 02:04:36] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2024-05-29 02:04:37] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2024-05-29 02:04:37] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-05-29 02:04:37] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2024-05-29 02:04:37] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-29 02:04:38] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2024-05-29 02:04:38] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2024-05-29 02:04:38] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 02:04:38] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 4 ms to minimize.
[2024-05-29 02:04:38] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2024-05-29 02:04:39] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2024-05-29 02:04:39] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:04:39] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:04:39] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2024-05-29 02:04:39] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-29 02:04:40] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 14284 ms
[2024-05-29 02:04:46] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2024-05-29 02:04:47] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2024-05-29 02:04:47] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 1 ms to minimize.
[2024-05-29 02:04:47] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 2 ms to minimize.
[2024-05-29 02:04:48] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2024-05-29 02:04:48] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2024-05-29 02:04:48] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2024-05-29 02:04:49] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2024-05-29 02:04:49] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2024-05-29 02:04:49] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2024-05-29 02:04:50] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 02:04:50] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2024-05-29 02:04:50] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2024-05-29 02:04:51] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 02:04:51] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2024-05-29 02:04:51] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 02:04:52] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 02:04:52] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-05-29 02:04:52] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-29 02:04:52] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2024-05-29 02:04:53] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-29 02:04:53] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
[2024-05-29 02:04:53] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6953 ms
[2024-05-29 02:04:55] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2024-05-29 02:04:55] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2024-05-29 02:04:56] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-29 02:04:56] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-05-29 02:04:56] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2024-05-29 02:04:56] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2024-05-29 02:04:57] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2024-05-29 02:04:57] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2024-05-29 02:05:01] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2024-05-29 02:05:01] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2024-05-29 02:05:01] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2024-05-29 02:05:01] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:05:02] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:05:02] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 02:05:02] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-29 02:05:02] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:05:02] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:05:03] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:05:03] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2024-05-29 02:05:03] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2024-05-29 02:05:03] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8216 ms
[2024-05-29 02:05:03] [INFO ] After 64765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7596 ms.
[2024-05-29 02:05:11] [INFO ] After 73331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-29 02:05:11] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-29 02:05:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12191 arcs took 15 ms.
[2024-05-29 02:05:12] [INFO ] Flatten gal took : 549 ms
Total runtime 206097 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100A
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/360
ReachabilityCardinality

FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716948320721

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/360/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/360/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/360/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: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 20 (type EXCL) for 6 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 6 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 6 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: LAUNCH task # 19 (type SRCH) for 6 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 19 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
lola: result : true
lola: markings : 207
lola: fired transitions : 206
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 20 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09 (obsolete)
lola: LAUNCH task # 26 (type EXCL) for 12 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
lola: time limit : 898 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 12 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 12 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 12 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k: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: 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: FINISHED task # 25 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
lola: result : true
lola: markings : 201
lola: fired transitions : 200
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 22 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 23 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 26 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13 (obsolete)
lola: LAUNCH task # 37 (type EXCL) for 0 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02
lola: time limit : 1197 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 29 (type FNDP) for 3 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type EQUN) for 3 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 39 (type SRCH) for 3 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 16 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
lola: result : true
lola: fired transitions : 205
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 22 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
lola: result : true
lola: fired transitions : 199
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 29 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04
lola: result : true
lola: fired transitions : 192
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 31 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04 (obsolete)
lola: CANCELED task # 39 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04 (obsolete)
lola: LAUNCH task # 33 (type FNDP) for 0 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 0 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 0 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 33 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02
lola: result : true
lola: fired transitions : 184
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 34 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 36 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 37 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02 (obsolete)
sara: try reading problem file /home/mcc/execution/360/ReachabilityCardinality-23.sara.
sara: try reading problem file /home/mcc/execution/360/ReachabilityCardinality-17.sara.
sara: try reading problem file /home/mcc/execution/360/ReachabilityCardinality-34.sara.
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 # 46 (type EXCL) for 9 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10
lola: time limit : 3593 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 42 (type FNDP) for 9 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type EQUN) for 9 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type SRCH) for 9 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 42 (type FNDP) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10
lola: result : true
lola: fired transitions : 220
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 43 (type EQUN) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 45 (type SRCH) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 46 (type EXCL) for ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02: AG false findpath
ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04: AG false findpath
ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09: AG false tandem / insertion
ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10: EF true findpath
ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13: EF true tandem / insertion


Time elapsed: 7 secs. Pages in use: 3

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100A"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPs-PT-100A, 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 r373-tall-171683788500104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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