Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r394-oct2-167903717600159.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 846K Mar 5 18:23 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679495534434

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:32:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 14:32:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:32:17] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-22 14:32:17] [INFO ] Transformed 3003 places.
[2023-03-22 14:32:17] [INFO ] Transformed 2953 transitions.
[2023-03-22 14:32:17] [INFO ] Found NUPN structural information;
[2023-03-22 14:32:17] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 16) seen :7
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 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 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 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 2953 rows 3003 cols
[2023-03-22 14:32:18] [INFO ] Computed 451 place invariants in 34 ms
[2023-03-22 14:32:20] [INFO ] After 1480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 14:32:21] [INFO ] [Nat]Absence check using 451 positive place invariants in 368 ms returned sat
[2023-03-22 14:32:35] [INFO ] After 13183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 14:32:38] [INFO ] Deduced a trap composed of 27 places in 1336 ms of which 14 ms to minimize.
[2023-03-22 14:32:39] [INFO ] Deduced a trap composed of 21 places in 1018 ms of which 3 ms to minimize.
[2023-03-22 14:32:41] [INFO ] Deduced a trap composed of 25 places in 1131 ms of which 4 ms to minimize.
[2023-03-22 14:32:42] [INFO ] Deduced a trap composed of 28 places in 1453 ms of which 2 ms to minimize.
[2023-03-22 14:32:43] [INFO ] Deduced a trap composed of 27 places in 1042 ms of which 19 ms to minimize.
[2023-03-22 14:32:45] [INFO ] Deduced a trap composed of 20 places in 1073 ms of which 13 ms to minimize.
[2023-03-22 14:32:46] [INFO ] Deduced a trap composed of 18 places in 872 ms of which 19 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-22 14:32:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:32:46] [INFO ] After 25953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1492 ms.
Support contains 310 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 214 place count 3003 transition count 2739
Reduce places removed 214 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 227 rules applied. Total rules applied 441 place count 2789 transition count 2726
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 454 place count 2776 transition count 2726
Performed 227 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 227 Pre rules applied. Total rules applied 454 place count 2776 transition count 2499
Deduced a syphon composed of 227 places in 7 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 3 with 454 rules applied. Total rules applied 908 place count 2549 transition count 2499
Discarding 295 places :
Symmetric choice reduction at 3 with 295 rule applications. Total rules 1203 place count 2254 transition count 2204
Iterating global reduction 3 with 295 rules applied. Total rules applied 1498 place count 2254 transition count 2204
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 1498 place count 2254 transition count 2122
Deduced a syphon composed of 82 places in 15 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 1662 place count 2172 transition count 2122
Performed 670 Post agglomeration using F-continuation condition.Transition count delta: 670
Deduced a syphon composed of 670 places in 6 ms
Reduce places removed 670 places and 0 transitions.
Iterating global reduction 3 with 1340 rules applied. Total rules applied 3002 place count 1502 transition count 1452
Partial Free-agglomeration rule applied 263 times.
Drop transitions removed 263 transitions
Iterating global reduction 3 with 263 rules applied. Total rules applied 3265 place count 1502 transition count 1452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3266 place count 1501 transition count 1451
Applied a total of 3266 rules in 840 ms. Remains 1501 /3003 variables (removed 1502) and now considering 1451/2953 (removed 1502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 841 ms. Remains : 1501/3003 places, 1451/2953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 8) seen :4
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1451 rows 1501 cols
[2023-03-22 14:32:49] [INFO ] Computed 451 place invariants in 12 ms
[2023-03-22 14:32:49] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 14:32:50] [INFO ] [Nat]Absence check using 446 positive place invariants in 212 ms returned sat
[2023-03-22 14:32:50] [INFO ] [Nat]Absence check using 446 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-22 14:32:51] [INFO ] After 1722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 14:32:52] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 1 ms to minimize.
[2023-03-22 14:32:53] [INFO ] Deduced a trap composed of 4 places in 578 ms of which 2 ms to minimize.
[2023-03-22 14:32:53] [INFO ] Deduced a trap composed of 6 places in 519 ms of which 1 ms to minimize.
[2023-03-22 14:32:54] [INFO ] Deduced a trap composed of 6 places in 486 ms of which 1 ms to minimize.
[2023-03-22 14:32:55] [INFO ] Deduced a trap composed of 5 places in 497 ms of which 1 ms to minimize.
[2023-03-22 14:32:55] [INFO ] Deduced a trap composed of 8 places in 394 ms of which 1 ms to minimize.
[2023-03-22 14:32:56] [INFO ] Deduced a trap composed of 9 places in 498 ms of which 1 ms to minimize.
[2023-03-22 14:32:56] [INFO ] Deduced a trap composed of 8 places in 615 ms of which 2 ms to minimize.
[2023-03-22 14:32:57] [INFO ] Deduced a trap composed of 5 places in 528 ms of which 1 ms to minimize.
[2023-03-22 14:32:57] [INFO ] Deduced a trap composed of 8 places in 398 ms of which 1 ms to minimize.
[2023-03-22 14:32:58] [INFO ] Deduced a trap composed of 9 places in 432 ms of which 3 ms to minimize.
[2023-03-22 14:32:58] [INFO ] Deduced a trap composed of 8 places in 396 ms of which 1 ms to minimize.
[2023-03-22 14:32:59] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 1 ms to minimize.
[2023-03-22 14:32:59] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 1 ms to minimize.
[2023-03-22 14:33:00] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2023-03-22 14:33:00] [INFO ] Deduced a trap composed of 7 places in 474 ms of which 2 ms to minimize.
[2023-03-22 14:33:01] [INFO ] Deduced a trap composed of 8 places in 433 ms of which 1 ms to minimize.
[2023-03-22 14:33:01] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 1 ms to minimize.
[2023-03-22 14:33:02] [INFO ] Deduced a trap composed of 10 places in 394 ms of which 1 ms to minimize.
[2023-03-22 14:33:02] [INFO ] Deduced a trap composed of 9 places in 386 ms of which 1 ms to minimize.
[2023-03-22 14:33:03] [INFO ] Deduced a trap composed of 10 places in 674 ms of which 2 ms to minimize.
[2023-03-22 14:33:03] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 0 ms to minimize.
[2023-03-22 14:33:04] [INFO ] Deduced a trap composed of 9 places in 429 ms of which 1 ms to minimize.
[2023-03-22 14:33:04] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 1 ms to minimize.
[2023-03-22 14:33:05] [INFO ] Deduced a trap composed of 13 places in 355 ms of which 1 ms to minimize.
[2023-03-22 14:33:05] [INFO ] Deduced a trap composed of 16 places in 390 ms of which 0 ms to minimize.
[2023-03-22 14:33:06] [INFO ] Deduced a trap composed of 16 places in 349 ms of which 5 ms to minimize.
[2023-03-22 14:33:06] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2023-03-22 14:33:06] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 1 ms to minimize.
[2023-03-22 14:33:07] [INFO ] Deduced a trap composed of 14 places in 385 ms of which 1 ms to minimize.
[2023-03-22 14:33:07] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 1 ms to minimize.
[2023-03-22 14:33:08] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2023-03-22 14:33:08] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 0 ms to minimize.
[2023-03-22 14:33:09] [INFO ] Deduced a trap composed of 6 places in 499 ms of which 1 ms to minimize.
[2023-03-22 14:33:09] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 0 ms to minimize.
[2023-03-22 14:33:09] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 17 ms to minimize.
[2023-03-22 14:33:10] [INFO ] Deduced a trap composed of 12 places in 374 ms of which 2 ms to minimize.
[2023-03-22 14:33:10] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2023-03-22 14:33:11] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2023-03-22 14:33:11] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 0 ms to minimize.
[2023-03-22 14:33:12] [INFO ] Deduced a trap composed of 20 places in 420 ms of which 0 ms to minimize.
[2023-03-22 14:33:12] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 1 ms to minimize.
[2023-03-22 14:33:12] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 0 ms to minimize.
[2023-03-22 14:33:13] [INFO ] Deduced a trap composed of 22 places in 426 ms of which 2 ms to minimize.
[2023-03-22 14:33:13] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 1 ms to minimize.
[2023-03-22 14:33:14] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 1 ms to minimize.
[2023-03-22 14:33:14] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 1 ms to minimize.
[2023-03-22 14:33:14] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 0 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-22 14:33:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:33:14] [INFO ] After 25228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 284 ms.
Support contains 131 out of 1501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1501/1501 places, 1451/1451 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1501 transition count 1445
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 1495 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 1494 transition count 1444
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 14 place count 1494 transition count 1412
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 78 place count 1462 transition count 1412
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 1461 transition count 1411
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 1461 transition count 1411
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 282 place count 1360 transition count 1310
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 3 with 54 rules applied. Total rules applied 336 place count 1360 transition count 1310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 place count 1358 transition count 1308
Applied a total of 338 rules in 268 ms. Remains 1358 /1501 variables (removed 143) and now considering 1308/1451 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 1358/1501 places, 1308/1451 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1308 rows 1358 cols
[2023-03-22 14:33:15] [INFO ] Computed 451 place invariants in 28 ms
[2023-03-22 14:33:16] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:33:16] [INFO ] [Nat]Absence check using 438 positive place invariants in 75 ms returned sat
[2023-03-22 14:33:16] [INFO ] [Nat]Absence check using 438 positive and 13 generalized place invariants in 52 ms returned sat
[2023-03-22 14:33:17] [INFO ] After 1177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:33:18] [INFO ] Deduced a trap composed of 7 places in 798 ms of which 1 ms to minimize.
[2023-03-22 14:33:19] [INFO ] Deduced a trap composed of 3 places in 360 ms of which 1 ms to minimize.
[2023-03-22 14:33:19] [INFO ] Deduced a trap composed of 6 places in 358 ms of which 1 ms to minimize.
[2023-03-22 14:33:20] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2023-03-22 14:33:20] [INFO ] Deduced a trap composed of 5 places in 371 ms of which 0 ms to minimize.
[2023-03-22 14:33:20] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2023-03-22 14:33:21] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 0 ms to minimize.
[2023-03-22 14:33:21] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 1 ms to minimize.
[2023-03-22 14:33:21] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2023-03-22 14:33:22] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-22 14:33:22] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 0 ms to minimize.
[2023-03-22 14:33:23] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 15 ms to minimize.
[2023-03-22 14:33:23] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2023-03-22 14:33:23] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 15 ms to minimize.
[2023-03-22 14:33:24] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2023-03-22 14:33:24] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 0 ms to minimize.
[2023-03-22 14:33:24] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-22 14:33:25] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 1 ms to minimize.
[2023-03-22 14:33:25] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 1 ms to minimize.
[2023-03-22 14:33:25] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-22 14:33:26] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 1 ms to minimize.
[2023-03-22 14:33:26] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2023-03-22 14:33:26] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-22 14:33:27] [INFO ] Deduced a trap composed of 11 places in 572 ms of which 1 ms to minimize.
[2023-03-22 14:33:27] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 1 ms to minimize.
[2023-03-22 14:33:28] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 0 ms to minimize.
[2023-03-22 14:33:28] [INFO ] Deduced a trap composed of 8 places in 390 ms of which 0 ms to minimize.
[2023-03-22 14:33:28] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 1 ms to minimize.
[2023-03-22 14:33:29] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 2 ms to minimize.
[2023-03-22 14:33:29] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 0 ms to minimize.
[2023-03-22 14:33:29] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-22 14:33:30] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-22 14:33:30] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 0 ms to minimize.
[2023-03-22 14:33:30] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2023-03-22 14:33:31] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 1 ms to minimize.
[2023-03-22 14:33:31] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 0 ms to minimize.
[2023-03-22 14:33:31] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 0 ms to minimize.
[2023-03-22 14:33:32] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-22 14:33:32] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 14464 ms
[2023-03-22 14:33:32] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2023-03-22 14:33:33] [INFO ] Deduced a trap composed of 10 places in 557 ms of which 1 ms to minimize.
[2023-03-22 14:33:33] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 1 ms to minimize.
[2023-03-22 14:33:34] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 0 ms to minimize.
[2023-03-22 14:33:34] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2023-03-22 14:33:35] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 0 ms to minimize.
[2023-03-22 14:33:35] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 0 ms to minimize.
[2023-03-22 14:33:35] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2023-03-22 14:33:36] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 0 ms to minimize.
[2023-03-22 14:33:36] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 1 ms to minimize.
[2023-03-22 14:33:36] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2023-03-22 14:33:37] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 0 ms to minimize.
[2023-03-22 14:33:37] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2023-03-22 14:33:37] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-22 14:33:38] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2023-03-22 14:33:38] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 1 ms to minimize.
[2023-03-22 14:33:38] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 1 ms to minimize.
[2023-03-22 14:33:39] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 1 ms to minimize.
[2023-03-22 14:33:39] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 0 ms to minimize.
[2023-03-22 14:33:39] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 2 ms to minimize.
[2023-03-22 14:33:40] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-22 14:33:40] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 0 ms to minimize.
[2023-03-22 14:33:40] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 0 ms to minimize.
[2023-03-22 14:33:41] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2023-03-22 14:33:41] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-22 14:33:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:33:41] [INFO ] After 25211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 107 ms.
Support contains 120 out of 1358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1358/1358 places, 1308/1308 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 1358 transition count 1305
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1355 transition count 1305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 1353 transition count 1303
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 1353 transition count 1303
Applied a total of 14 rules in 113 ms. Remains 1353 /1358 variables (removed 5) and now considering 1303/1308 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1353/1358 places, 1303/1308 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 106304 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106304 steps, saw 86972 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1303 rows 1353 cols
[2023-03-22 14:33:45] [INFO ] Computed 451 place invariants in 34 ms
[2023-03-22 14:33:45] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:33:45] [INFO ] [Nat]Absence check using 439 positive place invariants in 232 ms returned sat
[2023-03-22 14:33:45] [INFO ] [Nat]Absence check using 439 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-22 14:33:47] [INFO ] After 1112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:33:47] [INFO ] Deduced a trap composed of 6 places in 381 ms of which 2 ms to minimize.
[2023-03-22 14:33:48] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 1 ms to minimize.
[2023-03-22 14:33:48] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 1 ms to minimize.
[2023-03-22 14:33:48] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 1 ms to minimize.
[2023-03-22 14:33:49] [INFO ] Deduced a trap composed of 6 places in 513 ms of which 1 ms to minimize.
[2023-03-22 14:33:49] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 1 ms to minimize.
[2023-03-22 14:33:50] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
[2023-03-22 14:33:50] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2023-03-22 14:33:51] [INFO ] Deduced a trap composed of 5 places in 379 ms of which 0 ms to minimize.
[2023-03-22 14:33:51] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 0 ms to minimize.
[2023-03-22 14:33:51] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 1 ms to minimize.
[2023-03-22 14:33:52] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 0 ms to minimize.
[2023-03-22 14:33:52] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 0 ms to minimize.
[2023-03-22 14:33:53] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-22 14:33:53] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-22 14:33:53] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-22 14:33:54] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2023-03-22 14:33:54] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2023-03-22 14:33:54] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2023-03-22 14:33:55] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2023-03-22 14:33:55] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 0 ms to minimize.
[2023-03-22 14:33:56] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2023-03-22 14:33:56] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-22 14:33:56] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 1 ms to minimize.
[2023-03-22 14:33:57] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2023-03-22 14:33:57] [INFO ] Deduced a trap composed of 8 places in 643 ms of which 1 ms to minimize.
[2023-03-22 14:33:58] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 1 ms to minimize.
[2023-03-22 14:33:58] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 1 ms to minimize.
[2023-03-22 14:33:58] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
[2023-03-22 14:33:59] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 1 ms to minimize.
[2023-03-22 14:33:59] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 1 ms to minimize.
[2023-03-22 14:33:59] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2023-03-22 14:34:00] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2023-03-22 14:34:00] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 1 ms to minimize.
[2023-03-22 14:34:01] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 1 ms to minimize.
[2023-03-22 14:34:01] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 0 ms to minimize.
[2023-03-22 14:34:01] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2023-03-22 14:34:01] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-22 14:34:02] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 14927 ms
[2023-03-22 14:34:02] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2023-03-22 14:34:02] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2023-03-22 14:34:03] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 1 ms to minimize.
[2023-03-22 14:34:03] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 0 ms to minimize.
[2023-03-22 14:34:04] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 1 ms to minimize.
[2023-03-22 14:34:04] [INFO ] Deduced a trap composed of 14 places in 415 ms of which 1 ms to minimize.
[2023-03-22 14:34:04] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-22 14:34:05] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-22 14:34:05] [INFO ] Deduced a trap composed of 14 places in 296 ms of which 1 ms to minimize.
[2023-03-22 14:34:05] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2023-03-22 14:34:06] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-22 14:34:06] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-22 14:34:06] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 0 ms to minimize.
[2023-03-22 14:34:06] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2023-03-22 14:34:07] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2023-03-22 14:34:07] [INFO ] Deduced a trap composed of 3 places in 436 ms of which 0 ms to minimize.
[2023-03-22 14:34:08] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2023-03-22 14:34:08] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2023-03-22 14:34:08] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 0 ms to minimize.
[2023-03-22 14:34:08] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6451 ms
[2023-03-22 14:34:09] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2023-03-22 14:34:09] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2023-03-22 14:34:09] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 0 ms to minimize.
[2023-03-22 14:34:10] [INFO ] Deduced a trap composed of 8 places in 638 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-22 14:34:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:34:10] [INFO ] After 25193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 168 ms.
Support contains 120 out of 1353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1353/1353 places, 1303/1303 transitions.
Applied a total of 0 rules in 36 ms. Remains 1353 /1353 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1353/1353 places, 1303/1303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1353/1353 places, 1303/1303 transitions.
Applied a total of 0 rules in 55 ms. Remains 1353 /1353 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 14:34:10] [INFO ] Invariant cache hit.
[2023-03-22 14:34:11] [INFO ] Implicit Places using invariants in 849 ms returned []
[2023-03-22 14:34:11] [INFO ] Invariant cache hit.
[2023-03-22 14:34:14] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 3344 ms to find 0 implicit places.
[2023-03-22 14:34:14] [INFO ] Redundant transitions in 231 ms returned []
[2023-03-22 14:34:14] [INFO ] Invariant cache hit.
[2023-03-22 14:34:15] [INFO ] Dead Transitions using invariants and state equation in 1363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5026 ms. Remains : 1353/1353 places, 1303/1303 transitions.
Applied a total of 0 rules in 45 ms. Remains 1353 /1353 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-22 14:34:15] [INFO ] Invariant cache hit.
[2023-03-22 14:34:16] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:34:16] [INFO ] [Nat]Absence check using 439 positive place invariants in 210 ms returned sat
[2023-03-22 14:34:16] [INFO ] [Nat]Absence check using 439 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-22 14:34:17] [INFO ] After 1105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:34:18] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 1 ms to minimize.
[2023-03-22 14:34:18] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2023-03-22 14:34:19] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 0 ms to minimize.
[2023-03-22 14:34:19] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 1 ms to minimize.
[2023-03-22 14:34:20] [INFO ] Deduced a trap composed of 4 places in 689 ms of which 1 ms to minimize.
[2023-03-22 14:34:20] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2023-03-22 14:34:20] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 0 ms to minimize.
[2023-03-22 14:34:21] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 1 ms to minimize.
[2023-03-22 14:34:21] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-22 14:34:22] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 1 ms to minimize.
[2023-03-22 14:34:22] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 1 ms to minimize.
[2023-03-22 14:34:23] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-22 14:34:23] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2023-03-22 14:34:23] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 1 ms to minimize.
[2023-03-22 14:34:24] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2023-03-22 14:34:24] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 0 ms to minimize.
[2023-03-22 14:34:25] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2023-03-22 14:34:25] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 1 ms to minimize.
[2023-03-22 14:34:25] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2023-03-22 14:34:26] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 0 ms to minimize.
[2023-03-22 14:34:26] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 1 ms to minimize.
[2023-03-22 14:34:26] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2023-03-22 14:34:27] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 1 ms to minimize.
[2023-03-22 14:34:27] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2023-03-22 14:34:27] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2023-03-22 14:34:28] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 1 ms to minimize.
[2023-03-22 14:34:28] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2023-03-22 14:34:28] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 0 ms to minimize.
[2023-03-22 14:34:29] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-22 14:34:29] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 2 ms to minimize.
[2023-03-22 14:34:29] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-22 14:34:30] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2023-03-22 14:34:30] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2023-03-22 14:34:31] [INFO ] Deduced a trap composed of 7 places in 490 ms of which 2 ms to minimize.
[2023-03-22 14:34:31] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 1 ms to minimize.
[2023-03-22 14:34:31] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 0 ms to minimize.
[2023-03-22 14:34:32] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2023-03-22 14:34:32] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2023-03-22 14:34:32] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-22 14:34:33] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-22 14:34:33] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2023-03-22 14:34:33] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 0 ms to minimize.
[2023-03-22 14:34:34] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2023-03-22 14:34:34] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2023-03-22 14:34:34] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2023-03-22 14:34:34] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-22 14:34:35] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2023-03-22 14:34:35] [INFO ] Deduced a trap composed of 8 places in 320 ms of which 1 ms to minimize.
[2023-03-22 14:34:35] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 0 ms to minimize.
[2023-03-22 14:34:36] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2023-03-22 14:34:36] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-22 14:34:36] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2023-03-22 14:34:37] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 12 ms to minimize.
[2023-03-22 14:34:37] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 1 ms to minimize.
[2023-03-22 14:34:38] [INFO ] Deduced a trap composed of 6 places in 411 ms of which 1 ms to minimize.
[2023-03-22 14:34:38] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-22 14:34:38] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-22 14:34:38] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-22 14:34:39] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 0 ms to minimize.
[2023-03-22 14:34:39] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 21305 ms
[2023-03-22 14:34:39] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2023-03-22 14:34:39] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2023-03-22 14:34:40] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-22 14:34:40] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2023-03-22 14:34:41] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2023-03-22 14:34:41] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 1 ms to minimize.
[2023-03-22 14:34:41] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-22 14:34:41] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 0 ms to minimize.
[2023-03-22 14:34:42] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-22 14:34:42] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 1 ms to minimize.
[2023-03-22 14:34:42] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2023-03-22 14:34:43] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2023-03-22 14:34:43] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 0 ms to minimize.
[2023-03-22 14:34:43] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 14 ms to minimize.
[2023-03-22 14:34:44] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 2 ms to minimize.
[2023-03-22 14:34:44] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2023-03-22 14:34:44] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 0 ms to minimize.
[2023-03-22 14:34:45] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 1 ms to minimize.
[2023-03-22 14:34:45] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 1 ms to minimize.
[2023-03-22 14:34:45] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 0 ms to minimize.
[2023-03-22 14:34:45] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 1 ms to minimize.
[2023-03-22 14:34:46] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 0 ms to minimize.
[2023-03-22 14:34:46] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2023-03-22 14:34:46] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7247 ms
[2023-03-22 14:34:47] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-22 14:34:47] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-22 14:34:47] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 0 ms to minimize.
[2023-03-22 14:34:47] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-22 14:34:48] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2023-03-22 14:34:48] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-22 14:34:48] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-22 14:34:49] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 0 ms to minimize.
[2023-03-22 14:34:49] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2023-03-22 14:34:49] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 14 ms to minimize.
[2023-03-22 14:34:49] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 1 ms to minimize.
[2023-03-22 14:34:50] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 1 ms to minimize.
[2023-03-22 14:34:50] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2023-03-22 14:34:50] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2023-03-22 14:34:50] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4141 ms
[2023-03-22 14:34:50] [INFO ] After 34313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 766 ms.
[2023-03-22 14:34:51] [INFO ] After 35624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:34:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-22 14:34:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1353 places, 1303 transitions and 5975 arcs took 9 ms.
[2023-03-22 14:34:52] [INFO ] Flatten gal took : 182 ms
Total runtime 155185 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPs_PT_050B
(NrP: 1353 NrTr: 1303 NrArc: 5975)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.161sec

