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

About the Execution of Marcie+red for TokenRing-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5548.552 332465.00 353227.00 3421.70 FTFFFFFFFFTTTTFT 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.r490-tall-167912709000678.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 TokenRing-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709000678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 130M
-rw-r--r-- 1 mcc users 700K Feb 25 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 25 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4M Feb 25 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 20M Feb 25 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 246K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 823K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3M Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 725K Feb 25 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 25 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17M Feb 25 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62M Feb 25 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 121K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.0M 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 TokenRing-PT-020-ReachabilityCardinality-00
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-01
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-02
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-03
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-04
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-05
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-06
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-07
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-08
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-09
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-10
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-11
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-12
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-13
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-14
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679315628471

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=TokenRing-PT-020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 12:33:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 12:33:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:33:50] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2023-03-20 12:33:50] [INFO ] Transformed 441 places.
[2023-03-20 12:33:50] [INFO ] Transformed 8421 transitions.
[2023-03-20 12:33:50] [INFO ] Parsed PT model containing 441 places and 8421 transitions and 33684 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 153 ms.
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 8) seen :4
FORMULA TokenRing-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 12:33:52] [INFO ] Computed 21 place invariants in 47 ms
[2023-03-20 12:33:52] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 12:33:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 12:33:54] [INFO ] After 1448ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-20 12:33:54] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 12:33:59] [INFO ] After 5229ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-20 12:34:00] [INFO ] Deduced a trap composed of 250 places in 579 ms of which 7 ms to minimize.
[2023-03-20 12:34:01] [INFO ] Deduced a trap composed of 255 places in 531 ms of which 1 ms to minimize.
[2023-03-20 12:34:02] [INFO ] Deduced a trap composed of 246 places in 494 ms of which 1 ms to minimize.
[2023-03-20 12:34:02] [INFO ] Deduced a trap composed of 245 places in 515 ms of which 1 ms to minimize.
[2023-03-20 12:34:03] [INFO ] Deduced a trap composed of 243 places in 538 ms of which 0 ms to minimize.
[2023-03-20 12:34:04] [INFO ] Deduced a trap composed of 246 places in 512 ms of which 1 ms to minimize.
[2023-03-20 12:34:05] [INFO ] Deduced a trap composed of 246 places in 475 ms of which 0 ms to minimize.
[2023-03-20 12:34:05] [INFO ] Deduced a trap composed of 246 places in 481 ms of which 1 ms to minimize.
[2023-03-20 12:34:06] [INFO ] Deduced a trap composed of 246 places in 512 ms of which 1 ms to minimize.
[2023-03-20 12:34:07] [INFO ] Deduced a trap composed of 245 places in 499 ms of which 0 ms to minimize.
[2023-03-20 12:34:08] [INFO ] Deduced a trap composed of 243 places in 483 ms of which 1 ms to minimize.
[2023-03-20 12:34:08] [INFO ] Deduced a trap composed of 247 places in 485 ms of which 0 ms to minimize.
[2023-03-20 12:34:09] [INFO ] Deduced a trap composed of 246 places in 475 ms of which 1 ms to minimize.
[2023-03-20 12:34:10] [INFO ] Deduced a trap composed of 247 places in 473 ms of which 1 ms to minimize.
[2023-03-20 12:34:10] [INFO ] Deduced a trap composed of 243 places in 464 ms of which 1 ms to minimize.
[2023-03-20 12:34:11] [INFO ] Deduced a trap composed of 242 places in 479 ms of which 1 ms to minimize.
[2023-03-20 12:34:12] [INFO ] Deduced a trap composed of 246 places in 473 ms of which 1 ms to minimize.
[2023-03-20 12:34:12] [INFO ] Deduced a trap composed of 242 places in 471 ms of which 0 ms to minimize.
[2023-03-20 12:34:13] [INFO ] Deduced a trap composed of 247 places in 471 ms of which 0 ms to minimize.
[2023-03-20 12:34:14] [INFO ] Deduced a trap composed of 244 places in 485 ms of which 1 ms to minimize.
[2023-03-20 12:34:15] [INFO ] Deduced a trap composed of 245 places in 520 ms of which 0 ms to minimize.
[2023-03-20 12:34:15] [INFO ] Deduced a trap composed of 246 places in 484 ms of which 2 ms to minimize.
[2023-03-20 12:34:16] [INFO ] Deduced a trap composed of 246 places in 516 ms of which 1 ms to minimize.
[2023-03-20 12:34:17] [INFO ] Deduced a trap composed of 244 places in 511 ms of which 1 ms to minimize.
[2023-03-20 12:34:18] [INFO ] Deduced a trap composed of 245 places in 480 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 12:34:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 12:34:18] [INFO ] After 25483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA TokenRing-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TokenRing-PT-020-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 74 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 348 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 42311 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42311 steps, saw 10008 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 12:34:22] [INFO ] Invariant cache hit.
[2023-03-20 12:34:22] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:34:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 12:34:23] [INFO ] After 1412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:34:23] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 12:34:28] [INFO ] After 4712ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 12:34:29] [INFO ] Deduced a trap composed of 248 places in 528 ms of which 1 ms to minimize.
[2023-03-20 12:34:30] [INFO ] Deduced a trap composed of 249 places in 531 ms of which 0 ms to minimize.
[2023-03-20 12:34:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1685 ms
[2023-03-20 12:34:31] [INFO ] After 7291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 807 ms.
[2023-03-20 12:34:31] [INFO ] After 9700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 75 ms.
Support contains 74 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 260 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 225 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 12:34:32] [INFO ] Invariant cache hit.
[2023-03-20 12:34:32] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-20 12:34:32] [INFO ] Invariant cache hit.
[2023-03-20 12:34:34] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2023-03-20 12:34:35] [INFO ] Redundant transitions in 1409 ms returned []
[2023-03-20 12:34:35] [INFO ] Invariant cache hit.
[2023-03-20 12:34:38] [INFO ] Dead Transitions using invariants and state equation in 2310 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5921 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 5864 edges and 441 vertex of which 351 / 441 are part of one of the 20 SCC in 9 ms
Free SCC test removed 331 places
Drop transitions removed 5852 transitions
Ensure Unique test removed 2198 transitions
Reduce isomorphic transitions removed 8050 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 110 transition count 362
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 101 transition count 359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 98 transition count 359
Drop transitions removed 232 transitions
Redundant transition composition rules discarded 232 transitions
Iterating global reduction 3 with 232 rules applied. Total rules applied 257 place count 98 transition count 127
Applied a total of 257 rules in 41 ms. Remains 98 /441 variables (removed 343) and now considering 127/8421 (removed 8294) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 98 cols
[2023-03-20 12:34:38] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 12:34:38] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:34:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-20 12:34:38] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:34:38] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-20 12:34:38] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 12:34:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-20 12:34:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 441 places, 8421 transitions and 33684 arcs took 35 ms.
[2023-03-20 12:34:39] [INFO ] Flatten gal took : 385 ms
Total runtime 48935 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: TokenRing_PT_020
(NrP: 441 NrTr: 8421 NrArc: 33684)

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

