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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716949210421

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 02:20:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 02:20:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:20:12] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-05-29 02:20:12] [INFO ] Transformed 6003 places.
[2024-05-29 02:20:12] [INFO ] Transformed 5903 transitions.
[2024-05-29 02:20:12] [INFO ] Found NUPN structural information;
[2024-05-29 02:20:12] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 14) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-00 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2024-05-29 02:20:14] [INFO ] Computed 901 invariants in 73 ms
[2024-05-29 02:20:16] [INFO ] After 2085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 02:20:18] [INFO ] [Nat]Absence check using 901 positive place invariants in 586 ms returned sat
[2024-05-29 02:20:41] [INFO ] After 21926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 02:20:41] [INFO ] After 21941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 02:20:41] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 500 ms.
Support contains 188 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 6003 transition count 5466
Reduce places removed 437 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 468 rules applied. Total rules applied 905 place count 5566 transition count 5435
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 936 place count 5535 transition count 5435
Performed 494 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 494 Pre rules applied. Total rules applied 936 place count 5535 transition count 4941
Deduced a syphon composed of 494 places in 25 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 3 with 988 rules applied. Total rules applied 1924 place count 5041 transition count 4941
Discarding 647 places :
Symmetric choice reduction at 3 with 647 rule applications. Total rules 2571 place count 4394 transition count 4294
Iterating global reduction 3 with 647 rules applied. Total rules applied 3218 place count 4394 transition count 4294
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 3218 place count 4394 transition count 4047
Deduced a syphon composed of 247 places in 23 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 3712 place count 4147 transition count 4047
Performed 1430 Post agglomeration using F-continuation condition.Transition count delta: 1430
Deduced a syphon composed of 1430 places in 22 ms
Reduce places removed 1430 places and 0 transitions.
Iterating global reduction 3 with 2860 rules applied. Total rules applied 6572 place count 2717 transition count 2617
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 653 times.
Drop transitions removed 653 transitions
Iterating global reduction 3 with 653 rules applied. Total rules applied 7225 place count 2717 transition count 2617
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7226 place count 2716 transition count 2616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7227 place count 2715 transition count 2616
Applied a total of 7227 rules in 2234 ms. Remains 2715 /6003 variables (removed 3288) and now considering 2616/5903 (removed 3287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2237 ms. Remains : 2715/6003 places, 2616/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 9) seen :3
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2616 rows 2715 cols
[2024-05-29 02:20:45] [INFO ] Computed 900 invariants in 72 ms
[2024-05-29 02:20:45] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 02:20:46] [INFO ] [Nat]Absence check using 886 positive place invariants in 180 ms returned sat
[2024-05-29 02:20:46] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-29 02:20:50] [INFO ] After 3341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 02:20:50] [INFO ] Deduced a trap composed of 10 places in 570 ms of which 8 ms to minimize.
[2024-05-29 02:20:51] [INFO ] Deduced a trap composed of 9 places in 534 ms of which 2 ms to minimize.
[2024-05-29 02:20:52] [INFO ] Deduced a trap composed of 9 places in 608 ms of which 2 ms to minimize.
[2024-05-29 02:20:52] [INFO ] Deduced a trap composed of 11 places in 623 ms of which 1 ms to minimize.
[2024-05-29 02:20:53] [INFO ] Deduced a trap composed of 13 places in 624 ms of which 3 ms to minimize.
[2024-05-29 02:20:54] [INFO ] Deduced a trap composed of 9 places in 607 ms of which 1 ms to minimize.
[2024-05-29 02:20:55] [INFO ] Deduced a trap composed of 10 places in 573 ms of which 1 ms to minimize.
[2024-05-29 02:20:55] [INFO ] Deduced a trap composed of 10 places in 572 ms of which 2 ms to minimize.
[2024-05-29 02:20:56] [INFO ] Deduced a trap composed of 10 places in 569 ms of which 1 ms to minimize.
[2024-05-29 02:20:57] [INFO ] Deduced a trap composed of 8 places in 516 ms of which 1 ms to minimize.
[2024-05-29 02:20:57] [INFO ] Deduced a trap composed of 6 places in 506 ms of which 1 ms to minimize.
[2024-05-29 02:20:58] [INFO ] Deduced a trap composed of 22 places in 507 ms of which 1 ms to minimize.
[2024-05-29 02:20:58] [INFO ] Deduced a trap composed of 13 places in 496 ms of which 1 ms to minimize.
[2024-05-29 02:20:59] [INFO ] Deduced a trap composed of 10 places in 496 ms of which 1 ms to minimize.
[2024-05-29 02:20:59] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 1 ms to minimize.
[2024-05-29 02:21:00] [INFO ] Deduced a trap composed of 14 places in 454 ms of which 1 ms to minimize.
[2024-05-29 02:21:01] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 1 ms to minimize.
[2024-05-29 02:21:01] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 1 ms to minimize.
[2024-05-29 02:21:02] [INFO ] Deduced a trap composed of 21 places in 418 ms of which 1 ms to minimize.
[2024-05-29 02:21:02] [INFO ] Deduced a trap composed of 13 places in 365 ms of which 1 ms to minimize.
[2024-05-29 02:21:03] [INFO ] Deduced a trap composed of 15 places in 380 ms of which 1 ms to minimize.
[2024-05-29 02:21:03] [INFO ] Deduced a trap composed of 24 places in 355 ms of which 1 ms to minimize.
[2024-05-29 02:21:03] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 1 ms to minimize.
[2024-05-29 02:21:04] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 0 ms to minimize.
[2024-05-29 02:21:04] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 0 ms to minimize.
[2024-05-29 02:21:05] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 0 ms to minimize.
[2024-05-29 02:21:05] [INFO ] Deduced a trap composed of 16 places in 351 ms of which 1 ms to minimize.
[2024-05-29 02:21:05] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 0 ms to minimize.
[2024-05-29 02:21:06] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 0 ms to minimize.
[2024-05-29 02:21:06] [INFO ] Deduced a trap composed of 18 places in 298 ms of which 1 ms to minimize.
[2024-05-29 02:21:07] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2024-05-29 02:21:07] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 0 ms to minimize.
[2024-05-29 02:21:07] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 1 ms to minimize.
[2024-05-29 02:21:08] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 1 ms to minimize.
[2024-05-29 02:21:08] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 0 ms to minimize.
[2024-05-29 02:21:09] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 0 ms to minimize.
[2024-05-29 02:21:09] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 1 ms to minimize.
[2024-05-29 02:21:09] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 1 ms to minimize.
[2024-05-29 02:21:10] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 0 ms to minimize.
[2024-05-29 02:21:10] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
[2024-05-29 02:21:10] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 1 ms to minimize.
[2024-05-29 02:21:13] [INFO ] Deduced a trap composed of 2 places in 2240 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 02:21:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:21:13] [INFO ] After 27287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 439 ms.
Support contains 128 out of 2715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2715/2715 places, 2616/2616 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 2715 transition count 2607
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 2706 transition count 2607
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 2706 transition count 2602
Deduced a syphon composed of 5 places in 9 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 2701 transition count 2602
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 106 place count 2662 transition count 2563
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 124 place count 2662 transition count 2563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 2661 transition count 2562
Applied a total of 125 rules in 374 ms. Remains 2661 /2715 variables (removed 54) and now considering 2562/2616 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 2661/2715 places, 2562/2616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 89360 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89360 steps, saw 87404 distinct states, run finished after 3005 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2562 rows 2661 cols
[2024-05-29 02:21:17] [INFO ] Computed 900 invariants in 59 ms
[2024-05-29 02:21:18] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 02:21:19] [INFO ] [Nat]Absence check using 891 positive place invariants in 197 ms returned sat
[2024-05-29 02:21:19] [INFO ] [Nat]Absence check using 891 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-29 02:21:22] [INFO ] After 3151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 02:21:23] [INFO ] Deduced a trap composed of 4 places in 648 ms of which 4 ms to minimize.
[2024-05-29 02:21:24] [INFO ] Deduced a trap composed of 7 places in 595 ms of which 1 ms to minimize.
[2024-05-29 02:21:24] [INFO ] Deduced a trap composed of 9 places in 605 ms of which 1 ms to minimize.
[2024-05-29 02:21:25] [INFO ] Deduced a trap composed of 11 places in 587 ms of which 2 ms to minimize.
[2024-05-29 02:21:26] [INFO ] Deduced a trap composed of 6 places in 545 ms of which 1 ms to minimize.
[2024-05-29 02:21:26] [INFO ] Deduced a trap composed of 14 places in 580 ms of which 1 ms to minimize.
[2024-05-29 02:21:27] [INFO ] Deduced a trap composed of 3 places in 600 ms of which 1 ms to minimize.
[2024-05-29 02:21:28] [INFO ] Deduced a trap composed of 20 places in 611 ms of which 1 ms to minimize.
[2024-05-29 02:21:28] [INFO ] Deduced a trap composed of 10 places in 528 ms of which 2 ms to minimize.
[2024-05-29 02:21:29] [INFO ] Deduced a trap composed of 8 places in 554 ms of which 1 ms to minimize.
[2024-05-29 02:21:30] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 1 ms to minimize.
[2024-05-29 02:21:30] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 1 ms to minimize.
[2024-05-29 02:21:31] [INFO ] Deduced a trap composed of 7 places in 503 ms of which 1 ms to minimize.
[2024-05-29 02:21:31] [INFO ] Deduced a trap composed of 8 places in 458 ms of which 4 ms to minimize.
[2024-05-29 02:21:32] [INFO ] Deduced a trap composed of 6 places in 497 ms of which 1 ms to minimize.
[2024-05-29 02:21:33] [INFO ] Deduced a trap composed of 5 places in 476 ms of which 1 ms to minimize.
[2024-05-29 02:21:33] [INFO ] Deduced a trap composed of 9 places in 500 ms of which 1 ms to minimize.
[2024-05-29 02:21:34] [INFO ] Deduced a trap composed of 8 places in 478 ms of which 1 ms to minimize.
[2024-05-29 02:21:34] [INFO ] Deduced a trap composed of 10 places in 488 ms of which 1 ms to minimize.
[2024-05-29 02:21:35] [INFO ] Deduced a trap composed of 20 places in 463 ms of which 1 ms to minimize.
[2024-05-29 02:21:35] [INFO ] Deduced a trap composed of 7 places in 463 ms of which 1 ms to minimize.
[2024-05-29 02:21:36] [INFO ] Deduced a trap composed of 14 places in 471 ms of which 1 ms to minimize.
[2024-05-29 02:21:37] [INFO ] Deduced a trap composed of 10 places in 457 ms of which 1 ms to minimize.
[2024-05-29 02:21:37] [INFO ] Deduced a trap composed of 8 places in 441 ms of which 1 ms to minimize.
[2024-05-29 02:21:38] [INFO ] Deduced a trap composed of 8 places in 496 ms of which 4 ms to minimize.
[2024-05-29 02:21:38] [INFO ] Deduced a trap composed of 7 places in 449 ms of which 1 ms to minimize.
[2024-05-29 02:21:39] [INFO ] Deduced a trap composed of 11 places in 453 ms of which 1 ms to minimize.
[2024-05-29 02:21:39] [INFO ] Deduced a trap composed of 12 places in 476 ms of which 1 ms to minimize.
[2024-05-29 02:21:40] [INFO ] Deduced a trap composed of 7 places in 460 ms of which 1 ms to minimize.
[2024-05-29 02:21:41] [INFO ] Deduced a trap composed of 11 places in 457 ms of which 1 ms to minimize.
[2024-05-29 02:21:41] [INFO ] Deduced a trap composed of 17 places in 399 ms of which 1 ms to minimize.
[2024-05-29 02:21:42] [INFO ] Deduced a trap composed of 6 places in 437 ms of which 1 ms to minimize.
[2024-05-29 02:21:42] [INFO ] Deduced a trap composed of 15 places in 428 ms of which 1 ms to minimize.
[2024-05-29 02:21:43] [INFO ] Deduced a trap composed of 10 places in 426 ms of which 1 ms to minimize.
[2024-05-29 02:21:43] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:21:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:21:43] [INFO ] After 25243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 608 ms.
Support contains 128 out of 2661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2661/2661 places, 2562/2562 transitions.
Applied a total of 0 rules in 100 ms. Remains 2661 /2661 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2661/2661 places, 2562/2562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2661/2661 places, 2562/2562 transitions.
Applied a total of 0 rules in 89 ms. Remains 2661 /2661 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
[2024-05-29 02:21:44] [INFO ] Invariant cache hit.
[2024-05-29 02:21:46] [INFO ] Implicit Places using invariants in 2043 ms returned []
[2024-05-29 02:21:46] [INFO ] Invariant cache hit.
[2024-05-29 02:21:50] [INFO ] Implicit Places using invariants and state equation in 4459 ms returned []
Implicit Place search using SMT with State Equation took 6504 ms to find 0 implicit places.
[2024-05-29 02:21:51] [INFO ] Redundant transitions in 204 ms returned []
[2024-05-29 02:21:51] [INFO ] Invariant cache hit.
[2024-05-29 02:21:53] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8706 ms. Remains : 2661/2661 places, 2562/2562 transitions.
Applied a total of 0 rules in 89 ms. Remains 2661 /2661 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 02:21:53] [INFO ] Invariant cache hit.
[2024-05-29 02:21:53] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 02:21:54] [INFO ] [Nat]Absence check using 891 positive place invariants in 204 ms returned sat
[2024-05-29 02:21:54] [INFO ] [Nat]Absence check using 891 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-29 02:21:58] [INFO ] After 3528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 02:21:58] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 1 ms to minimize.
[2024-05-29 02:21:59] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 0 ms to minimize.
[2024-05-29 02:21:59] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 1 ms to minimize.
[2024-05-29 02:22:00] [INFO ] Deduced a trap composed of 10 places in 379 ms of which 1 ms to minimize.
[2024-05-29 02:22:00] [INFO ] Deduced a trap composed of 15 places in 348 ms of which 1 ms to minimize.
[2024-05-29 02:22:01] [INFO ] Deduced a trap composed of 10 places in 356 ms of which 1 ms to minimize.
[2024-05-29 02:22:01] [INFO ] Deduced a trap composed of 6 places in 402 ms of which 1 ms to minimize.
[2024-05-29 02:22:02] [INFO ] Deduced a trap composed of 12 places in 374 ms of which 2 ms to minimize.
[2024-05-29 02:22:02] [INFO ] Deduced a trap composed of 18 places in 378 ms of which 1 ms to minimize.
[2024-05-29 02:22:03] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 1 ms to minimize.
[2024-05-29 02:22:03] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 1 ms to minimize.
[2024-05-29 02:22:04] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 1 ms to minimize.
[2024-05-29 02:22:04] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2024-05-29 02:22:05] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2024-05-29 02:22:05] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 1 ms to minimize.
[2024-05-29 02:22:06] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 1 ms to minimize.
[2024-05-29 02:22:06] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 1 ms to minimize.
[2024-05-29 02:22:06] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 1 ms to minimize.
[2024-05-29 02:22:07] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 1 ms to minimize.
[2024-05-29 02:22:07] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 1 ms to minimize.
[2024-05-29 02:22:08] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 1 ms to minimize.
[2024-05-29 02:22:08] [INFO ] Deduced a trap composed of 10 places in 329 ms of which 1 ms to minimize.
[2024-05-29 02:22:09] [INFO ] Deduced a trap composed of 11 places in 314 ms of which 1 ms to minimize.
[2024-05-29 02:22:09] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 1 ms to minimize.
[2024-05-29 02:22:10] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 0 ms to minimize.
[2024-05-29 02:22:10] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 1 ms to minimize.
[2024-05-29 02:22:10] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 1 ms to minimize.
[2024-05-29 02:22:11] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 1 ms to minimize.
[2024-05-29 02:22:11] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2024-05-29 02:22:12] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 0 ms to minimize.
[2024-05-29 02:22:12] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 1 ms to minimize.
[2024-05-29 02:22:12] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 1 ms to minimize.
[2024-05-29 02:22:13] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2024-05-29 02:22:13] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2024-05-29 02:22:13] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2024-05-29 02:22:14] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2024-05-29 02:22:14] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 1 ms to minimize.
[2024-05-29 02:22:14] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 1 ms to minimize.
[2024-05-29 02:22:15] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2024-05-29 02:22:15] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2024-05-29 02:22:16] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 0 ms to minimize.
[2024-05-29 02:22:16] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 0 ms to minimize.
[2024-05-29 02:22:16] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-05-29 02:22:17] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 0 ms to minimize.
[2024-05-29 02:22:17] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 1 ms to minimize.
[2024-05-29 02:22:17] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 1 ms to minimize.
[2024-05-29 02:22:18] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-05-29 02:22:18] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 1 ms to minimize.
[2024-05-29 02:22:18] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2024-05-29 02:22:19] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2024-05-29 02:22:19] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 0 ms to minimize.
[2024-05-29 02:22:19] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 1 ms to minimize.
[2024-05-29 02:22:20] [INFO ] Deduced a trap composed of 26 places in 362 ms of which 0 ms to minimize.
[2024-05-29 02:22:20] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 0 ms to minimize.
[2024-05-29 02:22:21] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 0 ms to minimize.
[2024-05-29 02:22:21] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2024-05-29 02:22:21] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2024-05-29 02:22:21] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2024-05-29 02:22:22] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2024-05-29 02:22:22] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 0 ms to minimize.
[2024-05-29 02:22:22] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 24279 ms
[2024-05-29 02:22:23] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 1 ms to minimize.
[2024-05-29 02:22:23] [INFO ] Deduced a trap composed of 6 places in 360 ms of which 1 ms to minimize.
[2024-05-29 02:22:24] [INFO ] Deduced a trap composed of 9 places in 357 ms of which 1 ms to minimize.
[2024-05-29 02:22:24] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 1 ms to minimize.
[2024-05-29 02:22:25] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 2 ms to minimize.
[2024-05-29 02:22:25] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2024-05-29 02:22:25] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 0 ms to minimize.
[2024-05-29 02:22:26] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 1 ms to minimize.
[2024-05-29 02:22:26] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 1 ms to minimize.
[2024-05-29 02:22:27] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 1 ms to minimize.
[2024-05-29 02:22:27] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 1 ms to minimize.
[2024-05-29 02:22:27] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 1 ms to minimize.
[2024-05-29 02:22:28] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2024-05-29 02:22:28] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 0 ms to minimize.
[2024-05-29 02:22:29] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 1 ms to minimize.
[2024-05-29 02:22:29] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 1 ms to minimize.
[2024-05-29 02:22:29] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-05-29 02:22:30] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 1 ms to minimize.
[2024-05-29 02:22:30] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 1 ms to minimize.
[2024-05-29 02:22:30] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 0 ms to minimize.
[2024-05-29 02:22:31] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 0 ms to minimize.
[2024-05-29 02:22:31] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 0 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 1 ms to minimize.
[2024-05-29 02:22:33] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2024-05-29 02:22:33] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 0 ms to minimize.
[2024-05-29 02:22:33] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 1 ms to minimize.
[2024-05-29 02:22:34] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 0 ms to minimize.
[2024-05-29 02:22:34] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 1 ms to minimize.
[2024-05-29 02:22:34] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 0 ms to minimize.
[2024-05-29 02:22:35] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 0 ms to minimize.
[2024-05-29 02:22:35] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 0 ms to minimize.
[2024-05-29 02:22:36] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 1 ms to minimize.
[2024-05-29 02:22:36] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2024-05-29 02:22:36] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 0 ms to minimize.
[2024-05-29 02:22:37] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 0 ms to minimize.
[2024-05-29 02:22:37] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2024-05-29 02:22:37] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 1 ms to minimize.
[2024-05-29 02:22:37] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 14950 ms
[2024-05-29 02:22:38] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 1 ms to minimize.
[2024-05-29 02:22:39] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 0 ms to minimize.
[2024-05-29 02:22:39] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-05-29 02:22:40] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2024-05-29 02:22:40] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 1 ms to minimize.
[2024-05-29 02:22:40] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 1 ms to minimize.
[2024-05-29 02:22:41] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 0 ms to minimize.
[2024-05-29 02:22:41] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 1 ms to minimize.
[2024-05-29 02:22:42] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 1 ms to minimize.
[2024-05-29 02:22:42] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2024-05-29 02:22:42] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 0 ms to minimize.
[2024-05-29 02:22:43] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 0 ms to minimize.
[2024-05-29 02:22:43] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2024-05-29 02:22:44] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 0 ms to minimize.
[2024-05-29 02:22:44] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 1 ms to minimize.
[2024-05-29 02:22:44] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 0 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 0 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 1 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 1 ms to minimize.
[2024-05-29 02:22:46] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 1 ms to minimize.
[2024-05-29 02:22:46] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 1 ms to minimize.
[2024-05-29 02:22:47] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2024-05-29 02:22:47] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 1 ms to minimize.
[2024-05-29 02:22:47] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 0 ms to minimize.
[2024-05-29 02:22:48] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 1 ms to minimize.
[2024-05-29 02:22:48] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 0 ms to minimize.
[2024-05-29 02:22:48] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2024-05-29 02:22:49] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 0 ms to minimize.
[2024-05-29 02:22:49] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 1 ms to minimize.
[2024-05-29 02:22:49] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2024-05-29 02:22:50] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 0 ms to minimize.
[2024-05-29 02:22:50] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2024-05-29 02:22:50] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2024-05-29 02:22:51] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2024-05-29 02:22:51] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2024-05-29 02:22:51] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2024-05-29 02:22:52] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2024-05-29 02:22:52] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2024-05-29 02:22:52] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2024-05-29 02:22:52] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-05-29 02:22:53] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 0 ms to minimize.
[2024-05-29 02:22:53] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 0 ms to minimize.
[2024-05-29 02:22:53] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2024-05-29 02:22:53] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2024-05-29 02:22:54] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 15739 ms
[2024-05-29 02:22:54] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 1 ms to minimize.
[2024-05-29 02:22:55] [INFO ] Deduced a trap composed of 10 places in 426 ms of which 1 ms to minimize.
[2024-05-29 02:22:55] [INFO ] Deduced a trap composed of 8 places in 385 ms of which 1 ms to minimize.
[2024-05-29 02:22:56] [INFO ] Deduced a trap composed of 9 places in 401 ms of which 1 ms to minimize.
[2024-05-29 02:22:56] [INFO ] Deduced a trap composed of 10 places in 384 ms of which 0 ms to minimize.
[2024-05-29 02:22:57] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 1 ms to minimize.
[2024-05-29 02:22:57] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 1 ms to minimize.
[2024-05-29 02:22:58] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 1 ms to minimize.
[2024-05-29 02:22:58] [INFO ] Deduced a trap composed of 12 places in 350 ms of which 1 ms to minimize.
[2024-05-29 02:22:59] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 1 ms to minimize.
[2024-05-29 02:22:59] [INFO ] Deduced a trap composed of 7 places in 368 ms of which 1 ms to minimize.
[2024-05-29 02:23:00] [INFO ] Deduced a trap composed of 11 places in 363 ms of which 1 ms to minimize.
[2024-05-29 02:23:00] [INFO ] Deduced a trap composed of 7 places in 311 ms of which 1 ms to minimize.
[2024-05-29 02:23:00] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 1 ms to minimize.
[2024-05-29 02:23:01] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 0 ms to minimize.
[2024-05-29 02:23:01] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 1 ms to minimize.
[2024-05-29 02:23:02] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 1 ms to minimize.
[2024-05-29 02:23:02] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 1 ms to minimize.
[2024-05-29 02:23:03] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 0 ms to minimize.
[2024-05-29 02:23:03] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 1 ms to minimize.
[2024-05-29 02:23:04] [INFO ] Deduced a trap composed of 14 places in 297 ms of which 1 ms to minimize.
[2024-05-29 02:23:04] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 0 ms to minimize.
[2024-05-29 02:23:05] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 1 ms to minimize.
[2024-05-29 02:23:05] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 1 ms to minimize.
[2024-05-29 02:23:05] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 0 ms to minimize.
[2024-05-29 02:23:06] [INFO ] Deduced a trap composed of 23 places in 326 ms of which 1 ms to minimize.
[2024-05-29 02:23:06] [INFO ] Deduced a trap composed of 29 places in 329 ms of which 1 ms to minimize.
[2024-05-29 02:23:07] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 1 ms to minimize.
[2024-05-29 02:23:07] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 2 ms to minimize.
[2024-05-29 02:23:07] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 0 ms to minimize.
[2024-05-29 02:23:08] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 0 ms to minimize.
[2024-05-29 02:23:08] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 1 ms to minimize.
[2024-05-29 02:23:08] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 1 ms to minimize.
[2024-05-29 02:23:09] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 14531 ms
[2024-05-29 02:23:09] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 1 ms to minimize.
[2024-05-29 02:23:10] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 2 ms to minimize.
[2024-05-29 02:23:10] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2024-05-29 02:23:11] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 1 ms to minimize.
[2024-05-29 02:23:11] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 0 ms to minimize.
[2024-05-29 02:23:11] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2024-05-29 02:23:12] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 1 ms to minimize.
[2024-05-29 02:23:12] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 1 ms to minimize.
[2024-05-29 02:23:12] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 0 ms to minimize.
[2024-05-29 02:23:13] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 1 ms to minimize.
[2024-05-29 02:23:13] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 1 ms to minimize.
[2024-05-29 02:23:13] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 0 ms to minimize.
[2024-05-29 02:23:14] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2024-05-29 02:23:14] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 0 ms to minimize.
[2024-05-29 02:23:14] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 0 ms to minimize.
[2024-05-29 02:23:14] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 0 ms to minimize.
[2024-05-29 02:23:15] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 1 ms to minimize.
[2024-05-29 02:23:15] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2024-05-29 02:23:15] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 1 ms to minimize.
[2024-05-29 02:23:16] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
[2024-05-29 02:23:16] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 0 ms to minimize.
[2024-05-29 02:23:16] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6979 ms
[2024-05-29 02:23:16] [INFO ] After 82069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2408 ms.
[2024-05-29 02:23:19] [INFO ] After 85363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-29 02:23:19] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2024-05-29 02:23:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2661 places, 2562 transitions and 12463 arcs took 20 ms.
[2024-05-29 02:23:19] [INFO ] Flatten gal took : 303 ms
Total runtime 187262 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityCardinality

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

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

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

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

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