net check time: 0m 0.000sec

init dd package: 0m 2.900sec


before gc: list nodes free: 444742

after gc: idd nodes used:77763, unused:63922237; list nodes free:282756504

before gc: list nodes free: 1636938

after gc: idd nodes used:133417, unused:63866583; list nodes free:284599531

before gc: list nodes free: 214869

after gc: idd nodes used:173228, unused:63826772; list nodes free:284415733

before gc: list nodes free: 79221

after gc: idd nodes used:228651, unused:63771349; list nodes free:284164267

before gc: list nodes free: 1810943

after gc: idd nodes used:240202, unused:63759798; list nodes free:286207887

before gc: list nodes free: 2788199

after gc: idd nodes used:253372, unused:63746628; list nodes free:286148424

before gc: list nodes free: 3186857

after gc: idd nodes used:235909, unused:63764091; list nodes free:286229189

before gc: list nodes free: 3468518

after gc: idd nodes used:251066, unused:63748934; list nodes free:286154416

before gc: list nodes free: 2384325

after gc: idd nodes used:280383, unused:63719617; list nodes free:286017116

before gc: list nodes free: 1174810

after gc: idd nodes used:289840, unused:63710160; list nodes free:285982074

before gc: list nodes free: 2597587

after gc: idd nodes used:338471, unused:63661529; list nodes free:285758072

before gc: list nodes free: 924654

after gc: idd nodes used:346890, unused:63653110; list nodes free:285721135

before gc: list nodes free: 3026711

after gc: idd nodes used:378859, unused:63621141; list nodes free:285576328
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6219916 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094584 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.009sec

43421 67730 79274 76491 86589 110580 125654 155926 162743 162992 171589 170757 191941 228939 235260 240090 240695 237676 237796 261129 252259 259104 241611 238841 240132 238762 242849 236861 245775 257805 276356 278479 287244 316713 325889 322184 331508 345620 339599 343121 345653 367299 372882 380100

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-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is ShieldIIPs-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717600159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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