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

About the Execution of Marcie+red for Echo-PT-d04r03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7195.371 3600000.00 3658864.00 7567.00 FTTTTTT?TTF?TFTF 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.r170-tall-167838856700111.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 Echo-PT-d04r03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856700111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 14:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 14:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 530K Mar 5 18:22 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 Echo-PT-d04r03-ReachabilityFireability-00
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-01
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-02
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-03
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-04
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-05
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-06
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-07
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-08
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-09
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-10
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-11
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-12
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-13
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-14
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678486697930

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=Echo-PT-d04r03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 22:18:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 22:18:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:18:19] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-10 22:18:19] [INFO ] Transformed 1019 places.
[2023-03-10 22:18:19] [INFO ] Transformed 850 transitions.
[2023-03-10 22:18:19] [INFO ] Found NUPN structural information;
[2023-03-10 22:18:19] [INFO ] Parsed PT model containing 1019 places and 850 transitions and 6340 arcs in 246 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 61 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 16) seen :9
FORMULA Echo-PT-d04r03-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :1
FORMULA Echo-PT-d04r03-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :1
FORMULA Echo-PT-d04r03-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 850 rows 1019 cols
[2023-03-10 22:18:20] [INFO ] Computed 513 place invariants in 60 ms
[2023-03-10 22:18:21] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 22:18:21] [INFO ] [Nat]Absence check using 115 positive place invariants in 106 ms returned sat
[2023-03-10 22:18:22] [INFO ] [Nat]Absence check using 115 positive and 398 generalized place invariants in 82 ms returned sat
[2023-03-10 22:18:34] [INFO ] After 12083ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-10 22:18:36] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 9 ms to minimize.
[2023-03-10 22:18:36] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2023-03-10 22:18:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2023-03-10 22:18:37] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2023-03-10 22:18:38] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
[2023-03-10 22:18:38] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2023-03-10 22:18:38] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2023-03-10 22:18:39] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2023-03-10 22:18:39] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2023-03-10 22:18:39] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 0 ms to minimize.
[2023-03-10 22:18:40] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2023-03-10 22:18:40] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2023-03-10 22:18:40] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 4 ms to minimize.
[2023-03-10 22:18:41] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2023-03-10 22:18:41] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 1 ms to minimize.
[2023-03-10 22:18:41] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 0 ms to minimize.
[2023-03-10 22:18:41] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 0 ms to minimize.
[2023-03-10 22:18:42] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2023-03-10 22:18:42] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2023-03-10 22:18:42] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2023-03-10 22:18:43] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2023-03-10 22:18:43] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2023-03-10 22:18:43] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2023-03-10 22:18:44] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-10 22:18:44] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-03-10 22:18:44] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-10 22:18:45] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2023-03-10 22:18:45] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2023-03-10 22:18:45] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2023-03-10 22:18:46] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2023-03-10 22:18:46] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2023-03-10 22:18:46] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:18:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 22:18:46] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA Echo-PT-d04r03-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d04r03-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d04r03-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 59 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 850/850 transitions.
Graph (complete) has 4450 edges and 1019 vertex of which 921 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.8 ms
Discarding 98 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 921 transition count 841
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 920 transition count 840
Applied a total of 10 rules in 153 ms. Remains 920 /1019 variables (removed 99) and now considering 840/850 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 920/1019 places, 840/850 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 419499 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 419499 steps, saw 76081 distinct states, run finished after 3002 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 920 cols
[2023-03-10 22:18:50] [INFO ] Computed 416 place invariants in 736 ms
[2023-03-10 22:18:51] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:19:00] [INFO ] [Nat]Absence check using 0 positive and 416 generalized place invariants in 9426 ms returned sat
[2023-03-10 22:19:14] [INFO ] After 13510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 22:19:16] [INFO ] After 15255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-10 22:19:16] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 64 ms.
Support contains 59 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 840/840 transitions.
Applied a total of 0 rules in 43 ms. Remains 920 /920 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 920/920 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 840/840 transitions.
Applied a total of 0 rules in 45 ms. Remains 920 /920 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2023-03-10 22:19:16] [INFO ] Invariant cache hit.
[2023-03-10 22:21:56] [INFO ] Performed 614/920 implicitness test of which 3 returned IMPLICIT in 159 seconds.
[2023-03-10 22:21:56] [INFO ] Implicit Places using invariants in 160024 ms returned [162, 196, 353]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 160034 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 917/920 places, 840/840 transitions.
Applied a total of 0 rules in 55 ms. Remains 917 /917 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 160139 ms. Remains : 917/920 places, 840/840 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 401853 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401853 steps, saw 73330 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 917 cols
[2023-03-10 22:22:00] [INFO ] Computed 413 place invariants in 711 ms
[2023-03-10 22:22:00] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:22:10] [INFO ] [Nat]Absence check using 0 positive and 413 generalized place invariants in 9482 ms returned sat
[2023-03-10 22:22:22] [INFO ] After 12468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 22:22:25] [INFO ] After 14947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-10 22:22:25] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 59 ms.
Support contains 59 out of 917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 917/917 places, 840/840 transitions.
Applied a total of 0 rules in 25 ms. Remains 917 /917 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 917/917 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 917/917 places, 840/840 transitions.
Applied a total of 0 rules in 23 ms. Remains 917 /917 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2023-03-10 22:22:25] [INFO ] Invariant cache hit.
[2023-03-10 22:23:56] [INFO ] Performed 259/917 implicitness test of which 2 returned IMPLICIT in 90 seconds.
[2023-03-10 22:25:02] [INFO ] Performed 421/917 implicitness test of which 2 returned IMPLICIT in 156 seconds.
[2023-03-10 22:25:05] [INFO ] Implicit Places using invariants in 160044 ms returned [70, 259]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 160050 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 915/917 places, 840/840 transitions.
Applied a total of 0 rules in 22 ms. Remains 915 /915 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 160096 ms. Remains : 915/917 places, 840/840 transitions.
[2023-03-10 22:25:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-10 22:25:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 915 places, 840 transitions and 5741 arcs took 11 ms.
[2023-03-10 22:25:06] [INFO ] Flatten gal took : 195 ms
Total runtime 406702 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: Echo_PT_d04r03
(NrP: 915 NrTr: 840 NrArc: 5741)

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

net check time: 0m 0.000sec

init dd package: 0m 2.801sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8952672 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100028 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.008sec

7600388

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="Echo-PT-d04r03"
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 Echo-PT-d04r03, 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 r170-tall-167838856700111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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