BK_STOP 1716949412012

--------------------
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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityCardinality.xml
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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 20 (type EXCL) for 9 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
lola: time limit : 717 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 9 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 9 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 9 ShieldIIPs-PT-100B-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: 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: 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: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-17.sara.
lola: FINISHED task # 19 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
lola: result : false
lola: markings : 18773
lola: fired transitions : 40446
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 20 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11 (obsolete)
lola: LAUNCH task # 32 (type EXCL) for 12 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12
lola: time limit : 897 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 6 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 6 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 6 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 16 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
lola: result : unknown
lola: fired transitions : 22250
lola: tried executions : 2909
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 17 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
lola: result : unknown
lola: FINISHED task # 22 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07
lola: result : true
lola: fired transitions : 232
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 23 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 25 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07 (obsolete)
lola: LAUNCH task # 40 (type FNDP) for 3 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type EQUN) for 3 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type SRCH) for 3 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 43 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
lola: result : true
lola: markings : 64
lola: fired transitions : 63
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 40 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 41 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05 (obsolete)
lola: LAUNCH task # 34 (type FNDP) for 0 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 0 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type SRCH) for 0 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 40 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
lola: result : unknown
lola: fired transitions : 2045
lola: tried executions : 299
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 37 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
lola: result : true
lola: markings : 221
lola: fired transitions : 220
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 34 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04 (obsolete)
lola: CANCELED task # 35 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04 (obsolete)
lola: LAUNCH task # 28 (type FNDP) for 12 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type EQUN) for 12 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type SRCH) for 12 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 34 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
lola: result : unknown
lola: fired transitions : 139
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 31 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12
lola: result : true
lola: markings : 201
lola: fired transitions : 200
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 28 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 29 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 32 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04: EF true tandem / insertion
ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05: EF true tandem / insertion
ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07: EF true findpath
ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11: AG true tandem / insertion
ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12: EF true tandem / insertion


Time elapsed: 11 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPs-PT-100B, 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-171683788500109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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