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

About the Execution of Marcie+red for FamilyReunion-PT-L00100M0010C005P005G002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9634.596 889334.00 921079.00 1941.10 TFTTTTTTFTTTTFTT 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-167838857200423.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 FamilyReunion-PT-L00100M0010C005P005G002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 290K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 170K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 327K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 869K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Feb 26 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M Feb 26 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17M 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 FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678542483232

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=FamilyReunion-PT-L00100M0010C005P005G002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 13:48:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 13:48:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 13:48:05] [INFO ] Load time of PNML (sax parser for PT used): 701 ms
[2023-03-11 13:48:05] [INFO ] Transformed 40605 places.
[2023-03-11 13:48:05] [INFO ] Transformed 36871 transitions.
[2023-03-11 13:48:05] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 1141 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 153 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 31 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 968 ms. (steps per millisecond=10 ) properties (out of 16) seen :10
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 36871 rows 40574 cols
[2023-03-11 13:48:14] [INFO ] Computed 8805 place invariants in 5190 ms
[2023-03-11 13:48:24] [INFO ] [Real]Absence check using 300 positive place invariants in 1083 ms returned sat
[2023-03-11 13:48:38] [INFO ] [Real]Absence check using 300 positive and 8505 generalized place invariants in 13758 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-11 13:48:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:48:39] [INFO ] After 25156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 51 out of 40574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 38725 are kept as prefixes of interest. Removing 1849 places using SCC suffix rule.55 ms
Discarding 1849 places :
Also discarding 1507 output transitions
Drop transitions removed 1507 transitions
Drop transitions removed 304 transitions
Reduce isomorphic transitions removed 304 transitions.
Discarding 6660 places :
Implicit places reduction removed 6660 places
Drop transitions removed 19296 transitions
Trivial Post-agglo rules discarded 19296 transitions
Performed 19296 trivial Post agglomeration. Transition count delta: 19296
Iterating post reduction 0 with 26260 rules applied. Total rules applied 26261 place count 32065 transition count 15764
Reduce places removed 19296 places and 0 transitions.
Performed 242 Post agglomeration using F-continuation condition.Transition count delta: 242
Iterating post reduction 1 with 19538 rules applied. Total rules applied 45799 place count 12769 transition count 15522
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 2 with 242 rules applied. Total rules applied 46041 place count 12527 transition count 15522
Performed 1924 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1924 Pre rules applied. Total rules applied 46041 place count 12527 transition count 13598
Deduced a syphon composed of 1924 places in 9 ms
Ensure Unique test removed 904 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4752 rules applied. Total rules applied 50793 place count 9699 transition count 13598
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 3 with 598 rules applied. Total rules applied 51391 place count 9694 transition count 13005
Reduce places removed 593 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 4 with 603 rules applied. Total rules applied 51994 place count 9101 transition count 12995
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 52004 place count 9091 transition count 12995
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 52004 place count 9091 transition count 12993
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 52008 place count 9089 transition count 12993
Discarding 4641 places :
Symmetric choice reduction at 6 with 4641 rule applications. Total rules 56649 place count 4448 transition count 8156
Iterating global reduction 6 with 4641 rules applied. Total rules applied 61290 place count 4448 transition count 8156
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 203 places :
Implicit places reduction removed 203 places
Drop transitions removed 793 transitions
Trivial Post-agglo rules discarded 793 transitions
Performed 793 trivial Post agglomeration. Transition count delta: 793
Iterating post reduction 6 with 1501 rules applied. Total rules applied 62791 place count 4245 transition count 6858
Reduce places removed 793 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 794 rules applied. Total rules applied 63585 place count 3452 transition count 6857
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 63586 place count 3451 transition count 6857
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 13 Pre rules applied. Total rules applied 63586 place count 3451 transition count 6844
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 63612 place count 3438 transition count 6844
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 63627 place count 3423 transition count 5927
Iterating global reduction 9 with 15 rules applied. Total rules applied 63642 place count 3423 transition count 5927
Ensure Unique test removed 301 transitions
Reduce isomorphic transitions removed 301 transitions.
Iterating post reduction 9 with 301 rules applied. Total rules applied 63943 place count 3423 transition count 5626
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 63943 place count 3423 transition count 5625
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 63945 place count 3422 transition count 5625
Discarding 601 places :
Symmetric choice reduction at 10 with 601 rule applications. Total rules 64546 place count 2821 transition count 4624
Iterating global reduction 10 with 601 rules applied. Total rules applied 65147 place count 2821 transition count 4624
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 10 with 999 rules applied. Total rules applied 66146 place count 2821 transition count 3625
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 11 with 800 rules applied. Total rules applied 66946 place count 2421 transition count 3225
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 66952 place count 2418 transition count 3227
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 66954 place count 2417 transition count 3324
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 66955 place count 2417 transition count 3323
Free-agglomeration rule applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 66963 place count 2417 transition count 3315
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 66971 place count 2409 transition count 3315
Free-agglomeration rule (complex) applied 116 times.
Iterating global reduction 12 with 116 rules applied. Total rules applied 67087 place count 2409 transition count 3205
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 12 with 116 rules applied. Total rules applied 67203 place count 2293 transition count 3205
Partial Free-agglomeration rule applied 114 times.
Drop transitions removed 114 transitions
Iterating global reduction 13 with 114 rules applied. Total rules applied 67317 place count 2293 transition count 3205
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 67319 place count 2291 transition count 3203
Applied a total of 67319 rules in 5019 ms. Remains 2291 /40574 variables (removed 38283) and now considering 3203/36871 (removed 33668) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5021 ms. Remains : 2291/40574 places, 3203/36871 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 6) seen :4
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3203 rows 2291 cols
[2023-03-11 13:48:44] [INFO ] Computed 618 place invariants in 48 ms
[2023-03-11 13:48:45] [INFO ] [Real]Absence check using 0 positive and 618 generalized place invariants in 150 ms returned sat
[2023-03-11 13:48:45] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 13:48:45] [INFO ] [Nat]Absence check using 0 positive and 618 generalized place invariants in 151 ms returned sat
[2023-03-11 13:48:47] [INFO ] After 1701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 13:48:47] [INFO ] After 2086ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 369 ms.
[2023-03-11 13:48:48] [INFO ] After 2939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 516 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=30 )
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 21 ms.
All properties solved without resorting to model-checking.
Total runtime 43469 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: FamilyReunion_PT_L00100M0010C005P005G002
(NrP: 40605 NrTr: 36871 NrArc: 112728)

