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

About the Execution of Marcie+red for RERS17pb114-PT-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6394.420 3600000.00 3691922.00 9365.50 T??F?TT?FTF??F?T 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-167889202800118.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 RERS17pb114-PT-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889202800118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 6.6K Feb 26 04:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 04:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 04:37 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.6K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 04:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 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 73M 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 RERS17pb114-PT-6-ReachabilityCardinality-00
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-01
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-02
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-03
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-04
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-05
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-06
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-07
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-08
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-09
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-10
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-11
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-12
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-13
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-14
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679057470374

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb114-PT-6
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 12:51:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 12:51:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 12:51:14] [INFO ] Load time of PNML (sax parser for PT used): 1965 ms
[2023-03-17 12:51:14] [INFO ] Transformed 1446 places.
[2023-03-17 12:51:14] [INFO ] Transformed 151085 transitions.
[2023-03-17 12:51:14] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2527 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1263 ms. (steps per millisecond=7 ) properties (out of 16) seen :6
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-17 12:51:18] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-17 12:51:18] [INFO ] Computed 35 place invariants in 482 ms
[2023-03-17 12:51:19] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-17 12:51:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2023-03-17 12:51:20] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 23 ms returned sat
[2023-03-17 12:51:44] [INFO ] After 24441ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-17 12:51:47] [INFO ] State equation strengthened by 2342 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 12:51:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 12:51:47] [INFO ] After 27622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 187 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 16 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 528 rules applied. Total rules applied 528 place count 1430 transition count 150573
Applied a total of 528 rules in 2396 ms. Remains 1430 /1446 variables (removed 16) and now considering 150573/151085 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2411 ms. Remains : 1430/1446 places, 150573/151085 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=9 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 5013 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5013 steps, saw 4577 distinct states, run finished after 3011 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-17 12:51:54] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1430 cols
[2023-03-17 12:51:55] [INFO ] Computed 19 place invariants in 322 ms
[2023-03-17 12:51:55] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 12:51:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-17 12:51:55] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 32 ms returned sat
[2023-03-17 12:52:20] [INFO ] After 24512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 12:52:22] [INFO ] State equation strengthened by 2341 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 12:52:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 12:52:22] [INFO ] After 26505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 187 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1301 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1303 ms. Remains : 1430/1430 places, 150573/150573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1154 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2023-03-17 12:52:24] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2023-03-17 12:52:24] [INFO ] Invariant cache hit.
[2023-03-17 12:52:31] [INFO ] Implicit Places using invariants in 7334 ms returned []
Implicit Place search using SMT only with invariants took 7335 ms to find 0 implicit places.
[2023-03-17 12:52:31] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2023-03-17 12:52:31] [INFO ] Invariant cache hit.
[2023-03-17 12:53:02] [INFO ] Performed 93319/150573 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 12:53:20] [INFO ] Dead Transitions using invariants and state equation in 48618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57124 ms. Remains : 1430/1430 places, 150573/150573 transitions.
Ensure Unique test removed 65883 transitions
Reduce isomorphic transitions removed 65883 transitions.
Iterating post reduction 0 with 65883 rules applied. Total rules applied 65883 place count 1430 transition count 84690
Applied a total of 65883 rules in 2852 ms. Remains 1430 /1430 variables (removed 0) and now considering 84690/150573 (removed 65883) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 84690 rows 1430 cols
[2023-03-17 12:53:24] [INFO ] Computed 19 place invariants in 281 ms
[2023-03-17 12:53:24] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 12:53:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-17 12:53:24] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 25 ms returned sat
[2023-03-17 12:53:52] [INFO ] After 27972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 12:53:56] [INFO ] Deduced a trap composed of 97 places in 1969 ms of which 4 ms to minimize.
[2023-03-17 12:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5162 ms
[2023-03-17 12:54:15] [INFO ] After 50881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 7298 ms.
[2023-03-17 12:54:23] [INFO ] After 58659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-17 12:54:23] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-17 12:54:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1430 places, 150573 transitions and 602188 arcs took 294 ms.
[2023-03-17 12:54:29] [INFO ] Flatten gal took : 4283 ms
Total runtime 197217 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RERS17pb114_PT_6
(NrP: 1430 NrTr: 150573 NrArc: 602188)

parse formulas
formulas created successfully
place and transition orderings generation:1m 1.815sec

net check time: 0m 0.164sec

init dd package: 0m 2.626sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10033152 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15918792 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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: 2m33.484sec

1430 2595 3760 4925 4925 6090 7255 8420 8860 11213 13949 14913 16510 18778 20635 20635 21963 27469 36793 58358

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="RERS17pb114-PT-6"
export BK_EXAMINATION="ReachabilityCardinality"
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 RERS17pb114-PT-6, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889202800118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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