fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r330-tall-167889202900175
Last Updated
May 14, 2023

About the Execution of Marcie+red for RERS17pb115-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5915.268 3600000.00 3689214.00 6899.90 ??F????????????? normal

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.r330-tall-167889202900175.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 RERS17pb115-PT-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889202900175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 13:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 13:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M 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 RERS17pb115-PT-4-ReachabilityFireability-00
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-01
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-02
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-03
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-04
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-05
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-06
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-07
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-08
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-09
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-10
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-11
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-12
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-13
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-14
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679084152452

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=RERS17pb115-PT-4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 20:15:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 20:15:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 20:15:56] [INFO ] Load time of PNML (sax parser for PT used): 1929 ms
[2023-03-17 20:15:56] [INFO ] Transformed 1399 places.
[2023-03-17 20:15:56] [INFO ] Transformed 144369 transitions.
[2023-03-17 20:15:56] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2503 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1352 ms. (steps per millisecond=7 ) properties (out of 16) seen :1
FORMULA RERS17pb115-PT-4-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 2997 steps, run timeout after 3001 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 2997 steps, saw 2534 distinct states, run finished after 3003 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-17 20:16:02] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2023-03-17 20:16:02] [INFO ] Computed 37 place invariants in 420 ms
[2023-03-17 20:16:03] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-17 20:16:03] [INFO ] [Real]Absence check using 19 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-17 20:16:03] [INFO ] After 862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-17 20:16:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2023-03-17 20:16:04] [INFO ] [Nat]Absence check using 19 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-17 20:16:28] [INFO ] After 24157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-17 20:16:30] [INFO ] State equation strengthened by 2277 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 20:16:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:16:30] [INFO ] After 27148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 366 out of 1399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Applied a total of 18 rules in 1967 ms. Remains 1381 /1399 variables (removed 18) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1992 ms. Remains : 1381/1399 places, 144369/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1411 ms. (steps per millisecond=7 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 2884 steps, run timeout after 3006 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 2884 steps, saw 2438 distinct states, run finished after 3006 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-17 20:16:38] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 20:16:38] [INFO ] Computed 19 place invariants in 302 ms
[2023-03-17 20:16:39] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2023-03-17 20:16:39] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-17 20:16:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-17 20:17:04] [INFO ] After 24372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-17 20:17:06] [INFO ] State equation strengthened by 2277 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 20:17:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:17:06] [INFO ] After 27363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 366 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1037 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1037 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1633 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 20:17:09] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 20:17:09] [INFO ] Invariant cache hit.
[2023-03-17 20:17:16] [INFO ] Implicit Places using invariants in 6931 ms returned []
Implicit Place search using SMT only with invariants took 6947 ms to find 0 implicit places.
[2023-03-17 20:17:16] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 20:17:16] [INFO ] Invariant cache hit.
[2023-03-17 20:17:46] [INFO ] Performed 92241/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 20:18:02] [INFO ] Dead Transitions using invariants and state equation in 46302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54899 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Ensure Unique test removed 63131 transitions
Reduce isomorphic transitions removed 63131 transitions.
Iterating post reduction 0 with 63131 rules applied. Total rules applied 63131 place count 1381 transition count 81238
Applied a total of 63131 rules in 2731 ms. Remains 1381 /1381 variables (removed 0) and now considering 81238/144369 (removed 63131) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 20:18:05] [INFO ] Computed 19 place invariants in 317 ms
[2023-03-17 20:18:06] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-17 20:18:06] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-17 20:18:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-17 20:18:41] [INFO ] After 34575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-17 20:18:45] [INFO ] Deduced a trap composed of 97 places in 2589 ms of which 6 ms to minimize.
[2023-03-17 20:18:48] [INFO ] Deduced a trap composed of 129 places in 2083 ms of which 1 ms to minimize.
[2023-03-17 20:18:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 8889 ms
[2023-03-17 20:19:29] [INFO ] After 81879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 15337 ms.
[2023-03-17 20:19:44] [INFO ] After 97988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
[2023-03-17 20:19:44] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 15 ms.
[2023-03-17 20:19:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1381 places, 144369 transitions and 577396 arcs took 280 ms.
[2023-03-17 20:19:50] [INFO ] Flatten gal took : 4597 ms
Total runtime 236535 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: RERS17pb115_PT_4
(NrP: 1381 NrTr: 144369 NrArc: 577396)

parse formulas
formulas created successfully
place and transition orderings generation:0m52.646sec

net check time: 0m 0.162sec

init dd package: 0m 2.936sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10063084 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15928436 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: 2m 7.034sec

1381 2746 3523 3523 4996 5116 5366 5372 8261 9209 9209 13319 13823 13813 11758 11758 12233 12434 12414 12144 9431 17481 18019 20868 21233 24102 24105 25699 31876 29533

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="RERS17pb115-PT-4"
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 RERS17pb115-PT-4, 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 r330-tall-167889202900175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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