About the Execution of 2023-gold for ShieldIIPt-PT-050B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
740.396 | 66878.00 | 89437.00 | 1037.10 | FTFFTTTTFFFFTTFT | normal |
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-171683788800209.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 ShieldIIPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788800209
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 860K 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 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716957521357
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=ShieldIIPt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 04:38:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 04:38:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:38:43] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-29 04:38:43] [INFO ] Transformed 3503 places.
[2024-05-29 04:38:43] [INFO ] Transformed 3253 transitions.
[2024-05-29 04:38:43] [INFO ] Found NUPN structural information;
[2024-05-29 04:38:43] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 14) seen :8
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2024-05-29 04:38:44] [INFO ] Computed 451 invariants in 43 ms
[2024-05-29 04:38:45] [INFO ] After 1134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 04:38:46] [INFO ] [Nat]Absence check using 451 positive place invariants in 197 ms returned sat
[2024-05-29 04:38:53] [INFO ] After 6982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 04:38:57] [INFO ] Deduced a trap composed of 13 places in 2123 ms of which 12 ms to minimize.
[2024-05-29 04:38:58] [INFO ] Deduced a trap composed of 13 places in 1154 ms of which 2 ms to minimize.
[2024-05-29 04:39:00] [INFO ] Deduced a trap composed of 18 places in 1209 ms of which 4 ms to minimize.
[2024-05-29 04:39:01] [INFO ] Deduced a trap composed of 12 places in 1193 ms of which 2 ms to minimize.
[2024-05-29 04:39:02] [INFO ] Deduced a trap composed of 20 places in 1166 ms of which 3 ms to minimize.
[2024-05-29 04:39:04] [INFO ] Deduced a trap composed of 25 places in 1255 ms of which 2 ms to minimize.
[2024-05-29 04:39:05] [INFO ] Deduced a trap composed of 18 places in 1267 ms of which 2 ms to minimize.
[2024-05-29 04:39:06] [INFO ] Deduced a trap composed of 19 places in 1241 ms of which 2 ms to minimize.
[2024-05-29 04:39:08] [INFO ] Deduced a trap composed of 21 places in 1229 ms of which 2 ms to minimize.
[2024-05-29 04:39:09] [INFO ] Deduced a trap composed of 14 places in 1166 ms of which 2 ms to minimize.
[2024-05-29 04:39:10] [INFO ] Deduced a trap composed of 20 places in 1088 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: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 04:39:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:39:10] [INFO ] After 25143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 928 ms.
Support contains 74 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 793 transitions
Trivial Post-agglo rules discarded 793 transitions
Performed 793 trivial Post agglomeration. Transition count delta: 793
Iterating post reduction 0 with 793 rules applied. Total rules applied 793 place count 3503 transition count 2460
Reduce places removed 793 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 795 rules applied. Total rules applied 1588 place count 2710 transition count 2458
Reduce places removed 1 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 19 rules applied. Total rules applied 1607 place count 2709 transition count 2440
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 1625 place count 2691 transition count 2440
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 1625 place count 2691 transition count 2234
Deduced a syphon composed of 206 places in 6 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 2037 place count 2485 transition count 2234
Discarding 334 places :
Symmetric choice reduction at 4 with 334 rule applications. Total rules 2371 place count 2151 transition count 1900
Iterating global reduction 4 with 334 rules applied. Total rules applied 2705 place count 2151 transition count 1900
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 140 Pre rules applied. Total rules applied 2705 place count 2151 transition count 1760
Deduced a syphon composed of 140 places in 13 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 2985 place count 2011 transition count 1760
Performed 817 Post agglomeration using F-continuation condition.Transition count delta: 817
Deduced a syphon composed of 817 places in 3 ms
Reduce places removed 817 places and 0 transitions.
Iterating global reduction 4 with 1634 rules applied. Total rules applied 4619 place count 1194 transition count 943
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4821 place count 1093 transition count 1000
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 4885 place count 1061 transition count 1020
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4886 place count 1061 transition count 1019
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 4894 place count 1061 transition count 1011
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 4902 place count 1053 transition count 1011
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 6 with 49 rules applied. Total rules applied 4951 place count 1053 transition count 1011
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4952 place count 1052 transition count 1010
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4954 place count 1050 transition count 1010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4954 place count 1050 transition count 1009
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4956 place count 1049 transition count 1009
Applied a total of 4956 rules in 1122 ms. Remains 1049 /3503 variables (removed 2454) and now considering 1009/3253 (removed 2244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1123 ms. Remains : 1049/3503 places, 1009/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 108973 steps, run timeout after 3008 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108973 steps, saw 74321 distinct states, run finished after 3020 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1009 rows 1049 cols
[2024-05-29 04:39:16] [INFO ] Computed 449 invariants in 13 ms
[2024-05-29 04:39:16] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:39:17] [INFO ] [Nat]Absence check using 449 positive place invariants in 80 ms returned sat
[2024-05-29 04:39:17] [INFO ] After 656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:39:17] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-05-29 04:39:18] [INFO ] After 457ms SMT Verify possible using 142 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 04:39:18] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2024-05-29 04:39:18] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2024-05-29 04:39:18] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 04:39:19] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2024-05-29 04:39:19] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-29 04:39:19] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-05-29 04:39:19] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 04:39:19] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2024-05-29 04:39:19] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2024-05-29 04:39:19] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2024-05-29 04:39:20] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 04:39:20] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 04:39:20] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2024-05-29 04:39:20] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2024-05-29 04:39:20] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 04:39:20] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2024-05-29 04:39:20] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2486 ms
[2024-05-29 04:39:21] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2024-05-29 04:39:21] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 04:39:21] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 04:39:21] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2024-05-29 04:39:21] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 04:39:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 637 ms
[2024-05-29 04:39:21] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2024-05-29 04:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-05-29 04:39:21] [INFO ] After 4174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 425 ms.
[2024-05-29 04:39:22] [INFO ] After 5609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 149 ms.
Support contains 74 out of 1049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1049/1049 places, 1009/1009 transitions.
Applied a total of 0 rules in 44 ms. Remains 1049 /1049 variables (removed 0) and now considering 1009/1009 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1049/1049 places, 1009/1009 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1049/1049 places, 1009/1009 transitions.
Applied a total of 0 rules in 27 ms. Remains 1049 /1049 variables (removed 0) and now considering 1009/1009 (removed 0) transitions.
[2024-05-29 04:39:22] [INFO ] Invariant cache hit.
[2024-05-29 04:39:23] [INFO ] Implicit Places using invariants in 566 ms returned [1037]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 570 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1048/1049 places, 1009/1009 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1047 transition count 1008
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1047 transition count 1008
Applied a total of 2 rules in 41 ms. Remains 1047 /1048 variables (removed 1) and now considering 1008/1009 (removed 1) transitions.
// Phase 1: matrix 1008 rows 1047 cols
[2024-05-29 04:39:23] [INFO ] Computed 448 invariants in 7 ms
[2024-05-29 04:39:23] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-29 04:39:23] [INFO ] Invariant cache hit.
[2024-05-29 04:39:24] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 04:39:26] [INFO ] Implicit Places using invariants and state equation in 2763 ms returned []
Implicit Place search using SMT with State Equation took 3354 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1047/1049 places, 1008/1009 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3993 ms. Remains : 1047/1049 places, 1008/1009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 118567 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118567 steps, saw 80867 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 04:39:30] [INFO ] Invariant cache hit.
[2024-05-29 04:39:30] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:39:30] [INFO ] [Nat]Absence check using 448 positive place invariants in 82 ms returned sat
[2024-05-29 04:39:31] [INFO ] After 654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:39:31] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 04:39:31] [INFO ] After 492ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 04:39:32] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2024-05-29 04:39:32] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 04:39:32] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2024-05-29 04:39:32] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2024-05-29 04:39:32] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-29 04:39:32] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-29 04:39:33] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-29 04:39:33] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 04:39:33] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-29 04:39:33] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2024-05-29 04:39:33] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2024-05-29 04:39:33] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-05-29 04:39:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1784 ms
[2024-05-29 04:39:34] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 04:39:34] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-29 04:39:34] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2024-05-29 04:39:34] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2024-05-29 04:39:34] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-05-29 04:39:34] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2024-05-29 04:39:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 823 ms
[2024-05-29 04:39:34] [INFO ] After 3586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 457 ms.
[2024-05-29 04:39:35] [INFO ] After 5044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 221 ms.
Support contains 74 out of 1047 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1008/1008 transitions.
Applied a total of 0 rules in 33 ms. Remains 1047 /1047 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1047/1047 places, 1008/1008 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1008/1008 transitions.
Applied a total of 0 rules in 23 ms. Remains 1047 /1047 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
[2024-05-29 04:39:35] [INFO ] Invariant cache hit.
[2024-05-29 04:39:36] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-29 04:39:36] [INFO ] Invariant cache hit.
[2024-05-29 04:39:36] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 04:39:39] [INFO ] Implicit Places using invariants and state equation in 3211 ms returned []
Implicit Place search using SMT with State Equation took 3756 ms to find 0 implicit places.
[2024-05-29 04:39:39] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-29 04:39:39] [INFO ] Invariant cache hit.
[2024-05-29 04:39:40] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4433 ms. Remains : 1047/1047 places, 1008/1008 transitions.
Partial Free-agglomeration rule applied 127 times.
Drop transitions removed 127 transitions
Iterating global reduction 0 with 127 rules applied. Total rules applied 127 place count 1047 transition count 1008
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 130 place count 1047 transition count 1005
Applied a total of 130 rules in 70 ms. Remains 1047 /1047 variables (removed 0) and now considering 1005/1008 (removed 3) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1005 rows 1047 cols
[2024-05-29 04:39:40] [INFO ] Computed 448 invariants in 5 ms
[2024-05-29 04:39:40] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:39:40] [INFO ] [Nat]Absence check using 448 positive place invariants in 79 ms returned sat
[2024-05-29 04:39:41] [INFO ] After 928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:39:41] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-29 04:39:42] [INFO ] After 447ms SMT Verify possible using 105 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 04:39:42] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-29 04:39:42] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-29 04:39:42] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 3 ms to minimize.
[2024-05-29 04:39:42] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 04:39:43] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2024-05-29 04:39:43] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2024-05-29 04:39:43] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 04:39:43] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2024-05-29 04:39:43] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 04:39:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1314 ms
[2024-05-29 04:39:43] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2024-05-29 04:39:43] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-29 04:39:44] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2024-05-29 04:39:44] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2024-05-29 04:39:44] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-29 04:39:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 699 ms
[2024-05-29 04:39:44] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 04:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-05-29 04:39:44] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2024-05-29 04:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-29 04:39:45] [INFO ] After 3308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 468 ms.
[2024-05-29 04:39:45] [INFO ] After 5065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-29 04:39:45] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 04:39:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1047 places, 1008 transitions and 4748 arcs took 8 ms.
[2024-05-29 04:39:45] [INFO ] Flatten gal took : 123 ms
Total runtime 62573 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-050B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
ReachabilityCardinality
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716957588235
--------------------
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/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/ReachabilityCardinality.xml
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: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 20 (type EXCL) for 9 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 9 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 9 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 9 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11
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: 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 # 19 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11
lola: result : true
lola: markings : 79
lola: fired transitions : 78
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 20 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11 (obsolete)
lola: LAUNCH task # 27 (type EXCL) for 0 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 23 (type FNDP) for 0 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type EQUN) for 0 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 26 (type SRCH) for 0 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 16 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11
lola: result : true
lola: fired transitions : 77
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 26 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00
lola: result : true
lola: markings : 108
lola: fired transitions : 107
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 23 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 24 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 27 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 23 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00
lola: result : true
lola: fired transitions : 106
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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 # 33 (type EXCL) for 6 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 29 (type FNDP) for 6 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type EQUN) for 6 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type SRCH) for 6 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 32 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06
lola: result : true
lola: markings : 33
lola: fired transitions : 32
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 29 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 30 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 33 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06 (obsolete)
sara: try reading problem file /home/mcc/execution/367/ReachabilityCardinality-17.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 40 (type EXCL) for 12 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 36 (type FNDP) for 12 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type EQUN) for 12 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 39 (type SRCH) for 12 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 29 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06
lola: result : true
lola: fired transitions : 31
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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 # 39 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14
lola: result : true
lola: markings : 42
lola: fired transitions : 41
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 36 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 37 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 40 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14 (obsolete)
lola: LAUNCH task # 47 (type EXCL) for 3 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 43 (type FNDP) for 3 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type EQUN) for 3 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type SRCH) for 3 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 36 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14
lola: result : unknown
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/367/ReachabilityCardinality-30.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 43 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02
lola: result : true
lola: fired transitions : 99
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 44 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 46 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 47 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00: AG false tandem / insertion
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02: AG false findpath
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06: EF true tandem / insertion
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11: AG false tandem / insertion
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14: AG false tandem / insertion
Time elapsed: 2 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="ShieldIIPt-PT-050B"
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 ShieldIIPt-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 r373-tall-171683788800209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-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 '
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 ;