About the Execution of 2023-gold for ShieldPPPs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 831.936 | 149815.00 | 193103.00 | 709.00 | FTTTTFTTFFTTTTFF | 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-171683789000319.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 ShieldPPPs-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-171683789000319
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 11:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 11:47 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 888K 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 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716979265287
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=ShieldPPPs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 10:41:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 10:41:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:41:07] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-29 10:41:07] [INFO ] Transformed 3403 places.
[2024-05-29 10:41:07] [INFO ] Transformed 3153 transitions.
[2024-05-29 10:41:07] [INFO ] Found NUPN structural information;
[2024-05-29 10:41:07] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 15) seen :9
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2024-05-29 10:41:08] [INFO ] Computed 551 invariants in 64 ms
[2024-05-29 10:41:10] [INFO ] [Real]Absence check using 551 positive place invariants in 217 ms returned sat
[2024-05-29 10:41:10] [INFO ] After 1473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 10:41:11] [INFO ] [Nat]Absence check using 551 positive place invariants in 245 ms returned sat
[2024-05-29 10:41:14] [INFO ] After 2706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 10:41:15] [INFO ] Deduced a trap composed of 27 places in 1205 ms of which 13 ms to minimize.
[2024-05-29 10:41:16] [INFO ] Deduced a trap composed of 18 places in 1021 ms of which 3 ms to minimize.
[2024-05-29 10:41:18] [INFO ] Deduced a trap composed of 20 places in 1064 ms of which 3 ms to minimize.
[2024-05-29 10:41:19] [INFO ] Deduced a trap composed of 40 places in 1069 ms of which 4 ms to minimize.
[2024-05-29 10:41:20] [INFO ] Deduced a trap composed of 19 places in 1017 ms of which 2 ms to minimize.
[2024-05-29 10:41:21] [INFO ] Deduced a trap composed of 17 places in 1037 ms of which 3 ms to minimize.
[2024-05-29 10:41:22] [INFO ] Deduced a trap composed of 26 places in 1003 ms of which 3 ms to minimize.
[2024-05-29 10:41:23] [INFO ] Deduced a trap composed of 37 places in 962 ms of which 2 ms to minimize.
[2024-05-29 10:41:24] [INFO ] Deduced a trap composed of 28 places in 944 ms of which 2 ms to minimize.
[2024-05-29 10:41:25] [INFO ] Deduced a trap composed of 22 places in 1010 ms of which 2 ms to minimize.
[2024-05-29 10:41:26] [INFO ] Deduced a trap composed of 30 places in 1019 ms of which 2 ms to minimize.
[2024-05-29 10:41:28] [INFO ] Deduced a trap composed of 26 places in 1024 ms of which 2 ms to minimize.
[2024-05-29 10:41:29] [INFO ] Deduced a trap composed of 42 places in 1020 ms of which 2 ms to minimize.
[2024-05-29 10:41:30] [INFO ] Deduced a trap composed of 39 places in 1002 ms of which 2 ms to minimize.
[2024-05-29 10:41:31] [INFO ] Deduced a trap composed of 31 places in 1011 ms of which 2 ms to minimize.
[2024-05-29 10:41:32] [INFO ] Deduced a trap composed of 29 places in 993 ms of which 2 ms to minimize.
[2024-05-29 10:41:33] [INFO ] Deduced a trap composed of 22 places in 1006 ms of which 2 ms to minimize.
[2024-05-29 10:41:34] [INFO ] Deduced a trap composed of 38 places in 992 ms of which 2 ms to minimize.
[2024-05-29 10:41:35] [INFO ] Deduced a trap composed of 38 places in 928 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 10:41:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:41:35] [INFO ] After 25595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 536 ms.
Support contains 87 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 3403 transition count 2836
Reduce places removed 317 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 326 rules applied. Total rules applied 643 place count 3086 transition count 2827
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 652 place count 3077 transition count 2827
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 255 Pre rules applied. Total rules applied 652 place count 3077 transition count 2572
Deduced a syphon composed of 255 places in 8 ms
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 3 with 510 rules applied. Total rules applied 1162 place count 2822 transition count 2572
Discarding 330 places :
Symmetric choice reduction at 3 with 330 rule applications. Total rules 1492 place count 2492 transition count 2242
Iterating global reduction 3 with 330 rules applied. Total rules applied 1822 place count 2492 transition count 2242
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 1822 place count 2492 transition count 2112
Deduced a syphon composed of 130 places in 16 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 2082 place count 2362 transition count 2112
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 4 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 3 with 1420 rules applied. Total rules applied 3502 place count 1652 transition count 1402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 418 times.
Drop transitions removed 418 transitions
Iterating global reduction 3 with 418 rules applied. Total rules applied 3920 place count 1652 transition count 1402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3921 place count 1651 transition count 1401
Applied a total of 3921 rules in 1331 ms. Remains 1651 /3403 variables (removed 1752) and now considering 1401/3153 (removed 1752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1332 ms. Remains : 1651/3403 places, 1401/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 6) seen :2
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1401 rows 1651 cols
[2024-05-29 10:41:38] [INFO ] Computed 551 invariants in 74 ms
[2024-05-29 10:41:38] [INFO ] [Real]Absence check using 521 positive place invariants in 92 ms returned sat
[2024-05-29 10:41:38] [INFO ] [Real]Absence check using 521 positive and 30 generalized place invariants in 6 ms returned sat
[2024-05-29 10:41:38] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:41:39] [INFO ] [Nat]Absence check using 521 positive place invariants in 97 ms returned sat
[2024-05-29 10:41:39] [INFO ] [Nat]Absence check using 521 positive and 30 generalized place invariants in 7 ms returned sat
[2024-05-29 10:41:40] [INFO ] After 1504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:41:41] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2024-05-29 10:41:41] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 1 ms to minimize.
[2024-05-29 10:41:42] [INFO ] Deduced a trap composed of 5 places in 398 ms of which 1 ms to minimize.
[2024-05-29 10:41:42] [INFO ] Deduced a trap composed of 5 places in 396 ms of which 1 ms to minimize.
[2024-05-29 10:41:43] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 1 ms to minimize.
[2024-05-29 10:41:43] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 1 ms to minimize.
[2024-05-29 10:41:44] [INFO ] Deduced a trap composed of 5 places in 395 ms of which 1 ms to minimize.
[2024-05-29 10:41:44] [INFO ] Deduced a trap composed of 8 places in 407 ms of which 1 ms to minimize.
[2024-05-29 10:41:44] [INFO ] Deduced a trap composed of 6 places in 401 ms of which 1 ms to minimize.
[2024-05-29 10:41:45] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 1 ms to minimize.
[2024-05-29 10:41:45] [INFO ] Deduced a trap composed of 6 places in 407 ms of which 1 ms to minimize.
[2024-05-29 10:41:46] [INFO ] Deduced a trap composed of 6 places in 401 ms of which 1 ms to minimize.
[2024-05-29 10:41:46] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 1 ms to minimize.
[2024-05-29 10:41:47] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2024-05-29 10:41:47] [INFO ] Deduced a trap composed of 8 places in 443 ms of which 1 ms to minimize.
[2024-05-29 10:41:48] [INFO ] Deduced a trap composed of 3 places in 437 ms of which 1 ms to minimize.
[2024-05-29 10:41:48] [INFO ] Deduced a trap composed of 5 places in 443 ms of which 2 ms to minimize.
[2024-05-29 10:41:49] [INFO ] Deduced a trap composed of 8 places in 433 ms of which 1 ms to minimize.
[2024-05-29 10:41:49] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2024-05-29 10:41:50] [INFO ] Deduced a trap composed of 5 places in 380 ms of which 1 ms to minimize.
[2024-05-29 10:41:50] [INFO ] Deduced a trap composed of 5 places in 381 ms of which 2 ms to minimize.
[2024-05-29 10:41:51] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 1 ms to minimize.
[2024-05-29 10:41:51] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 1 ms to minimize.
[2024-05-29 10:41:51] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 1 ms to minimize.
[2024-05-29 10:41:52] [INFO ] Deduced a trap composed of 7 places in 368 ms of which 1 ms to minimize.
[2024-05-29 10:41:52] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 1 ms to minimize.
[2024-05-29 10:41:53] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 1 ms to minimize.
[2024-05-29 10:41:53] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 1 ms to minimize.
[2024-05-29 10:41:54] [INFO ] Deduced a trap composed of 8 places in 369 ms of which 1 ms to minimize.
[2024-05-29 10:41:54] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 0 ms to minimize.
[2024-05-29 10:41:54] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2024-05-29 10:41:55] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 2 ms to minimize.
[2024-05-29 10:41:55] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 1 ms to minimize.
[2024-05-29 10:41:55] [INFO ] Deduced a trap composed of 8 places in 341 ms of which 1 ms to minimize.
[2024-05-29 10:41:56] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 1 ms to minimize.
[2024-05-29 10:41:56] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2024-05-29 10:41:57] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 0 ms to minimize.
[2024-05-29 10:41:57] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 1 ms to minimize.
[2024-05-29 10:41:57] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 1 ms to minimize.
[2024-05-29 10:41:58] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 1 ms to minimize.
[2024-05-29 10:41:58] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 1 ms to minimize.
[2024-05-29 10:41:59] [INFO ] Deduced a trap composed of 6 places in 358 ms of which 1 ms to minimize.
[2024-05-29 10:41:59] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2024-05-29 10:41:59] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2024-05-29 10:42:00] [INFO ] Deduced a trap composed of 9 places in 387 ms of which 1 ms to minimize.
[2024-05-29 10:42:00] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 4 ms to minimize.
[2024-05-29 10:42:01] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 1 ms to minimize.
[2024-05-29 10:42:01] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 3 ms to minimize.
[2024-05-29 10:42:02] [INFO ] Deduced a trap composed of 7 places in 374 ms of which 4 ms to minimize.
[2024-05-29 10:42:02] [INFO ] Deduced a trap composed of 17 places in 413 ms of which 1 ms to minimize.
[2024-05-29 10:42:03] [INFO ] Deduced a trap composed of 31 places in 394 ms of which 1 ms to minimize.
[2024-05-29 10:42:03] [INFO ] Deduced a trap composed of 7 places in 404 ms of which 1 ms to minimize.
[2024-05-29 10:42:03] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:42:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:42:03] [INFO ] After 25155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 113 ms.
Support contains 82 out of 1651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1651/1651 places, 1401/1401 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 0 with 1 rules applied. Total rules applied 1 place count 1651 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1650 transition count 1400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1650 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1649 transition count 1399
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1646 transition count 1396
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1646 transition count 1396
Applied a total of 12 rules in 340 ms. Remains 1646 /1651 variables (removed 5) and now considering 1396/1401 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 1646/1651 places, 1396/1401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 94746 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94746 steps, saw 88112 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1396 rows 1646 cols
[2024-05-29 10:42:07] [INFO ] Computed 551 invariants in 35 ms
[2024-05-29 10:42:08] [INFO ] [Real]Absence check using 523 positive place invariants in 99 ms returned sat
[2024-05-29 10:42:08] [INFO ] [Real]Absence check using 523 positive and 28 generalized place invariants in 5 ms returned sat
[2024-05-29 10:42:08] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:42:08] [INFO ] [Nat]Absence check using 523 positive place invariants in 96 ms returned sat
[2024-05-29 10:42:08] [INFO ] [Nat]Absence check using 523 positive and 28 generalized place invariants in 6 ms returned sat
[2024-05-29 10:42:10] [INFO ] After 1799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:42:11] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2024-05-29 10:42:11] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2024-05-29 10:42:11] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2024-05-29 10:42:12] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:42:12] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-29 10:42:12] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2024-05-29 10:42:12] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2024-05-29 10:42:13] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2024-05-29 10:42:13] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 3 ms to minimize.
[2024-05-29 10:42:13] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 0 ms to minimize.
[2024-05-29 10:42:14] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2024-05-29 10:42:14] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2024-05-29 10:42:14] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2024-05-29 10:42:15] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2024-05-29 10:42:15] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 1 ms to minimize.
[2024-05-29 10:42:15] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 0 ms to minimize.
[2024-05-29 10:42:16] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2024-05-29 10:42:16] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2024-05-29 10:42:16] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2024-05-29 10:42:17] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 0 ms to minimize.
[2024-05-29 10:42:17] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 0 ms to minimize.
[2024-05-29 10:42:17] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2024-05-29 10:42:18] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2024-05-29 10:42:18] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2024-05-29 10:42:18] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2024-05-29 10:42:19] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2024-05-29 10:42:19] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2024-05-29 10:42:19] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2024-05-29 10:42:20] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 1 ms to minimize.
[2024-05-29 10:42:20] [INFO ] Deduced a trap composed of 10 places in 378 ms of which 2 ms to minimize.
[2024-05-29 10:42:20] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 1 ms to minimize.
[2024-05-29 10:42:21] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 1 ms to minimize.
[2024-05-29 10:42:21] [INFO ] Deduced a trap composed of 9 places in 357 ms of which 1 ms to minimize.
[2024-05-29 10:42:22] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 1 ms to minimize.
[2024-05-29 10:42:22] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 1 ms to minimize.
[2024-05-29 10:42:22] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 1 ms to minimize.
[2024-05-29 10:42:23] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 1 ms to minimize.
[2024-05-29 10:42:23] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-05-29 10:42:24] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 1 ms to minimize.
[2024-05-29 10:42:24] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 1 ms to minimize.
[2024-05-29 10:42:25] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2024-05-29 10:42:25] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 1 ms to minimize.
[2024-05-29 10:42:25] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2024-05-29 10:42:26] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 1 ms to minimize.
[2024-05-29 10:42:26] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 1 ms to minimize.
[2024-05-29 10:42:27] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 1 ms to minimize.
[2024-05-29 10:42:27] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 1 ms to minimize.
[2024-05-29 10:42:27] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 1 ms to minimize.
[2024-05-29 10:42:28] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2024-05-29 10:42:28] [INFO ] Deduced a trap composed of 9 places in 352 ms of which 1 ms to minimize.
[2024-05-29 10:42:29] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 2 ms to minimize.
[2024-05-29 10:42:29] [INFO ] Deduced a trap composed of 8 places in 370 ms of which 1 ms to minimize.
[2024-05-29 10:42:29] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 1 ms to minimize.
[2024-05-29 10:42:30] [INFO ] Deduced a trap composed of 22 places in 328 ms of which 0 ms to minimize.
[2024-05-29 10:42:30] [INFO ] Deduced a trap composed of 22 places in 337 ms of which 1 ms to minimize.
[2024-05-29 10:42:31] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 1 ms to minimize.
[2024-05-29 10:42:31] [INFO ] Deduced a trap composed of 17 places in 322 ms of which 1 ms to minimize.
[2024-05-29 10:42:31] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 0 ms to minimize.
[2024-05-29 10:42:32] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 1 ms to minimize.
[2024-05-29 10:42:32] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 21648 ms
[2024-05-29 10:42:33] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2024-05-29 10:42:33] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 333 ms
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.refineResultsWithTraps(DeadlockTester.java:772)
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 10:42:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:42:33] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 148 ms.
Support contains 82 out of 1646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 1396/1396 transitions.
Applied a total of 0 rules in 59 ms. Remains 1646 /1646 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1646/1646 places, 1396/1396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 1396/1396 transitions.
Applied a total of 0 rules in 57 ms. Remains 1646 /1646 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
[2024-05-29 10:42:33] [INFO ] Invariant cache hit.
[2024-05-29 10:42:34] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2024-05-29 10:42:34] [INFO ] Invariant cache hit.
[2024-05-29 10:42:37] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 3364 ms to find 0 implicit places.
[2024-05-29 10:42:37] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-29 10:42:37] [INFO ] Invariant cache hit.
[2024-05-29 10:42:38] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4366 ms. Remains : 1646/1646 places, 1396/1396 transitions.
Applied a total of 0 rules in 57 ms. Remains 1646 /1646 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 10:42:38] [INFO ] Invariant cache hit.
[2024-05-29 10:42:38] [INFO ] [Real]Absence check using 523 positive place invariants in 87 ms returned sat
[2024-05-29 10:42:38] [INFO ] [Real]Absence check using 523 positive and 28 generalized place invariants in 10 ms returned sat
[2024-05-29 10:42:38] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:42:38] [INFO ] [Nat]Absence check using 523 positive place invariants in 97 ms returned sat
[2024-05-29 10:42:38] [INFO ] [Nat]Absence check using 523 positive and 28 generalized place invariants in 5 ms returned sat
[2024-05-29 10:42:40] [INFO ] After 1332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:42:40] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 1 ms to minimize.
[2024-05-29 10:42:41] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2024-05-29 10:42:41] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 1 ms to minimize.
[2024-05-29 10:42:42] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 1 ms to minimize.
[2024-05-29 10:42:42] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 1 ms to minimize.
[2024-05-29 10:42:42] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 1 ms to minimize.
[2024-05-29 10:42:43] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 0 ms to minimize.
[2024-05-29 10:42:43] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2024-05-29 10:42:43] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-29 10:42:44] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 2 ms to minimize.
[2024-05-29 10:42:44] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 3 ms to minimize.
[2024-05-29 10:42:45] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2024-05-29 10:42:45] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2024-05-29 10:42:45] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2024-05-29 10:42:46] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 1 ms to minimize.
[2024-05-29 10:42:46] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2024-05-29 10:42:46] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 0 ms to minimize.
[2024-05-29 10:42:47] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2024-05-29 10:42:47] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2024-05-29 10:42:47] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2024-05-29 10:42:48] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-29 10:42:48] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2024-05-29 10:42:48] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2024-05-29 10:42:49] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 0 ms to minimize.
[2024-05-29 10:42:49] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 1 ms to minimize.
[2024-05-29 10:42:49] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 1 ms to minimize.
[2024-05-29 10:42:50] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2024-05-29 10:42:50] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-29 10:42:50] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2024-05-29 10:42:51] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2024-05-29 10:42:51] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2024-05-29 10:42:51] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2024-05-29 10:42:52] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2024-05-29 10:42:52] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2024-05-29 10:42:52] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 1 ms to minimize.
[2024-05-29 10:42:52] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 1 ms to minimize.
[2024-05-29 10:42:53] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2024-05-29 10:42:53] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2024-05-29 10:42:53] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2024-05-29 10:42:54] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2024-05-29 10:42:54] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2024-05-29 10:42:54] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2024-05-29 10:42:54] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2024-05-29 10:42:55] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2024-05-29 10:42:55] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2024-05-29 10:42:55] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2024-05-29 10:42:55] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2024-05-29 10:42:56] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 1 ms to minimize.
[2024-05-29 10:42:56] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 1 ms to minimize.
[2024-05-29 10:42:56] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 16054 ms
[2024-05-29 10:42:58] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-29 10:42:58] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2024-05-29 10:42:58] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-29 10:42:59] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2024-05-29 10:42:59] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 10:42:59] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2024-05-29 10:42:59] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2024-05-29 10:43:00] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2024-05-29 10:43:00] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 10:43:00] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2024-05-29 10:43:00] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2024-05-29 10:43:01] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-05-29 10:43:01] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2024-05-29 10:43:01] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2024-05-29 10:43:01] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2024-05-29 10:43:01] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2024-05-29 10:43:02] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2024-05-29 10:43:02] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2024-05-29 10:43:02] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2024-05-29 10:43:02] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 10:43:03] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2024-05-29 10:43:03] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-29 10:43:03] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2024-05-29 10:43:03] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2024-05-29 10:43:03] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-29 10:43:03] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6274 ms
[2024-05-29 10:43:04] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2024-05-29 10:43:04] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 1 ms to minimize.
[2024-05-29 10:43:04] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2024-05-29 10:43:05] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 1 ms to minimize.
[2024-05-29 10:43:05] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 0 ms to minimize.
[2024-05-29 10:43:05] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 1 ms to minimize.
[2024-05-29 10:43:05] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2024-05-29 10:43:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1888 ms
[2024-05-29 10:43:06] [INFO ] Deduced a trap composed of 9 places in 327 ms of which 1 ms to minimize.
[2024-05-29 10:43:06] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 1 ms to minimize.
[2024-05-29 10:43:07] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 1 ms to minimize.
[2024-05-29 10:43:07] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2024-05-29 10:43:08] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2024-05-29 10:43:08] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 1 ms to minimize.
[2024-05-29 10:43:08] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2024-05-29 10:43:09] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2024-05-29 10:43:09] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 1 ms to minimize.
[2024-05-29 10:43:09] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2024-05-29 10:43:10] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2024-05-29 10:43:10] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 1 ms to minimize.
[2024-05-29 10:43:11] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:43:11] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2024-05-29 10:43:11] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2024-05-29 10:43:12] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2024-05-29 10:43:12] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 1 ms to minimize.
[2024-05-29 10:43:12] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-29 10:43:13] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 2 ms to minimize.
[2024-05-29 10:43:13] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2024-05-29 10:43:13] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 0 ms to minimize.
[2024-05-29 10:43:14] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 0 ms to minimize.
[2024-05-29 10:43:14] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 1 ms to minimize.
[2024-05-29 10:43:14] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2024-05-29 10:43:14] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 1 ms to minimize.
[2024-05-29 10:43:15] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 1 ms to minimize.
[2024-05-29 10:43:15] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2024-05-29 10:43:15] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2024-05-29 10:43:16] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2024-05-29 10:43:16] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2024-05-29 10:43:16] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2024-05-29 10:43:17] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2024-05-29 10:43:17] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2024-05-29 10:43:17] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2024-05-29 10:43:17] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2024-05-29 10:43:18] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 2 ms to minimize.
[2024-05-29 10:43:18] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 0 ms to minimize.
[2024-05-29 10:43:18] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2024-05-29 10:43:19] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2024-05-29 10:43:19] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 1 ms to minimize.
[2024-05-29 10:43:19] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 1 ms to minimize.
[2024-05-29 10:43:19] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2024-05-29 10:43:20] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 5 ms to minimize.
[2024-05-29 10:43:20] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2024-05-29 10:43:20] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 14252 ms
[2024-05-29 10:43:20] [INFO ] After 41366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4639 ms.
[2024-05-29 10:43:25] [INFO ] After 46495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-29 10:43:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 10:43:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1646 places, 1396 transitions and 6083 arcs took 10 ms.
[2024-05-29 10:43:25] [INFO ] Flatten gal took : 159 ms
Total runtime 138181 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-050B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716979415102
--------------------
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/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/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: 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 # 17 (type EXCL) for 6 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 6 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 6 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 6 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 16 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
lola: result : true
lola: markings : 107
lola: fired transitions : 106
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 14 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 23 (type EXCL) for 9 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type FNDP) for 9 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 9 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 9 ShieldPPPs-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:711
lola: FINISHED task # 19 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11
lola: result : true
lola: fired transitions : 128
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 20 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 22 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 23 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11 (obsolete)
lola: FINISHED task # 13 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
lola: result : true
lola: fired transitions : 105
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: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 # 33 (type EXCL) for 3 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 29 (type FNDP) for 3 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type EQUN) for 3 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type SRCH) for 3 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-14.sara.
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-20.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09: AG false tandem / insertion
ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06: EF 0 5 0 0 1 0 0 0
ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07: AG 0 1 4 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
29 EF FNDP 5/1199 0/5 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07 290768 t fired, 9411 attempts, .
30 EF STEQ 5/1199 0/5 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07 sara not yet started (preprocessing).
32 EF SRCH 5/1799 1/5 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07 72565 m, 14513 m/sec, 368781 t fired, .
33 EF EXCL 5/1799 1/32 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07 9991 m, 1998 m/sec, 9990 t fired, .
Time elapsed: 7 secs. Pages in use: 2
# running tasks: 4 of 4 Visible: 4
lola: FINISHED task # 32 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07
lola: result : false
lola: markings : 93051
lola: fired transitions : 492211
lola: time used : 7.000000
lola: memory pages used : 1
lola: CANCELED task # 29 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 30 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 33 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07 (obsolete)
lola: LAUNCH task # 36 (type EXCL) for 0 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06
lola: time limit : 3591 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 0 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 0 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type SRCH) for 0 ShieldPPPs-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 # 35 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06
lola: result : true
lola: markings : 92
lola: fired transitions : 91
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 26 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 36 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06: EF true tandem / insertion
ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07: AG true tandem / insertion
ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09: AG false tandem / insertion
ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11: EF true findpath
Time elapsed: 9 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="ShieldPPPs-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 ShieldPPPs-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-171683789000319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-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 ;