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-167903717800351.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 ShieldIIPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 1.7M 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 ShieldIIPt-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679507664943

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=ShieldIIPt-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:54:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:54:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:54:27] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2023-03-22 17:54:27] [INFO ] Transformed 7003 places.
[2023-03-22 17:54:27] [INFO ] Transformed 6503 transitions.
[2023-03-22 17:54:27] [INFO ] Found NUPN structural information;
[2023-03-22 17:54:27] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 698 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 502 ms. (steps per millisecond=19 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 6503 rows 7003 cols
[2023-03-22 17:54:29] [INFO ] Computed 901 place invariants in 49 ms
[2023-03-22 17:54:31] [INFO ] After 2310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 17:54:34] [INFO ] [Nat]Absence check using 901 positive place invariants in 745 ms returned sat
[2023-03-22 17:54:56] [INFO ] After 21226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 17:54:56] [INFO ] After 21250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 17:54:56] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 371 ms.
Support contains 208 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1530 transitions
Trivial Post-agglo rules discarded 1530 transitions
Performed 1530 trivial Post agglomeration. Transition count delta: 1530
Iterating post reduction 0 with 1530 rules applied. Total rules applied 1530 place count 7003 transition count 4973
Reduce places removed 1530 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 1 with 1577 rules applied. Total rules applied 3107 place count 5473 transition count 4926
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 3154 place count 5426 transition count 4926
Performed 426 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 426 Pre rules applied. Total rules applied 3154 place count 5426 transition count 4500
Deduced a syphon composed of 426 places in 20 ms
Reduce places removed 426 places and 0 transitions.
Iterating global reduction 3 with 852 rules applied. Total rules applied 4006 place count 5000 transition count 4500
Discarding 693 places :
Symmetric choice reduction at 3 with 693 rule applications. Total rules 4699 place count 4307 transition count 3807
Iterating global reduction 3 with 693 rules applied. Total rules applied 5392 place count 4307 transition count 3807
Performed 267 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 267 Pre rules applied. Total rules applied 5392 place count 4307 transition count 3540
Deduced a syphon composed of 267 places in 16 ms
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 3 with 534 rules applied. Total rules applied 5926 place count 4040 transition count 3540
Performed 1588 Post agglomeration using F-continuation condition.Transition count delta: 1588
Deduced a syphon composed of 1588 places in 5 ms
Reduce places removed 1588 places and 0 transitions.
Iterating global reduction 3 with 3176 rules applied. Total rules applied 9102 place count 2452 transition count 1952
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 101 places in 14 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9304 place count 2351 transition count 2005
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 101 places in 28 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9506 place count 2250 transition count 2061
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 62 places in 10 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 9630 place count 2188 transition count 2096
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 9642 place count 2188 transition count 2084
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 9654 place count 2176 transition count 2084
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 4 with 96 rules applied. Total rules applied 9750 place count 2176 transition count 2084
Applied a total of 9750 rules in 2592 ms. Remains 2176 /7003 variables (removed 4827) and now considering 2084/6503 (removed 4419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2605 ms. Remains : 2176/7003 places, 2084/6503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 80008 steps, run timeout after 6001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 80008 steps, saw 42968 distinct states, run finished after 6003 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2084 rows 2176 cols
[2023-03-22 17:55:07] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-22 17:55:08] [INFO ] After 603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 17:55:09] [INFO ] [Nat]Absence check using 901 positive place invariants in 208 ms returned sat
[2023-03-22 17:55:13] [INFO ] After 3927ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 17:55:13] [INFO ] State equation strengthened by 686 read => feed constraints.
[2023-03-22 17:55:26] [INFO ] After 12536ms SMT Verify possible using 686 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 17:55:26] [INFO ] Deduced a trap composed of 6 places in 372 ms of which 10 ms to minimize.
[2023-03-22 17:55:27] [INFO ] Deduced a trap composed of 5 places in 365 ms of which 1 ms to minimize.
[2023-03-22 17:55:27] [INFO ] Deduced a trap composed of 12 places in 377 ms of which 14 ms to minimize.
[2023-03-22 17:55:28] [INFO ] Deduced a trap composed of 8 places in 443 ms of which 1 ms to minimize.
[2023-03-22 17:55:28] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2023-03-22 17:55:29] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 2 ms to minimize.
[2023-03-22 17:55:29] [INFO ] Deduced a trap composed of 7 places in 502 ms of which 10 ms to minimize.
[2023-03-22 17:55:30] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2023-03-22 17:55:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3977 ms
[2023-03-22 17:55:30] [INFO ] Deduced a trap composed of 14 places in 467 ms of which 1 ms to minimize.
[2023-03-22 17:55:31] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 1 ms to minimize.
[2023-03-22 17:55:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1157 ms
[2023-03-22 17:55:32] [INFO ] Deduced a trap composed of 8 places in 334 ms of which 1 ms to minimize.
[2023-03-22 17:55:33] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 0 ms to minimize.
[2023-03-22 17:55:33] [INFO ] Deduced a trap composed of 11 places in 326 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 17:55:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 17:55:33] [INFO ] After 25160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 485 ms.
Support contains 208 out of 2176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2176/2176 places, 2084/2084 transitions.
Applied a total of 0 rules in 169 ms. Remains 2176 /2176 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 2176/2176 places, 2084/2084 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2176/2176 places, 2084/2084 transitions.
Applied a total of 0 rules in 144 ms. Remains 2176 /2176 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2023-03-22 17:55:34] [INFO ] Invariant cache hit.
[2023-03-22 17:55:36] [INFO ] Implicit Places using invariants in 1797 ms returned []
[2023-03-22 17:55:36] [INFO ] Invariant cache hit.
[2023-03-22 17:55:37] [INFO ] State equation strengthened by 686 read => feed constraints.
[2023-03-22 17:55:54] [INFO ] Implicit Places using invariants and state equation in 18364 ms returned []
Implicit Place search using SMT with State Equation took 20169 ms to find 0 implicit places.
[2023-03-22 17:55:54] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-22 17:55:54] [INFO ] Invariant cache hit.
[2023-03-22 17:55:56] [INFO ] Dead Transitions using invariants and state equation in 1424 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21908 ms. Remains : 2176/2176 places, 2084/2084 transitions.
Partial Free-agglomeration rule applied 354 times.
Drop transitions removed 354 transitions
Iterating global reduction 0 with 354 rules applied. Total rules applied 354 place count 2176 transition count 2084
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 357 place count 2176 transition count 2081
Applied a total of 357 rules in 213 ms. Remains 2176 /2176 variables (removed 0) and now considering 2081/2084 (removed 3) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 2081 rows 2176 cols
[2023-03-22 17:55:56] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-22 17:55:57] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 17:55:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 323 ms returned sat
[2023-03-22 17:56:01] [INFO ] After 2554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 17:56:01] [INFO ] State equation strengthened by 336 read => feed constraints.
[2023-03-22 17:56:09] [INFO ] After 8722ms SMT Verify possible using 336 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-22 17:56:10] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 1 ms to minimize.
[2023-03-22 17:56:10] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2023-03-22 17:56:11] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 1 ms to minimize.
[2023-03-22 17:56:11] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2023-03-22 17:56:11] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 1 ms to minimize.
[2023-03-22 17:56:12] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 0 ms to minimize.
[2023-03-22 17:56:12] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 0 ms to minimize.
[2023-03-22 17:56:13] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 0 ms to minimize.
[2023-03-22 17:56:13] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 0 ms to minimize.
[2023-03-22 17:56:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3708 ms
[2023-03-22 17:56:14] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-22 17:56:15] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2023-03-22 17:56:15] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 1 ms to minimize.
[2023-03-22 17:56:15] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 1 ms to minimize.
[2023-03-22 17:56:16] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 1 ms to minimize.
[2023-03-22 17:56:16] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 1 ms to minimize.
[2023-03-22 17:56:17] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2023-03-22 17:56:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2974 ms
[2023-03-22 17:56:26] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 1 ms to minimize.
[2023-03-22 17:56:26] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2023-03-22 17:56:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1080 ms
[2023-03-22 17:56:28] [INFO ] Deduced a trap composed of 12 places in 360 ms of which 1 ms to minimize.
[2023-03-22 17:56:28] [INFO ] Deduced a trap composed of 14 places in 391 ms of which 1 ms to minimize.
[2023-03-22 17:56:29] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 6 ms to minimize.
[2023-03-22 17:56:30] [INFO ] Deduced a trap composed of 7 places in 374 ms of which 1 ms to minimize.
[2023-03-22 17:56:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2698 ms
[2023-03-22 17:56:31] [INFO ] Deduced a trap composed of 9 places in 427 ms of which 1 ms to minimize.
[2023-03-22 17:56:31] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 1 ms to minimize.
[2023-03-22 17:56:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1059 ms
[2023-03-22 17:56:31] [INFO ] After 30687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 5442 ms.
[2023-03-22 17:56:37] [INFO ] After 40061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-22 17:56:37] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-22 17:56:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2176 places, 2084 transitions and 10106 arcs took 11 ms.
[2023-03-22 17:56:37] [INFO ] Flatten gal took : 261 ms
Total runtime 130599 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: ShieldIIPt_PT_100B
(NrP: 2176 NrTr: 2084 NrArc: 10106)

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

net check time: 0m 0.001sec

init dd package: 0m 2.814sec


before gc: list nodes free: 215921

after gc: idd nodes used:12512387, unused:51487613; list nodes free:216705063

before gc: list nodes free: 617117

after gc: idd nodes used:45138035, unused:18861965; list nodes free:80053255

before gc: list nodes free: 1752421

after gc: idd nodes used:45143699, unused:18856301; list nodes free:82099431

RS generation: 52m 9.170sec


-> last computed set: #nodes 45143649 (4.5e+07) #states 7,122,200,839,768,513 (15)


CANNOT_COMPUTE


BK_STOP 1679510957972

--------------------
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.023sec

64523 105186idd.cc:820: DD Exception: No free nodes

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100B"
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 ShieldIIPt-PT-100B, 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-167903717800351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B 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 ;