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.r202-smll-167840348700479.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 HirschbergSinclair-PT-35, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 26 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K 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 HirschbergSinclair-PT-35-ReachabilityFireability-00
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-01
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-02
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-03
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-04
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-05
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-06
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-07
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-08
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-09
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-10
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-11
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-12
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-13
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-14
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678807702510

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=HirschbergSinclair-PT-35
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 15:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 15:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:28:26] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2023-03-14 15:28:26] [INFO ] Transformed 998 places.
[2023-03-14 15:28:26] [INFO ] Transformed 922 transitions.
[2023-03-14 15:28:26] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 16) seen :13
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 922 rows 998 cols
[2023-03-14 15:28:27] [INFO ] Computed 76 place invariants in 35 ms
[2023-03-14 15:28:28] [INFO ] [Real]Absence check using 70 positive place invariants in 100 ms returned sat
[2023-03-14 15:28:28] [INFO ] [Real]Absence check using 70 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-14 15:28:30] [INFO ] After 2299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 15:28:30] [INFO ] [Nat]Absence check using 70 positive place invariants in 76 ms returned sat
[2023-03-14 15:28:30] [INFO ] [Nat]Absence check using 70 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-14 15:28:33] [INFO ] After 3219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 15:28:35] [INFO ] Deduced a trap composed of 18 places in 733 ms of which 6 ms to minimize.
[2023-03-14 15:28:35] [INFO ] Deduced a trap composed of 97 places in 706 ms of which 3 ms to minimize.
[2023-03-14 15:28:36] [INFO ] Deduced a trap composed of 14 places in 379 ms of which 1 ms to minimize.
[2023-03-14 15:28:36] [INFO ] Deduced a trap composed of 160 places in 497 ms of which 3 ms to minimize.
[2023-03-14 15:28:37] [INFO ] Deduced a trap composed of 17 places in 531 ms of which 1 ms to minimize.
[2023-03-14 15:28:38] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 1 ms to minimize.
[2023-03-14 15:28:38] [INFO ] Deduced a trap composed of 17 places in 471 ms of which 1 ms to minimize.
[2023-03-14 15:28:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4271 ms
[2023-03-14 15:28:40] [INFO ] Deduced a trap composed of 38 places in 605 ms of which 2 ms to minimize.
[2023-03-14 15:28:41] [INFO ] Deduced a trap composed of 39 places in 574 ms of which 2 ms to minimize.
[2023-03-14 15:28:42] [INFO ] Deduced a trap composed of 58 places in 659 ms of which 2 ms to minimize.
[2023-03-14 15:28:43] [INFO ] Deduced a trap composed of 17 places in 657 ms of which 2 ms to minimize.
[2023-03-14 15:28:45] [INFO ] Deduced a trap composed of 56 places in 775 ms of which 2 ms to minimize.
[2023-03-14 15:28:46] [INFO ] Deduced a trap composed of 17 places in 602 ms of which 1 ms to minimize.
[2023-03-14 15:28:46] [INFO ] Deduced a trap composed of 60 places in 537 ms of which 1 ms to minimize.
[2023-03-14 15:28:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6933 ms
[2023-03-14 15:28:48] [INFO ] Deduced a trap composed of 107 places in 624 ms of which 1 ms to minimize.
[2023-03-14 15:28:49] [INFO ] Deduced a trap composed of 105 places in 712 ms of which 2 ms to minimize.
[2023-03-14 15:28:50] [INFO ] Deduced a trap composed of 95 places in 744 ms of which 1 ms to minimize.
[2023-03-14 15:28:51] [INFO ] Deduced a trap composed of 32 places in 730 ms of which 1 ms to minimize.
[2023-03-14 15:28:52] [INFO ] Deduced a trap composed of 15 places in 681 ms of which 3 ms to minimize.
[2023-03-14 15:28:53] [INFO ] Deduced a trap composed of 103 places in 705 ms of which 2 ms to minimize.
[2023-03-14 15:28:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 5093 ms
[2023-03-14 15:28:53] [INFO ] After 22631ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 1899 ms.
[2023-03-14 15:28:55] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 64 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 963 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.5 ms
Discarding 35 places :
Also discarding 0 output transitions
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 192 place count 963 transition count 731
Reduce places removed 191 places and 0 transitions.
Graph (complete) has 1404 edges and 772 vertex of which 727 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Discarding 45 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 727 transition count 731
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 429 place count 727 transition count 686
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 450 place count 706 transition count 665
Iterating global reduction 3 with 21 rules applied. Total rules applied 471 place count 706 transition count 665
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 489 place count 688 transition count 647
Iterating global reduction 3 with 18 rules applied. Total rules applied 507 place count 688 transition count 647
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 531 place count 688 transition count 623
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 555 place count 664 transition count 623
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 571 place count 648 transition count 607
Applied a total of 571 rules in 440 ms. Remains 648 /998 variables (removed 350) and now considering 607/922 (removed 315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 648/998 places, 607/922 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 607 rows 648 cols
[2023-03-14 15:28:56] [INFO ] Computed 41 place invariants in 8 ms
[2023-03-14 15:28:56] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 133 ms returned sat
[2023-03-14 15:28:56] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:28:56] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 220 ms returned sat
[2023-03-14 15:28:57] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 15:28:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-14 15:28:57] [INFO ] After 402ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 15:28:58] [INFO ] After 687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 530 ms.
[2023-03-14 15:28:58] [INFO ] After 2385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 648/648 places, 607/607 transitions.
Graph (complete) has 1228 edges and 648 vertex of which 643 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 643 transition count 414
Reduce places removed 189 places and 0 transitions.
Graph (complete) has 812 edges and 454 vertex of which 428 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 190 rules applied. Total rules applied 384 place count 428 transition count 413
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 409 place count 428 transition count 388
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 409 place count 428 transition count 377
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 431 place count 417 transition count 377
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 436 place count 412 transition count 372
Iterating global reduction 3 with 5 rules applied. Total rules applied 441 place count 412 transition count 372
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 444 place count 412 transition count 369
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 749 edges and 409 vertex of which 403 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 448 place count 403 transition count 369
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 454 place count 403 transition count 363
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 455 place count 402 transition count 362
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 402 transition count 362
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 468 place count 402 transition count 350
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 480 place count 390 transition count 350
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 497 place count 373 transition count 333
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 7 with 44 rules applied. Total rules applied 541 place count 368 transition count 294
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 580 place count 329 transition count 294
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 580 place count 329 transition count 276
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 616 place count 311 transition count 276
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 617 place count 310 transition count 276
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 617 place count 310 transition count 275
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 619 place count 309 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 29 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 625 place count 306 transition count 272
Applied a total of 625 rules in 372 ms. Remains 306 /648 variables (removed 342) and now considering 272/607 (removed 335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 372 ms. Remains : 306/648 places, 272/607 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 899 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=299 )
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 33110 ms.
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: HirschbergSinclair_PT_35
(NrP: 998 NrTr: 922 NrArc: 2806)

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

net check time: 0m 0.000sec

init dd package: 0m 3.582sec


RS generation: 17m10.479sec


-> reachability set: #nodes 1137877 (1.1e+06) #states 358,285,199,911,153,820,226,955,357,275,353,047,891,251 (41)



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

checking: EF [IS_FIREABLE [hdl_right_election_35_6_30_5]]
normalized: E [true U IS_FIREABLE [hdl_right_election_35_6_30_5]]

MC time: 2m41.017sec

checking: EF [IS_FIREABLE [reply_35_5_from_right_8]]
normalized: E [true U IS_FIREABLE [reply_35_5_from_right_8]]


before gc: list nodes free: 578133

after gc: idd nodes used:1455318, unused:62544682; list nodes free:262303913
MC time: 2m31.158sec

checking: EF [IS_FIREABLE [hdl_right_election_35_5_8_27]]
normalized: E [true U IS_FIREABLE [hdl_right_election_35_5_8_27]]

MC time: 2m21.034sec

checking: EF [IS_FIREABLE [election_35_6_3_from_left_3]]
normalized: E [true U IS_FIREABLE [election_35_6_3_from_left_3]]

MC time: 2m12.002sec

checking: EF [IS_FIREABLE [hdl_right_election_35_5_6_29]]
normalized: E [true U IS_FIREABLE [hdl_right_election_35_5_6_29]]

MC time: 2m 4.019sec

checking: EF [IS_FIREABLE [election_35_5_8_from_right_27]]
normalized: E [true U IS_FIREABLE [election_35_5_8_from_right_27]]


before gc: list nodes free: 1625707

after gc: idd nodes used:1291244, unused:62708756; list nodes free:267219790
MC time: 1m56.004sec

checking: AG [~ [IS_FIREABLE [hdl_left_election_35_5_8_8]]]
normalized: ~ [E [true U IS_FIREABLE [hdl_left_election_35_5_8_8]]]

MC time: 1m49.066sec

checking: EF [IS_FIREABLE [hdl_left_reply_35_5_23]]
normalized: E [true U IS_FIREABLE [hdl_left_reply_35_5_23]]

MC time: 1m42.026sec

checking: AG [[~ [IS_FIREABLE [election_35_6_25_from_left_25]] | IS_FIREABLE [reply_35_5_from_right_25]]]
normalized: ~ [E [true U ~ [[~ [IS_FIREABLE [election_35_6_25_from_left_25]] | IS_FIREABLE [reply_35_5_from_right_25]]]]]

MC time: 1m36.017sec

checking: EF [[[IS_FIREABLE [hdl_left_election_35_6_9_9] | IS_FIREABLE [start19]] & IS_FIREABLE [election_35_6_29_from_right_6]]]
normalized: E [true U [[IS_FIREABLE [hdl_left_election_35_6_9_9] | IS_FIREABLE [start19]] & IS_FIREABLE [election_35_6_29_from_right_6]]]


before gc: list nodes free: 4004259

after gc: idd nodes used:1212024, unused:62787976; list nodes free:267533041
MC time: 1m30.036sec

checking: EF [~ [[~ [IS_FIREABLE [hdl_right_election_35_3_6_29]] & [[[~ [IS_FIREABLE [election_35_5_5_from_left_5]] & [[IS_FIREABLE [hdl_left_reply_35_5_12] & [IS_FIREABLE [election_28_0_1_from_right_27] & IS_FIREABLE [hdl_right_reply_35_5_6]]] & IS_FIREABLE [hdl_right_reply_35_5_35]]] | [~ [[~ [IS_FIREABLE [election_35_5_19_from_left_19]] & [IS_FIREABLE [reply_35_3_from_left_35] | IS_FIREABLE [hdl_left_election_20_0_1_21]]]] | IS_FIREABLE [hdl_left_reply_9_0_9]]] | IS_FIREABLE [election_35_6_20_from_left_20]]]]]
normalized: E [true U ~ [[[IS_FIREABLE [election_35_6_20_from_left_20] | [[~ [[~ [IS_FIREABLE [election_35_5_19_from_left_19]] & [IS_FIREABLE [reply_35_3_from_left_35] | IS_FIREABLE [hdl_left_election_20_0_1_21]]]] | IS_FIREABLE [hdl_left_reply_9_0_9]] | [[IS_FIREABLE [hdl_right_reply_35_5_35] & [IS_FIREABLE [hdl_left_reply_35_5_12] & [IS_FIREABLE [election_28_0_1_from_right_27] & IS_FIREABLE [hdl_right_reply_35_5_6]]]] & ~ [IS_FIREABLE [election_35_5_5_from_left_5]]]]] & ~ [IS_FIREABLE [hdl_right_election_35_3_6_29]]]]]

MC time: 1m24.120sec

checking: EF [[IS_FIREABLE [reply_28_0_from_left_28] & [IS_FIREABLE [hdl_left_reply_35_4_27] & [~ [IS_FIREABLE [election_35_6_21_from_left_21]] & [[[IS_FIREABLE [start22] | [[[IS_FIREABLE [reply_35_5_from_right_15] & IS_FIREABLE [election_25_0_1_from_left_26]] | ~ [IS_FIREABLE [hdl_right_election_31_0_1_30]]] & [[IS_FIREABLE [hdl_right_election_35_5_30_5] & IS_FIREABLE [election_31_0_1_from_right_30]] & [IS_FIREABLE [hdl_left_election_3_0_1_4] | IS_FIREABLE [hdl_left_reply_29_0_29]]]]] | [IS_FIREABLE [hdl_right_election_35_6_26_9] & ~ [[IS_FIREABLE [hdl_left_election_33_0_1_34] & IS_FIREABLE [hdl_left_reply_35_5_34]]]]] & [[~ [[IS_FIREABLE [reply_35_5_from_left_28] & IS_FIREABLE [hdl_right_reply_35_5_1]]] | IS_FIREABLE [reply_35_5_from_right_7]] | [IS_FIREABLE [election_35_4_4_from_right_31] & ~ [IS_FIREABLE [hdl_right_election_35_3_6_29]]]]]]]]]
normalized: E [true U [IS_FIREABLE [reply_28_0_from_left_28] & [IS_FIREABLE [hdl_left_reply_35_4_27] & [[[[IS_FIREABLE [election_35_4_4_from_right_31] & ~ [IS_FIREABLE [hdl_right_election_35_3_6_29]]] | [IS_FIREABLE [reply_35_5_from_right_7] | ~ [[IS_FIREABLE [reply_35_5_from_left_28] & IS_FIREABLE [hdl_right_reply_35_5_1]]]]] & [[IS_FIREABLE [hdl_right_election_35_6_26_9] & ~ [[IS_FIREABLE [hdl_left_election_33_0_1_34] & IS_FIREABLE [hdl_left_reply_35_5_34]]]] | [IS_FIREABLE [start22] | [[[IS_FIREABLE [hdl_left_election_3_0_1_4] | IS_FIREABLE [hdl_left_reply_29_0_29]] & [IS_FIREABLE [hdl_right_election_35_5_30_5] & IS_FIREABLE [election_31_0_1_from_right_30]]] & [~ [IS_FIREABLE [hdl_right_election_31_0_1_30]] | [IS_FIREABLE [reply_35_5_from_right_15] & IS_FIREABLE [election_25_0_1_from_left_26]]]]]]] & ~ [IS_FIREABLE [election_35_6_21_from_left_21]]]]]]

-> the formula is FALSE

FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.346sec

checking: EF [[~ [[[IS_FIREABLE [election_35_4_3_from_right_32] | [[[~ [IS_FIREABLE [election_35_5_20_from_left_20]] | ~ [[IS_FIREABLE [hdl_left_election_35_3_6_6] | IS_FIREABLE [hdl_right_reply_35_5_23]]]] | ~ [[~ [IS_FIREABLE [elected_35_13]] | [IS_FIREABLE [start4] | IS_FIREABLE [hdl_left_reply_30_0_30]]]]] & [[[~ [IS_FIREABLE [election_21_0_1_from_left_22]] & [IS_FIREABLE [hdl_left_reply_35_5_13] | IS_FIREABLE [hdl_right_reply_35_3_6]]] | [[IS_FIREABLE [election_35_2_1_from_right_34] & IS_FIREABLE [hdl_right_election_35_6_11_24]] & [IS_FIREABLE [reply_35_5_from_left_31] & IS_FIREABLE [reply_35_3_from_left_35]]]] | [[IS_FIREABLE [hdl_right_election_35_5_14_21] & [IS_FIREABLE [reply_35_5_from_right_7] & IS_FIREABLE [reply_35_3_from_left_34]]] | [~ [IS_FIREABLE [reply_35_5_from_left_24]] & [IS_FIREABLE [reply_35_4_from_right_3] | IS_FIREABLE [reply_35_5_from_right_30]]]]]]] & ~ [IS_FIREABLE [hdl_left_election_35_6_11_11]]]] & IS_FIREABLE [hdl_left_reply_35_4_22]]]
normalized: E [true U [IS_FIREABLE [hdl_left_reply_35_4_22] & ~ [[~ [IS_FIREABLE [hdl_left_election_35_6_11_11]] & [IS_FIREABLE [election_35_4_3_from_right_32] | [[[[[IS_FIREABLE [reply_35_4_from_right_3] | IS_FIREABLE [reply_35_5_from_right_30]] & ~ [IS_FIREABLE [reply_35_5_from_left_24]]] | [IS_FIREABLE [hdl_right_election_35_5_14_21] & [IS_FIREABLE [reply_35_5_from_right_7] & IS_FIREABLE [reply_35_3_from_left_34]]]] | [[[IS_FIREABLE [reply_35_5_from_left_31] & IS_FIREABLE [reply_35_3_from_left_35]] & [IS_FIREABLE [election_35_2_1_from_right_34] & IS_FIREABLE [hdl_right_election_35_6_11_24]]] | [[IS_FIREABLE [hdl_left_reply_35_5_13] | IS_FIREABLE [hdl_right_reply_35_3_6]] & ~ [IS_FIREABLE [election_21_0_1_from_left_22]]]]] & [~ [[[IS_FIREABLE [start4] | IS_FIREABLE [hdl_left_reply_30_0_30]] | ~ [IS_FIREABLE [elected_35_13]]]] | [~ [[IS_FIREABLE [hdl_left_election_35_3_6_6] | IS_FIREABLE [hdl_right_reply_35_5_23]]] | ~ [IS_FIREABLE [election_35_5_20_from_left_20]]]]]]]]]]

MC time: 1m24.167sec

checking: AG [[[~ [[~ [[[[IS_FIREABLE [hdl_right_reply_35_5_22] & IS_FIREABLE [hdl_right_reply_35_2_2]] | IS_FIREABLE [reply_35_5_from_right_2]] | ~ [[IS_FIREABLE [hdl_left_election_35_6_13_13] | IS_FIREABLE [elected_35_4]]]]] | [IS_FIREABLE [election_35_1_1_from_left_1] | [[[IS_FIREABLE [election_35_6_23_from_left_23] | IS_FIREABLE [hdl_right_election_20_0_1_19]] | IS_FIREABLE [hdl_left_reply_30_0_30]] & ~ [[IS_FIREABLE [hdl_right_election_29_0_1_28] | IS_FIREABLE [hdl_right_election_35_6_21_14]]]]]]] | IS_FIREABLE [hdl_left_reply_35_5_35]] & [[[IS_FIREABLE [election_35_3_2_from_left_2] | [IS_FIREABLE [hdl_right_election_35_5_1_34] | IS_FIREABLE [hdl_left_election_35_4_11_11]]] | ~ [IS_FIREABLE [hdl_left_reply_35_4_31]]] | ~ [[IS_FIREABLE [hdl_left_election_33_0_1_34] & [[[[IS_FIREABLE [reply_35_4_from_left_29] | IS_FIREABLE [reply_35_5_from_right_30]] & [IS_FIREABLE [hdl_right_election_35_5_13_22] & IS_FIREABLE [start21]]] | [~ [IS_FIREABLE [hdl_right_reply_35_5_16]] & IS_FIREABLE [election_15_0_1_from_right_14]]] & ~ [IS_FIREABLE [election_17_0_1_from_left_18]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[IS_FIREABLE [hdl_left_election_33_0_1_34] & [~ [IS_FIREABLE [election_17_0_1_from_left_18]] & [[IS_FIREABLE [election_15_0_1_from_right_14] & ~ [IS_FIREABLE [hdl_right_reply_35_5_16]]] | [[IS_FIREABLE [hdl_right_election_35_5_13_22] & IS_FIREABLE [start21]] & [IS_FIREABLE [reply_35_4_from_left_29] | IS_FIREABLE [reply_35_5_from_right_30]]]]]]] | [~ [IS_FIREABLE [hdl_left_reply_35_4_31]] | [IS_FIREABLE [election_35_3_2_from_left_2] | [IS_FIREABLE [hdl_right_election_35_5_1_34] | IS_FIREABLE [hdl_left_election_35_4_11_11]]]]] & [IS_FIREABLE [hdl_left_reply_35_5_35] | ~ [[[IS_FIREABLE [election_35_1_1_from_left_1] | [~ [[IS_FIREABLE [hdl_right_election_29_0_1_28] | IS_FIREABLE [hdl_right_election_35_6_21_14]]] & [IS_FIREABLE [hdl_left_reply_30_0_30] | [IS_FIREABLE [election_35_6_23_from_left_23] | IS_FIREABLE [hdl_right_election_20_0_1_19]]]]] | ~ [[~ [[IS_FIREABLE [hdl_left_election_35_6_13_13] | IS_FIREABLE [elected_35_4]]] | [IS_FIREABLE [reply_35_5_from_right_2] | [IS_FIREABLE [hdl_right_reply_35_5_22] & IS_FIREABLE [hdl_right_reply_35_2_2]]]]]]]]]]]]

MC time: 1m18.686sec

checking: EF [[[IS_FIREABLE [election_35_5_27_from_right_8] | [[IS_FIREABLE [hdl_left_reply_35_5_21] | [IS_FIREABLE [election_35_4_13_from_left_13] & IS_FIREABLE [election_35_6_10_from_left_10]]] | ~ [[[IS_FIREABLE [election_35_6_28_from_left_28] & ~ [IS_FIREABLE [election_35_5_9_from_right_26]]] | [IS_FIREABLE [election_35_4_12_from_left_12] & [[IS_FIREABLE [election_35_5_3_from_left_3] & IS_FIREABLE [election_35_6_11_from_left_11]] & ~ [IS_FIREABLE [hdl_left_reply_35_5_12]]]]]]]] & [IS_FIREABLE [hdl_right_election_35_5_32_3] & [[IS_FIREABLE [hdl_right_reply_35_4_12] & IS_FIREABLE [hdl_left_election_21_0_1_22]] | [IS_FIREABLE [hdl_left_election_5_0_1_6] | [[[[~ [IS_FIREABLE [election_35_5_30_from_right_5]] | [IS_FIREABLE [reply_35_5_from_left_35] | IS_FIREABLE [election_17_0_1_from_right_16]]] | ~ [[IS_FIREABLE [hdl_right_election_35_6_6_29] | IS_FIREABLE [reply_35_5_from_left_9]]]] | [~ [[IS_FIREABLE [reply_35_5_from_right_14] & IS_FIREABLE [election_35_6_27_from_left_27]]] | [[IS_FIREABLE [hdl_left_reply_35_3_31] & IS_FIREABLE [election_35_3_1_from_left_1]] & [IS_FIREABLE [election_35_5_10_from_left_10] & IS_FIREABLE [hdl_left_election_3_0_1_4]]]]] | [IS_FIREABLE [hdl_right_reply_35_4_1] | [IS_FIREABLE [elected_35_31] & IS_FIREABLE [hdl_left_reply_16_0_16]]]]]]]]]
normalized: E [true U [[IS_FIREABLE [hdl_right_election_35_5_32_3] & [[IS_FIREABLE [hdl_left_election_5_0_1_6] | [[IS_FIREABLE [hdl_right_reply_35_4_1] | [IS_FIREABLE [elected_35_31] & IS_FIREABLE [hdl_left_reply_16_0_16]]] | [[[[IS_FIREABLE [election_35_5_10_from_left_10] & IS_FIREABLE [hdl_left_election_3_0_1_4]] & [IS_FIREABLE [hdl_left_reply_35_3_31] & IS_FIREABLE [election_35_3_1_from_left_1]]] | ~ [[IS_FIREABLE [reply_35_5_from_right_14] & IS_FIREABLE [election_35_6_27_from_left_27]]]] | [~ [[IS_FIREABLE [hdl_right_election_35_6_6_29] | IS_FIREABLE [reply_35_5_from_left_9]]] | [[IS_FIREABLE [reply_35_5_from_left_35] | IS_FIREABLE [election_17_0_1_from_right_16]] | ~ [IS_FIREABLE [election_35_5_30_from_right_5]]]]]]] | [IS_FIREABLE [hdl_right_reply_35_4_12] & IS_FIREABLE [hdl_left_election_21_0_1_22]]]] & [IS_FIREABLE [election_35_5_27_from_right_8] | [~ [[[IS_FIREABLE [election_35_4_12_from_left_12] & [~ [IS_FIREABLE [hdl_left_reply_35_5_12]] & [IS_FIREABLE [election_35_5_3_from_left_3] & IS_FIREABLE [election_35_6_11_from_left_11]]]] | [IS_FIREABLE [election_35_6_28_from_left_28] & ~ [IS_FIREABLE [election_35_5_9_from_right_26]]]]] | [IS_FIREABLE [hdl_left_reply_35_5_21] | [IS_FIREABLE [election_35_4_13_from_left_13] & IS_FIREABLE [election_35_6_10_from_left_10]]]]]]]


before gc: list nodes free: 975570

after gc: idd nodes used:1303676, unused:62696324; list nodes free:267159086
MC time: 1m15.737sec

checking: EF [[[~ [[[[IS_FIREABLE [hdl_left_reply_35_4_31] & ~ [[[IS_FIREABLE [election_35_6_6_from_left_6] | IS_FIREABLE [reply_35_3_from_left_29]] | [IS_FIREABLE [election_35_4_7_from_left_7] | IS_FIREABLE [hdl_left_election_35_6_32_32]]]]] | [[[IS_FIREABLE [election_35_4_14_from_left_14] & ~ [IS_FIREABLE [hdl_left_reply_35_4_23]]] & [[IS_FIREABLE [hdl_left_election_35_1_1_1] | IS_FIREABLE [hdl_right_election_35_6_12_23]] | IS_FIREABLE [hdl_left_reply_35_4_26]]] | ~ [IS_FIREABLE [hdl_right_election_35_4_3_32]]]] & [~ [IS_FIREABLE [election_35_5_28_from_left_28]] | IS_FIREABLE [hdl_right_reply_35_3_4]]]] & IS_FIREABLE [reply_33_0_from_left_33]] | [[IS_FIREABLE [hdl_right_election_35_6_32_3] & ~ [[IS_FIREABLE [reply_35_3_from_left_29] | ~ [[[IS_FIREABLE [hdl_left_reply_35_5_24] & IS_FIREABLE [election_35_5_17_from_right_18]] & IS_FIREABLE [election_35_5_22_from_right_13]]]]]] & [~ [[~ [[IS_FIREABLE [reply_35_5_from_right_14] & ~ [[IS_FIREABLE [elected_35_32] | IS_FIREABLE [hdl_left_election_34_0_1_35]]]]] | [[[~ [IS_FIREABLE [hdl_left_election_21_0_1_22]] | ~ [IS_FIREABLE [election_35_4_1_from_left_1]]] | ~ [IS_FIREABLE [hdl_left_election_35_5_12_12]]] | [[~ [IS_FIREABLE [election_35_5_15_from_right_20]] & IS_FIREABLE [hdl_left_election_35_6_35_35]] & [~ [IS_FIREABLE [hdl_left_reply_35_3_34]] | ~ [IS_FIREABLE [reply_15_0_from_left_15]]]]]]] & [~ [[IS_FIREABLE [hdl_left_reply_35_5_17] | [[[IS_FIREABLE [reply_35_2_from_right_3] | IS_FIREABLE [reply_35_0_from_right_35]] & IS_FIREABLE [hdl_right_election_35_6_34_1]] & [IS_FIREABLE [hdl_left_election_11_0_1_12] & ~ [IS_FIREABLE [hdl_left_reply_35_4_26]]]]]] & [[IS_FIREABLE [election_35_6_6_from_right_29] & ~ [[IS_FIREABLE [reply_35_3_from_right_7] | IS_FIREABLE [election_35_6_30_from_right_5]]]] & [IS_FIREABLE [election_35_4_4_from_left_4] | [[[IS_FIREABLE [hdl_right_election_35_5_22_13] | IS_FIREABLE [election_35_6_33_from_left_33]] & [IS_FIREABLE [election_35_6_13_from_right_22] & IS_FIREABLE [hdl_right_reply_35_5_23]]] & [[IS_FIREABLE [election_3_0_1_from_left_4] & IS_FIREABLE [election_35_6_3_from_left_3]] | [IS_FIREABLE [start9] | IS_FIREABLE [hdl_right_reply_35_3_4]]]]]]]]]]]
normalized: E [true U [[[[[[IS_FIREABLE [election_35_4_4_from_left_4] | [[[IS_FIREABLE [start9] | IS_FIREABLE [hdl_right_reply_35_3_4]] | [IS_FIREABLE [election_3_0_1_from_left_4] & IS_FIREABLE [election_35_6_3_from_left_3]]] & [[IS_FIREABLE [election_35_6_13_from_right_22] & IS_FIREABLE [hdl_right_reply_35_5_23]] & [IS_FIREABLE [hdl_right_election_35_5_22_13] | IS_FIREABLE [election_35_6_33_from_left_33]]]]] & [IS_FIREABLE [election_35_6_6_from_right_29] & ~ [[IS_FIREABLE [reply_35_3_from_right_7] | IS_FIREABLE [election_35_6_30_from_right_5]]]]] & ~ [[IS_FIREABLE [hdl_left_reply_35_5_17] | [[IS_FIREABLE [hdl_left_election_11_0_1_12] & ~ [IS_FIREABLE [hdl_left_reply_35_4_26]]] & [IS_FIREABLE [hdl_right_election_35_6_34_1] & [IS_FIREABLE [reply_35_2_from_right_3] | IS_FIREABLE [reply_35_0_from_right_35]]]]]]] & ~ [[[[[~ [IS_FIREABLE [reply_15_0_from_left_15]] | ~ [IS_FIREABLE [hdl_left_reply_35_3_34]]] & [IS_FIREABLE [hdl_left_election_35_6_35_35] & ~ [IS_FIREABLE [election_35_5_15_from_right_20]]]] | [~ [IS_FIREABLE [hdl_left_election_35_5_12_12]] | [~ [IS_FIREABLE [election_35_4_1_from_left_1]] | ~ [IS_FIREABLE [hdl_left_election_21_0_1_22]]]]] | ~ [[IS_FIREABLE [reply_35_5_from_right_14] & ~ [[IS_FIREABLE [elected_35_32] | IS_FIREABLE [hdl_left_election_34_0_1_35]]]]]]]] & [IS_FIREABLE [hdl_right_election_35_6_32_3] & ~ [[IS_FIREABLE [reply_35_3_from_left_29] | ~ [[IS_FIREABLE [election_35_5_22_from_right_13] & [IS_FIREABLE [hdl_left_reply_35_5_24] & IS_FIREABLE [election_35_5_17_from_right_18]]]]]]]] | [IS_FIREABLE [reply_33_0_from_left_33] & ~ [[[IS_FIREABLE [hdl_right_reply_35_3_4] | ~ [IS_FIREABLE [election_35_5_28_from_left_28]]] & [[~ [IS_FIREABLE [hdl_right_election_35_4_3_32]] | [[IS_FIREABLE [hdl_left_reply_35_4_26] | [IS_FIREABLE [hdl_left_election_35_1_1_1] | IS_FIREABLE [hdl_right_election_35_6_12_23]]] & [IS_FIREABLE [election_35_4_14_from_left_14] & ~ [IS_FIREABLE [hdl_left_reply_35_4_23]]]]] | [IS_FIREABLE [hdl_left_reply_35_4_31] & ~ [[[IS_FIREABLE [election_35_4_7_from_left_7] | IS_FIREABLE [hdl_left_election_35_6_32_32]] | [IS_FIREABLE [election_35_6_6_from_left_6] | IS_FIREABLE [reply_35_3_from_left_29]]]]]]]]]]]

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6423620 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100780 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.006sec


iterations count:79740 (86), effective:1999 (2)

initing FirstDep: 0m 0.006sec


sat_reach.icc:155: Timeout: after 160 sec


sat_reach.icc:155: Timeout: after 150 sec


sat_reach.icc:155: Timeout: after 140 sec


sat_reach.icc:155: Timeout: after 131 sec


sat_reach.icc:155: Timeout: after 123 sec


sat_reach.icc:155: Timeout: after 115 sec


sat_reach.icc:155: Timeout: after 108 sec


sat_reach.icc:155: Timeout: after 101 sec


sat_reach.icc:155: Timeout: after 95 sec


sat_reach.icc:155: Timeout: after 89 sec


sat_reach.icc:155: Timeout: after 83 sec


sat_reach.icc:155: Timeout: after 83 sec


sat_reach.icc:155: Timeout: after 77 sec


sat_reach.icc:155: Timeout: after 72 sec


sat_reach.icc:155: Timeout: after 67 sec

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="HirschbergSinclair-PT-35"
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 HirschbergSinclair-PT-35, 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 r202-smll-167840348700479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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