net check time: 0m 0.006sec

init dd package: 0m 2.784sec


RS generation: 4m33.372sec


-> reachability set: #nodes 77452 (7.7e+04) #states 24,466,267,459 (10)



starting MCC model checker
--------------------------

checking: AG [[[[[[[[~ [p121<=0] | ~ [1<=p354]] & ~ [p343<=0]] | [~ [p367<=0] & p121<=p148]] | [[[[~ [1<=p52] | [~ [p47<=p85] | ~ [p400<=1]]] | [[1<=p296 | [[[p164<=p136 | 1<=p258] & ~ [p337<=0]] & ~ [p16<=0]]] | ~ [p97<=p341]]] & [[1<=p17 | p289<=p94] | ~ [p238<=p108]]] & p157<=1]] | [~ [p102<=p239] | ~ [1<=p269]]] | [[~ [p134<=1] | ~ [p74<=0]] | [1<=p272 | ~ [1<=p63]]]] & p270<=1]]
normalized: ~ [E [true U ~ [[[[[[[~ [p367<=0] & p121<=p148] | [~ [p343<=0] & [~ [1<=p354] | ~ [p121<=0]]]] | [[[~ [p238<=p108] | [1<=p17 | p289<=p94]] & [[~ [p97<=p341] | [[[~ [p337<=0] & [p164<=p136 | 1<=p258]] & ~ [p16<=0]] | 1<=p296]] | [~ [1<=p52] | [~ [p400<=1] | ~ [p47<=p85]]]]] & p157<=1]] | [~ [1<=p269] | ~ [p102<=p239]]] | [[~ [p134<=1] | ~ [p74<=0]] | [~ [1<=p63] | 1<=p272]]] & p270<=1]]]]

