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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9564.628 3600000.00 3685656.00 20858.40 ?T?TT?FF?T??TTT? 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-167838857100326.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-COL-L00100M0010C005P005G002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857100326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 3.7K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 14:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 14:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 140K 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-COL-L00100M0010C005P005G002-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678508460046

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00100M0010C005P005G002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 04:21:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 04:21:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:21:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 04:21:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 04:21:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 677 ms
[2023-03-11 04:21:02] [INFO ] Detected 5 constant HL places corresponding to 31 PT places.
[2023-03-11 04:21:02] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 40706 PT places and 36972.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 04:21:02] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 6 ms.
[2023-03-11 04:21:02] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
[2023-03-11 04:21:02] [INFO ] Flatten gal took : 28 ms
[2023-03-11 04:21:02] [INFO ] Flatten gal took : 11 ms
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-09 TRUE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-14 TRUE TECHNIQUES CPN_APPROX
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 6
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 3
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
[2023-03-11 04:21:02] [INFO ] Unfolded HLPN to a Petri net with 37039 places and 31114 transitions 89397 arcs in 185 ms.
[2023-03-11 04:21:02] [INFO ] Unfolded 16 HLPN properties in 9 ms.
Deduced a syphon composed of 101 places in 140 ms
Reduce places removed 122 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2251 ms. (steps per millisecond=4 ) properties (out of 14) seen :3
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3879 ms. (steps per millisecond=2 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3775 ms. (steps per millisecond=2 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2047 ms. (steps per millisecond=4 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4495 ms. (steps per millisecond=2 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 904 ms. (steps per millisecond=11 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 818 ms. (steps per millisecond=12 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 31114 rows 36917 cols
[2023-03-11 04:21:27] [INFO ] Computed 8803 place invariants in 4765 ms
[2023-03-11 04:21:38] [INFO ] After 11074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 04:21:49] [INFO ] [Nat]Absence check using 108 positive place invariants in 256 ms returned sat
[2023-03-11 04:22:01] [INFO ] [Nat]Absence check using 108 positive and 8695 generalized place invariants in 12030 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 04:22:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 04:22:03] [INFO ] After 25119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30346 out of 36917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36917/36917 places, 31114/31114 transitions.
Graph (complete) has 56168 edges and 36917 vertex of which 36911 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.67 ms
Discarding 6 places :
Also discarding 0 output transitions
Discarding 1212 places :
Implicit places reduction removed 1212 places
Iterating post reduction 0 with 1212 rules applied. Total rules applied 1213 place count 35699 transition count 31114
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 1213 place count 35699 transition count 31013
Deduced a syphon composed of 101 places in 43 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 1 with 202 rules applied. Total rules applied 1415 place count 35598 transition count 31013
Discarding 1515 places :
Symmetric choice reduction at 1 with 1515 rule applications. Total rules 2930 place count 34083 transition count 29498
Iterating global reduction 1 with 1515 rules applied. Total rules applied 4445 place count 34083 transition count 29498
Applied a total of 4445 rules in 3036 ms. Remains 34083 /36917 variables (removed 2834) and now considering 29498/31114 (removed 1616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3040 ms. Remains : 34083/36917 places, 29498/31114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1835 ms. (steps per millisecond=5 ) properties (out of 11) seen :3
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3846 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1991 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 29498 rows 34083 cols
[2023-03-11 04:22:19] [INFO ] Computed 7585 place invariants in 3177 ms
[2023-03-11 04:22:27] [INFO ] After 7955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 04:22:35] [INFO ] [Nat]Absence check using 301 positive place invariants in 942 ms returned sat
[2023-03-11 04:22:43] [INFO ] [Nat]Absence check using 301 positive and 7284 generalized place invariants in 7959 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 04:22:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 04:22:52] [INFO ] After 25132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22967 out of 34083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34083/34083 places, 29498/29498 transitions.
Graph (complete) has 52122 edges and 34083 vertex of which 33976 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.15 ms
Discarding 107 places :
Also discarding 0 output transitions
Discarding 1212 places :
Implicit places reduction removed 1212 places
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 0 with 2323 rules applied. Total rules applied 2324 place count 32764 transition count 28387
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 1 with 1111 rules applied. Total rules applied 3435 place count 31653 transition count 28387
Performed 808 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 808 Pre rules applied. Total rules applied 3435 place count 31653 transition count 27579
Deduced a syphon composed of 808 places in 29 ms
Reduce places removed 808 places and 0 transitions.
Iterating global reduction 2 with 1616 rules applied. Total rules applied 5051 place count 30845 transition count 27579
Discarding 606 places :
Implicit places reduction removed 606 places
Iterating post reduction 2 with 606 rules applied. Total rules applied 5657 place count 30239 transition count 27579
Applied a total of 5657 rules in 3710 ms. Remains 30239 /34083 variables (removed 3844) and now considering 27579/29498 (removed 1919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3710 ms. Remains : 30239/34083 places, 27579/29498 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1153 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3882 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1999 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 900 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 253200 steps, run timeout after 24001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 253200 steps, saw 250347 distinct states, run finished after 24003 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 27579 rows 30239 cols
[2023-03-11 04:23:31] [INFO ] Computed 5665 place invariants in 2261 ms
[2023-03-11 04:23:37] [INFO ] After 6917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 04:23:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 29 ms returned sat
[2023-03-11 04:23:50] [INFO ] [Nat]Absence check using 1 positive and 5664 generalized place invariants in 6100 ms returned sat
[2023-03-11 04:24:03] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22967 out of 30239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30239/30239 places, 27579/27579 transitions.
Applied a total of 0 rules in 1744 ms. Remains 30239 /30239 variables (removed 0) and now considering 27579/27579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1745 ms. Remains : 30239/30239 places, 27579/27579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30239/30239 places, 27579/27579 transitions.
Applied a total of 0 rules in 1579 ms. Remains 30239 /30239 variables (removed 0) and now considering 27579/27579 (removed 0) transitions.
[2023-03-11 04:24:06] [INFO ] Invariant cache hit.
[2023-03-11 04:24:08] [INFO ] Implicit Places using invariants in 2230 ms returned []
Implicit Place search using SMT only with invariants took 2236 ms to find 0 implicit places.
[2023-03-11 04:24:08] [INFO ] Invariant cache hit.
[2023-03-11 04:24:10] [INFO ] Dead Transitions using invariants and state equation in 2167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5992 ms. Remains : 30239/30239 places, 27579/27579 transitions.
Applied a total of 0 rules in 1579 ms. Remains 30239 /30239 variables (removed 0) and now considering 27579/27579 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-11 04:24:12] [INFO ] Invariant cache hit.
[2023-03-11 04:24:19] [INFO ] After 6752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 04:24:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 22 ms returned sat
[2023-03-11 04:24:31] [INFO ] [Nat]Absence check using 1 positive and 5664 generalized place invariants in 5912 ms returned sat
[2023-03-11 04:26:39] [INFO ] After 104485ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-11 04:26:57] [INFO ] After 122034ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 4777 ms.
[2023-03-11 04:27:02] [INFO ] After 162762ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-11 04:27:02] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-11 04:27:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30239 places, 27579 transitions and 74039 arcs took 91 ms.
[2023-03-11 04:27:03] [INFO ] Flatten gal took : 959 ms
Total runtime 361946 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FamilyReunion_COL_L00100M0010C005P005G002_unf
(NrP: 30239 NrTr: 27579 NrArc: 74039)

parse formulas
formulas created successfully
place and transition orderings generation:2m 9.491sec

net check time: 0m 0.013sec

init dd package: 0m 2.544sec


before gc: list nodes free: 1915754

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

before gc: list nodes free: 1727844

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

before gc: list nodes free: 1619061

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

before gc: list nodes free: 1648283

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

before gc: list nodes free: 1666680

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

before gc: list nodes free: 1659740

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

before gc: list nodes free: 1647804

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

before gc: list nodes free: 1596919

after gc: idd nodes used:80892, unused:63919108; list nodes free:257485116
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6562892 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16078284 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 3.096sec

147216

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-COL-L00100M0010C005P005G002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is FamilyReunion-COL-L00100M0010C005P005G002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857100326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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