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 |
| 800.063 | 137507.00 | 173927.00 | 2786.40 | TTTTTFFFTTTTFTFF | 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-171683788800210.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788800210
=====================================================================
--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716957597279
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=ReachabilityFireability
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:39:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 04:39:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:39:59] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-05-29 04:39:59] [INFO ] Transformed 3503 places.
[2024-05-29 04:39:59] [INFO ] Transformed 3253 transitions.
[2024-05-29 04:39:59] [INFO ] Found NUPN structural information;
[2024-05-29 04:39:59] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 16) seen :4
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2024-05-29 04:40:00] [INFO ] Computed 451 invariants in 40 ms
[2024-05-29 04:40:02] [INFO ] [Real]Absence check using 451 positive place invariants in 200 ms returned sat
[2024-05-29 04:40:02] [INFO ] After 1582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 04:40:04] [INFO ] [Nat]Absence check using 451 positive place invariants in 208 ms returned sat
[2024-05-29 04:40:20] [INFO ] After 16199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 04:40:22] [INFO ] Deduced a trap composed of 24 places in 1281 ms of which 18 ms to minimize.
[2024-05-29 04:40:23] [INFO ] Deduced a trap composed of 24 places in 1530 ms of which 3 ms to minimize.
[2024-05-29 04:40:25] [INFO ] Deduced a trap composed of 22 places in 1388 ms of which 7 ms to minimize.
[2024-05-29 04:40:26] [INFO ] Deduced a trap composed of 13 places in 1316 ms of which 3 ms to minimize.
[2024-05-29 04:40:28] [INFO ] Deduced a trap composed of 28 places in 1335 ms of which 3 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:40:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:40:28] [INFO ] After 25651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 2246 ms.
Support contains 269 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 645 transitions
Trivial Post-agglo rules discarded 645 transitions
Performed 645 trivial Post agglomeration. Transition count delta: 645
Iterating post reduction 0 with 645 rules applied. Total rules applied 645 place count 3503 transition count 2608
Reduce places removed 645 places and 0 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 1 with 715 rules applied. Total rules applied 1360 place count 2858 transition count 2538
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 1430 place count 2788 transition count 2538
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 1430 place count 2788 transition count 2324
Deduced a syphon composed of 214 places in 8 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 428 rules applied. Total rules applied 1858 place count 2574 transition count 2324
Discarding 313 places :
Symmetric choice reduction at 3 with 313 rule applications. Total rules 2171 place count 2261 transition count 2011
Iterating global reduction 3 with 313 rules applied. Total rules applied 2484 place count 2261 transition count 2011
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 3 with 2 rules applied. Total rules applied 2486 place count 2261 transition count 2009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2487 place count 2260 transition count 2009
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 2487 place count 2260 transition count 1907
Deduced a syphon composed of 102 places in 14 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 2691 place count 2158 transition count 1907
Performed 725 Post agglomeration using F-continuation condition.Transition count delta: 725
Deduced a syphon composed of 725 places in 5 ms
Reduce places removed 725 places and 0 transitions.
Iterating global reduction 5 with 1450 rules applied. Total rules applied 4141 place count 1433 transition count 1182
Renaming transitions due to excessive name length > 1024 char.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 4341 place count 1333 transition count 1224
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 4352 place count 1333 transition count 1213
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 4363 place count 1322 transition count 1213
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 4402 place count 1322 transition count 1213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4403 place count 1321 transition count 1212
Applied a total of 4403 rules in 1297 ms. Remains 1321 /3503 variables (removed 2182) and now considering 1212/3253 (removed 2041) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1299 ms. Remains : 1321/3503 places, 1212/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) 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 12) seen :0
Interrupted probabilistic random walk after 82432 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82432 steps, saw 57600 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1212 rows 1321 cols
[2024-05-29 04:40:35] [INFO ] Computed 451 invariants in 12 ms
[2024-05-29 04:40:36] [INFO ] [Real]Absence check using 451 positive place invariants in 83 ms returned sat
[2024-05-29 04:40:36] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 04:40:37] [INFO ] [Nat]Absence check using 451 positive place invariants in 80 ms returned sat
[2024-05-29 04:40:38] [INFO ] After 1672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 04:40:38] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-05-29 04:40:41] [INFO ] After 2591ms SMT Verify possible using 183 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-29 04:40:42] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
[2024-05-29 04:40:42] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 2 ms to minimize.
[2024-05-29 04:40:43] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 1 ms to minimize.
[2024-05-29 04:40:43] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2024-05-29 04:40:43] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 1 ms to minimize.
[2024-05-29 04:40:44] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2024-05-29 04:40:44] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 7 ms to minimize.
[2024-05-29 04:40:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2388 ms
[2024-05-29 04:40:45] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
[2024-05-29 04:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-05-29 04:40:45] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2024-05-29 04:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2024-05-29 04:40:46] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 0 ms to minimize.
[2024-05-29 04:40:46] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
[2024-05-29 04:40:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 645 ms
[2024-05-29 04:40:46] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2024-05-29 04:40:47] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2024-05-29 04:40:47] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 0 ms to minimize.
[2024-05-29 04:40:47] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2024-05-29 04:40:48] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2024-05-29 04:40:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1598 ms
[2024-05-29 04:40:49] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2024-05-29 04:40:49] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 0 ms to minimize.
[2024-05-29 04:40:49] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2024-05-29 04:40:50] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2024-05-29 04:40:50] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2024-05-29 04:40:50] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2024-05-29 04:40:50] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2024-05-29 04:40:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2174 ms
[2024-05-29 04:40:51] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2024-05-29 04:40:52] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2024-05-29 04:40:52] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2024-05-29 04:40:52] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2024-05-29 04:40:52] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2024-05-29 04:40:53] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 2 ms to minimize.
[2024-05-29 04:40:53] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 1 ms to minimize.
[2024-05-29 04:40:53] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2024-05-29 04:40:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2193 ms
[2024-05-29 04:40:54] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2024-05-29 04:40:54] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2024-05-29 04:40:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 564 ms
[2024-05-29 04:40:54] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-29 04:40:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2024-05-29 04:40:55] [INFO ] After 16009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3974 ms.
[2024-05-29 04:40:58] [INFO ] After 22401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 261 ms.
Support contains 269 out of 1321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1321/1321 places, 1212/1212 transitions.
Applied a total of 0 rules in 231 ms. Remains 1321 /1321 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 1321/1321 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1321/1321 places, 1212/1212 transitions.
Applied a total of 0 rules in 56 ms. Remains 1321 /1321 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-29 04:40:59] [INFO ] Invariant cache hit.
[2024-05-29 04:41:00] [INFO ] Implicit Places using invariants in 647 ms returned [1307]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 651 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1320/1321 places, 1212/1212 transitions.
Applied a total of 0 rules in 56 ms. Remains 1320 /1320 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 764 ms. Remains : 1320/1321 places, 1212/1212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 77610 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77610 steps, saw 54316 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1212 rows 1320 cols
[2024-05-29 04:41:04] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 04:41:04] [INFO ] [Real]Absence check using 450 positive place invariants in 95 ms returned sat
[2024-05-29 04:41:04] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 04:41:05] [INFO ] [Nat]Absence check using 450 positive place invariants in 77 ms returned sat
[2024-05-29 04:41:07] [INFO ] After 1715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 04:41:07] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-05-29 04:41:09] [INFO ] After 2495ms SMT Verify possible using 181 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-29 04:41:10] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 1 ms to minimize.
[2024-05-29 04:41:10] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 1 ms to minimize.
[2024-05-29 04:41:11] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2024-05-29 04:41:11] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2024-05-29 04:41:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1328 ms
[2024-05-29 04:41:12] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 1 ms to minimize.
[2024-05-29 04:41:12] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2024-05-29 04:41:12] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 1 ms to minimize.
[2024-05-29 04:41:13] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 5 ms to minimize.
[2024-05-29 04:41:13] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 0 ms to minimize.
[2024-05-29 04:41:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1804 ms
[2024-05-29 04:41:14] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2024-05-29 04:41:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2024-05-29 04:41:14] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 2 ms to minimize.
[2024-05-29 04:41:15] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2024-05-29 04:41:15] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 0 ms to minimize.
[2024-05-29 04:41:15] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2024-05-29 04:41:16] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2024-05-29 04:41:16] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 13 ms to minimize.
[2024-05-29 04:41:16] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 0 ms to minimize.
[2024-05-29 04:41:17] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2024-05-29 04:41:17] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2024-05-29 04:41:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2858 ms
[2024-05-29 04:41:18] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2024-05-29 04:41:19] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2024-05-29 04:41:19] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-29 04:41:19] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2024-05-29 04:41:20] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 2 ms to minimize.
[2024-05-29 04:41:20] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 2 ms to minimize.
[2024-05-29 04:41:20] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 0 ms to minimize.
[2024-05-29 04:41:21] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 2 ms to minimize.
[2024-05-29 04:41:21] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 3 ms to minimize.
[2024-05-29 04:41:21] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 2 ms to minimize.
[2024-05-29 04:41:22] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 0 ms to minimize.
[2024-05-29 04:41:22] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2024-05-29 04:41:22] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2024-05-29 04:41:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4152 ms
[2024-05-29 04:41:23] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 0 ms to minimize.
[2024-05-29 04:41:23] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 1 ms to minimize.
[2024-05-29 04:41:23] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 1 ms to minimize.
[2024-05-29 04:41:24] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 0 ms to minimize.
[2024-05-29 04:41:24] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2024-05-29 04:41:24] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2024-05-29 04:41:24] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 0 ms to minimize.
[2024-05-29 04:41:25] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2024-05-29 04:41:25] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2024-05-29 04:41:25] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2024-05-29 04:41:26] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 0 ms to minimize.
[2024-05-29 04:41:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2983 ms
[2024-05-29 04:41:26] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2024-05-29 04:41:26] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2024-05-29 04:41:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 578 ms
[2024-05-29 04:41:27] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2024-05-29 04:41:27] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 1 ms to minimize.
[2024-05-29 04:41:27] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2024-05-29 04:41:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 816 ms
[2024-05-29 04:41:27] [INFO ] After 20458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2077 ms.
[2024-05-29 04:41:29] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 200 ms.
Support contains 269 out of 1320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1320/1320 places, 1212/1212 transitions.
Applied a total of 0 rules in 65 ms. Remains 1320 /1320 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1320/1320 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1320/1320 places, 1212/1212 transitions.
Applied a total of 0 rules in 72 ms. Remains 1320 /1320 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-29 04:41:30] [INFO ] Invariant cache hit.
[2024-05-29 04:41:31] [INFO ] Implicit Places using invariants in 951 ms returned []
[2024-05-29 04:41:31] [INFO ] Invariant cache hit.
[2024-05-29 04:41:32] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-05-29 04:41:34] [INFO ] Implicit Places using invariants and state equation in 3232 ms returned []
Implicit Place search using SMT with State Equation took 4194 ms to find 0 implicit places.
[2024-05-29 04:41:34] [INFO ] Redundant transitions in 68 ms returned []
[2024-05-29 04:41:34] [INFO ] Invariant cache hit.
[2024-05-29 04:41:35] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5155 ms. Remains : 1320/1320 places, 1212/1212 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 1320 transition count 1212
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 1320 transition count 1209
Applied a total of 102 rules in 152 ms. Remains 1320 /1320 variables (removed 0) and now considering 1209/1212 (removed 3) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 1209 rows 1320 cols
[2024-05-29 04:41:35] [INFO ] Computed 450 invariants in 4 ms
[2024-05-29 04:41:36] [INFO ] [Real]Absence check using 450 positive place invariants in 82 ms returned sat
[2024-05-29 04:41:36] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 04:41:36] [INFO ] [Nat]Absence check using 450 positive place invariants in 84 ms returned sat
[2024-05-29 04:41:38] [INFO ] After 1562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 04:41:38] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-29 04:41:39] [INFO ] After 1406ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-29 04:41:40] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2024-05-29 04:41:40] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 1 ms to minimize.
[2024-05-29 04:41:40] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 1 ms to minimize.
[2024-05-29 04:41:41] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2024-05-29 04:41:41] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2024-05-29 04:41:41] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-29 04:41:42] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 1 ms to minimize.
[2024-05-29 04:41:42] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2024-05-29 04:41:42] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-29 04:41:43] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2024-05-29 04:41:43] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2024-05-29 04:41:43] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 0 ms to minimize.
[2024-05-29 04:41:44] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2024-05-29 04:41:44] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-29 04:41:44] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2024-05-29 04:41:44] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
[2024-05-29 04:41:45] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 0 ms to minimize.
[2024-05-29 04:41:45] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2024-05-29 04:41:45] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-29 04:41:46] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2024-05-29 04:41:46] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2024-05-29 04:41:46] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2024-05-29 04:41:46] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2024-05-29 04:41:47] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 0 ms to minimize.
[2024-05-29 04:41:47] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2024-05-29 04:41:47] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 1 ms to minimize.
[2024-05-29 04:41:48] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2024-05-29 04:41:48] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2024-05-29 04:41:48] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2024-05-29 04:41:48] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2024-05-29 04:41:49] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 1 ms to minimize.
[2024-05-29 04:41:49] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 9161 ms
[2024-05-29 04:41:49] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2024-05-29 04:41:49] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 4 ms to minimize.
[2024-05-29 04:41:50] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-29 04:41:50] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2024-05-29 04:41:50] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2024-05-29 04:41:50] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2024-05-29 04:41:51] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2024-05-29 04:41:51] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 ms to minimize.
[2024-05-29 04:41:51] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2024-05-29 04:41:51] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 0 ms to minimize.
[2024-05-29 04:41:52] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2024-05-29 04:41:52] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2024-05-29 04:41:52] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2024-05-29 04:41:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3438 ms
[2024-05-29 04:41:53] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 1 ms to minimize.
[2024-05-29 04:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2024-05-29 04:41:53] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 1 ms to minimize.
[2024-05-29 04:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2024-05-29 04:41:54] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 1 ms to minimize.
[2024-05-29 04:41:54] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2024-05-29 04:41:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 788 ms
[2024-05-29 04:41:55] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 1 ms to minimize.
[2024-05-29 04:41:56] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2024-05-29 04:41:56] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 1 ms to minimize.
[2024-05-29 04:41:56] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-05-29 04:41:56] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 2 ms to minimize.
[2024-05-29 04:41:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1501 ms
[2024-05-29 04:41:57] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-29 04:41:57] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2024-05-29 04:41:58] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 1 ms to minimize.
[2024-05-29 04:41:58] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 0 ms to minimize.
[2024-05-29 04:41:58] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2024-05-29 04:41:59] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2024-05-29 04:41:59] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2024-05-29 04:41:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2054 ms
[2024-05-29 04:42:00] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 1 ms to minimize.
[2024-05-29 04:42:00] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2024-05-29 04:42:00] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 1 ms to minimize.
[2024-05-29 04:42:00] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2024-05-29 04:42:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1169 ms
[2024-05-29 04:42:00] [INFO ] After 22490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2047 ms.
[2024-05-29 04:42:03] [INFO ] After 26828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
[2024-05-29 04:42:03] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-29 04:42:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1320 places, 1212 transitions and 4927 arcs took 6 ms.
[2024-05-29 04:42:03] [INFO ] Flatten gal took : 262 ms
Total runtime 124496 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-050B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityFireability
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716957734786
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityFireability.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: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
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: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 40 (type EXCL) for 3 ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 299 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 36 (type FNDP) for 3 ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type EQUN) for 3 ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 39 (type SRCH) for 3 ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: FINISHED task # 39 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
lola: result : true
lola: markings : 80
lola: fired transitions : 79
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 36 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 37 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 40 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: LAUNCH task # 53 (type EXCL) for 30 ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 326 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 42 (type FNDP) for 6 ShieldIIPt-PT-050B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type EQUN) for 6 ShieldIIPt-PT-050B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type SRCH) for 6 ShieldIIPt-PT-050B-ReachabilityFireability-2024-02
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: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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 36 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
lola: result : true
lola: fired transitions : 78
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 42 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-02
lola: result : true
lola: fired transitions : 64
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 43 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 45 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-02 (obsolete)
lola: LAUNCH task # 66 (type FNDP) for 24 ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 67 (type EQUN) for 24 ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 69 (type SRCH) for 24 ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
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: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 # 66 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
lola: result : true
lola: fired transitions : 71
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 67 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-09 (obsolete)
lola: CANCELED task # 69 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-09 (obsolete)
lola: LAUNCH task # 74 (type FNDP) for 33 ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 75 (type EQUN) for 33 ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 77 (type SRCH) for 33 ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 69 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
lola: result : true
lola: markings : 73
lola: fired transitions : 72
lola: time used : 0.000000
lola: memory pages used : 1
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:711
lola: FINISHED task # 74 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 393
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:711
lola: CANCELED task # 75 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 77 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 88 (type FNDP) for 18 ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 89 (type EQUN) for 18 ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 91 (type SRCH) for 18 ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
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: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: 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 # 67 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
lola: result : unknown
lola: FINISHED task # 77 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
lola: result : true
lola: markings : 395
lola: fired transitions : 400
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 88 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
lola: result : true
lola: fired transitions : 54
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 89 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 91 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-07 (obsolete)
lola: LAUNCH task # 94 (type FNDP) for 0 ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 95 (type EQUN) for 0 ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 98 (type SRCH) for 0 ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 91 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
lola: result : true
lola: markings : 56
lola: fired transitions : 55
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 94 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
lola: result : true
lola: fired transitions : 35
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 98 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
lola: result : true
lola: markings : 37
lola: fired transitions : 36
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 95 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-00 (obsolete)
lola: LAUNCH task # 55 (type FNDP) for 27 ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type EQUN) for 27 ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 58 (type SRCH) for 27 ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 55 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
lola: result : true
lola: fired transitions : 53
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 56 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-11 (obsolete)
lola: CANCELED task # 58 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-11 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 106 (type FNDP) for 21 ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 107 (type EQUN) for 21 ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 109 (type SRCH) for 21 ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-95.sara.
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-43.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-89.sara.
lola: FINISHED task # 109 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
lola: result : true
lola: markings : 122
lola: fired transitions : 121
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 106 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 107 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-08 (obsolete)
lola: LAUNCH task # 61 (type FNDP) for 9 ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 62 (type EQUN) for 9 ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type SRCH) for 9 ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 106 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
lola: result : unknown
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-56.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 61 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
lola: result : true
lola: fired transitions : 48
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 62 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 64 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-03 (obsolete)
lola: LAUNCH task # 81 (type FNDP) for 15 ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 82 (type EQUN) for 15 ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 84 (type SRCH) for 15 ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-62.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 84 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
lola: result : true
lola: markings : 124
lola: fired transitions : 123
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 81 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 82 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-05 (obsolete)
lola: LAUNCH task # 97 (type FNDP) for 12 ShieldIIPt-PT-050B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 101 (type EQUN) for 12 ShieldIIPt-PT-050B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 103 (type SRCH) for 12 ShieldIIPt-PT-050B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 81 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
lola: result : true
lola: fired transitions : 122
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 97 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-04
lola: result : true
lola: fired transitions : 30
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 101 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 103 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-04 (obsolete)
lola: LAUNCH task # 49 (type FNDP) for 30 ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 30 ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 30 ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
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 # 52 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
lola: result : true
lola: markings : 110
lola: fired transitions : 109
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 49 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 50 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 53 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityFireability-2024-12 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050B-ReachabilityFireability-2024-00: EF true findpath
ShieldIIPt-PT-050B-ReachabilityFireability-2024-01: EF true tandem / insertion
ShieldIIPt-PT-050B-ReachabilityFireability-2024-02: EF true findpath
ShieldIIPt-PT-050B-ReachabilityFireability-2024-03: EF true findpath
ShieldIIPt-PT-050B-ReachabilityFireability-2024-04: EF true findpath
ShieldIIPt-PT-050B-ReachabilityFireability-2024-05: AG false tandem / insertion
ShieldIIPt-PT-050B-ReachabilityFireability-2024-07: AG false findpath
ShieldIIPt-PT-050B-ReachabilityFireability-2024-08: EF true tandem / insertion
ShieldIIPt-PT-050B-ReachabilityFireability-2024-09: EF true findpath
ShieldIIPt-PT-050B-ReachabilityFireability-2024-11: EF true findpath
ShieldIIPt-PT-050B-ReachabilityFireability-2024-12: AG false tandem / insertion
ShieldIIPt-PT-050B-ReachabilityFireability-2024-14: AG false findpath
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="ShieldIIPt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
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 ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788800210"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;