abstracting: (p270<=1)
states: 24,466,267,459 (10)
abstracting: (1<=p272)
states: 4,334,375,781 (9)
abstracting: (1<=p63)
states: 1,064,021 (6)
abstracting: (p74<=0)
states: 23,958,233,548 (10)
abstracting: (p134<=1)
states: 24,466,267,459 (10)
abstracting: (p102<=p239)
states: 24,466,267,438 (10)
abstracting: (1<=p269)
states: 3,797,575,621 (9)
abstracting: (p157<=1)
states: 24,466,267,459 (10)
abstracting: (p47<=p85)
states: 24,466,267,438 (10)
abstracting: (p400<=1)
states: 24,466,267,459 (10)
abstracting: (1<=p52)
states: 153,105,897 (8)
abstracting: (1<=p296)
states: 2,468,424,161 (9)
abstracting: (p16<=0)
states: 24,466,267,438 (10)
abstracting: (1<=p258)
states: 546,796,271 (8)
abstracting: (p164<=p136)
states: 23,573,895,958 (10)
abstracting: (p337<=0)
states: 22,981,245,298 (10)
abstracting: (p97<=p341)
states: 24,466,267,438 (10)
abstracting: (p289<=p94)
states: 20,926,527,234 (10)
abstracting: (1<=p17)
states: 4,045,417,397 (9)
abstracting: (p238<=p108)
states: 24,466,267,438 (10)
abstracting: (p121<=0)
states: 24,466,267,438 (10)
abstracting: (1<=p354)
states: 4,391,194,521 (9)
abstracting: (p343<=0)
states: 24,466,267,438 (10)
abstracting: (p121<=p148)
states: 24,466,267,438 (10)
abstracting: (p367<=0)
states: 24,466,267,438 (10)
-> the formula is TRUE

FORMULA TokenRing-PT-020-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.770sec

checking: AG [[[[[[[[[1<=p400 & p239<=p301] & [[[[~ [p62<=p410] & ~ [p115<=p412]] & [~ [p99<=p43] & ~ [1<=p2]]] | ~ [p238<=p188]] & [1<=p36 | 1<=p43]]] | [[1<=p79 & [[[[~ [1<=p264] & ~ [p440<=0]] | [p255<=0 & p378<=p105]] | [~ [1<=p77] & ~ [p207<=p12]]] | [p121<=1 | ~ [p50<=0]]]] & 1<=p69]] | [~ [p62<=p114] | ~ [p152<=p342]]] & [[[[p13<=p232 & p108<=p210] & [p140<=1 & 1<=p355]] | 1<=p72] | p381<=p344]] & p29<=p93] | [[[p311<=p417 & p138<=p56] & ~ [p145<=p92]] & [[~ [p338<=0] & ~ [p248<=1]] & p29<=0]]] | [~ [1<=p373] | ~ [1<=p92]]]]
normalized: ~ [E [true U ~ [[[~ [1<=p92] | ~ [1<=p373]] | [[[p29<=0 & [~ [p248<=1] & ~ [p338<=0]]] & [~ [p145<=p92] & [p311<=p417 & p138<=p56]]] | [p29<=p93 & [[p381<=p344 | [1<=p72 | [[p140<=1 & 1<=p355] & [p13<=p232 & p108<=p210]]]] & [[~ [p152<=p342] | ~ [p62<=p114]] | [[1<=p69 & [1<=p79 & [[p121<=1 | ~ [p50<=0]] | [[~ [p207<=p12] & ~ [1<=p77]] | [[p255<=0 & p378<=p105] | [~ [p440<=0] & ~ [1<=p264]]]]]]] | [[[1<=p36 | 1<=p43] & [~ [p238<=p188] | [[~ [1<=p2] & ~ [p99<=p43]] & [~ [p115<=p412] & ~ [p62<=p410]]]]] & [1<=p400 & p239<=p301]]]]]]]]]]]