parse formulas
formulas created successfully
place and transition orderings generation:6m29.674sec

net check time: 0m 0.040sec

init dd package: 0m 2.795sec


before gc: list nodes free: 1915754

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870498

before gc: list nodes free: 1901699

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837703

before gc: list nodes free: 1890914

after gc: idd nodes used:19594, unused:63980406; list nodes free:257812538

before gc: list nodes free: 1881824

after gc: idd nodes used:22624, unused:63977376; list nodes free:257791328

before gc: list nodes free: 1873814

after gc: idd nodes used:25294, unused:63974706; list nodes free:257772638

before gc: list nodes free: 1866572

after gc: idd nodes used:27708, unused:63972292; list nodes free:257755740

before gc: list nodes free: 1859915

after gc: idd nodes used:29927, unused:63970073; list nodes free:257740207

before gc: list nodes free: 1853717

after gc: idd nodes used:31993, unused:63968007; list nodes free:257725745

before gc: list nodes free: 1846838

after gc: idd nodes used:33933, unused:63966067; list nodes free:257712163

before gc: list nodes free: 1838119

after gc: idd nodes used:35768, unused:63964232; list nodes free:257699314

before gc: list nodes free: 1831913

after gc: idd nodes used:37513, unused:63962487; list nodes free:257687099

before gc: list nodes free: 1827143

after gc: idd nodes used:39181, unused:63960819; list nodes free:257675423

BK_STOP 1678543372566

--------------------
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
m0_0
m0_1
m0_2
m0_3
m0_4
m0_5
m0_6
m0_7
m0_8
m0_9
m0_10
c2_0
c2_1
c2_2
c2_3
c2_4
c2_5
r0_Y
r0_N
c0_0
c0_1
c0_2
c0_3
c0_4
c0_5
p0_0
p0_1
p0_2
p0_3
p0_4
p0_5
found 31 constant places
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 6.828sec

/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 470 Segmentation fault ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="FamilyReunion-PT-L00100M0010C005P005G002"
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 FamilyReunion-PT-L00100M0010C005P005G002, 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-167838857200423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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