abstracting: (p239<=p301)
states: 24,403,315,978 (10)
abstracting: (1<=p400)
states: 4,131,428,421 (9)
abstracting: (p62<=p410)
states: 24,449,020,663 (10)
abstracting: (p115<=p412)
states: 24,466,267,438 (10)
abstracting: (p99<=p43)
states: 20,956,589,422 (10)
abstracting: (1<=p2)
states: 21
abstracting: (p238<=p188)
states: 24,466,267,438 (10)
abstracting: (1<=p43)
states: 1,147,334,781 (9)
abstracting: (1<=p36)
states: 21
abstracting: (1<=p264)
states: 21
abstracting: (p440<=0)
states: 19,723,777,378 (10)
abstracting: (p378<=p105)
states: 23,792,844,689 (10)
abstracting: (p255<=0)
states: 24,466,265,920 (10)
abstracting: (1<=p77)
states: 21
abstracting: (p207<=p12)
states: 24,466,267,438 (10)
abstracting: (p50<=0)
states: 17,925,098,490 (10)
abstracting: (p121<=1)
states: 24,466,267,459 (10)
abstracting: (1<=p79)
states: 21
abstracting: (1<=p69)
states: 21
abstracting: (p62<=p114)
states: 24,449,694,973 (10)
abstracting: (p152<=p342)
states: 24,466,267,438 (10)
abstracting: (p108<=p210)
states: 13,128,241,260 (10)
abstracting: (p13<=p232)
states: 24,466,267,438 (10)
abstracting: (1<=p355)
states: 3,380,259,621 (9)
abstracting: (p140<=1)
states: 24,466,267,459 (10)
abstracting: (1<=p72)
states: 2,178,301,685 (9)
abstracting: (p381<=p344)
states: 23,839,049,158 (10)
abstracting: (p29<=p93)
states: 24,466,267,438 (10)
abstracting: (p138<=p56)
states: 21,916,634,638 (10)
abstracting: (p311<=p417)
states: 24,416,169,390 (10)
abstracting: (p145<=p92)
states: 24,464,343,373 (10)
abstracting: (p338<=0)
states: 24,420,681,898 (10)
abstracting: (p248<=1)
states: 24,466,267,459 (10)
abstracting: (p29<=0)
states: 24,466,267,438 (10)
abstracting: (1<=p373)
states: 4,079,412,501 (9)
abstracting: (1<=p92)
states: 21
-> the formula is TRUE

FORMULA TokenRing-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.995sec

totally nodes used: 1074727 (1.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 127281878 1235546608 1362828486
used/not used/entry size/cache size: 67106352 2512 16 1024MB
basic ops cache: hits/miss/sum: 211350 3806197 4017547
used/not used/entry size/cache size: 4351221 12425995 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 32640 451133 483773
used/not used/entry size/cache size: 440462 7948146 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66179191
1 802887
2 110065
3 15209
4 1477
5 35
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 4m41.011sec


BK_STOP 1679315960936

--------------------
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 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: 0m 0.206sec

1621 2340 2740 3434 2510 3792 2973 4507 3961 2971 5096 4613 3962 4483 5643 5223 4698 3816 6547 6253 5896 5434 4846 8054 39301 43396 46777 49927 52783 55555 57497 59457 59163 58827 58428 57945 57273 58495 60679 65421 69721 73041
iterations count:4259826 (505), effective:1790 (0)

initing FirstDep: 0m 0.187sec

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="TokenRing-PT-020"
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 TokenRing-PT-020, 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 r490-tall-167912709000678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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