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.r266-smll-167863541100591.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 Peterson-COL-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541100591
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.3K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 46K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679173645513

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=Peterson-COL-6
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 21:07:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 21:07:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:07:29] [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-18 21:07:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 21:07:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 821 ms
[2023-03-18 21:07:29] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:07:30] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2023-03-18 21:07:30] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
All 14 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-18 21:07:30] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 101 ms.
[2023-03-18 21:07:30] [INFO ] Unfolded 14 HLPN properties in 7 ms.
Deduced a syphon composed of 42 places in 25 ms
Reduce places removed 42 places and 84 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 996 ms. (steps per millisecond=10 ) properties (out of 14) seen :10
FORMULA Peterson-COL-6-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3025 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 858 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:07:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-18 21:07:36] [INFO ] Computed 27 place invariants in 35 ms
[2023-03-18 21:07:44] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2023-03-18 21:07:44] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-18 21:07:44] [INFO ] After 1280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:07:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-18 21:07:45] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-18 21:07:47] [INFO ] After 1579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:07:47] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-18 21:07:48] [INFO ] After 1647ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 21:07:50] [INFO ] Deduced a trap composed of 41 places in 1344 ms of which 19 ms to minimize.
[2023-03-18 21:07:52] [INFO ] Deduced a trap composed of 58 places in 1563 ms of which 3 ms to minimize.
[2023-03-18 21:07:53] [INFO ] Deduced a trap composed of 215 places in 1601 ms of which 4 ms to minimize.
[2023-03-18 21:07:55] [INFO ] Deduced a trap composed of 12 places in 1529 ms of which 2 ms to minimize.
[2023-03-18 21:07:57] [INFO ] Deduced a trap composed of 88 places in 1438 ms of which 3 ms to minimize.
[2023-03-18 21:07:58] [INFO ] Deduced a trap composed of 155 places in 1288 ms of which 1 ms to minimize.
[2023-03-18 21:07:59] [INFO ] Deduced a trap composed of 51 places in 1137 ms of which 1 ms to minimize.
[2023-03-18 21:08:00] [INFO ] Deduced a trap composed of 20 places in 911 ms of which 1 ms to minimize.
[2023-03-18 21:08:02] [INFO ] Deduced a trap composed of 242 places in 1190 ms of which 2 ms to minimize.
[2023-03-18 21:08:03] [INFO ] Deduced a trap composed of 12 places in 1349 ms of which 2 ms to minimize.
[2023-03-18 21:08:05] [INFO ] Deduced a trap composed of 248 places in 1149 ms of which 1 ms to minimize.
[2023-03-18 21:08:06] [INFO ] Deduced a trap composed of 37 places in 1373 ms of which 3 ms to minimize.
[2023-03-18 21:08:08] [INFO ] Deduced a trap composed of 194 places in 1402 ms of which 2 ms to minimize.
[2023-03-18 21:08:09] [INFO ] Deduced a trap composed of 20 places in 1149 ms of which 2 ms to minimize.
[2023-03-18 21:08:10] [INFO ] Deduced a trap composed of 26 places in 1030 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:08:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:08:10] [INFO ] After 25685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 194 ms.
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 146 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3198 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1083 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1101 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 787832 steps, run timeout after 18001 ms. (steps per millisecond=43 ) properties seen :{1=1}
Probabilistic random walk after 787832 steps, saw 419246 distinct states, run finished after 18005 ms. (steps per millisecond=43 ) properties seen :1
FORMULA Peterson-COL-6-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-18 21:08:35] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-18 21:08:35] [INFO ] Invariant cache hit.
[2023-03-18 21:08:38] [INFO ] [Real]Absence check using 20 positive place invariants in 41 ms returned sat
[2023-03-18 21:08:38] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-18 21:08:38] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:08:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 32 ms returned sat
[2023-03-18 21:08:38] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-18 21:08:40] [INFO ] After 1654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:08:40] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-18 21:08:43] [INFO ] After 2460ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:08:44] [INFO ] Deduced a trap composed of 42 places in 1205 ms of which 2 ms to minimize.
[2023-03-18 21:08:46] [INFO ] Deduced a trap composed of 12 places in 1203 ms of which 5 ms to minimize.
[2023-03-18 21:08:47] [INFO ] Deduced a trap composed of 60 places in 1090 ms of which 2 ms to minimize.
[2023-03-18 21:08:48] [INFO ] Deduced a trap composed of 54 places in 1021 ms of which 2 ms to minimize.
[2023-03-18 21:08:49] [INFO ] Deduced a trap composed of 16 places in 1076 ms of which 2 ms to minimize.
[2023-03-18 21:08:51] [INFO ] Deduced a trap composed of 53 places in 1103 ms of which 1 ms to minimize.
[2023-03-18 21:08:52] [INFO ] Deduced a trap composed of 64 places in 1160 ms of which 3 ms to minimize.
[2023-03-18 21:08:53] [INFO ] Deduced a trap composed of 63 places in 1057 ms of which 2 ms to minimize.
[2023-03-18 21:08:55] [INFO ] Deduced a trap composed of 12 places in 1265 ms of which 1 ms to minimize.
[2023-03-18 21:08:56] [INFO ] Deduced a trap composed of 46 places in 680 ms of which 1 ms to minimize.
[2023-03-18 21:08:57] [INFO ] Deduced a trap composed of 101 places in 1170 ms of which 1 ms to minimize.
[2023-03-18 21:08:58] [INFO ] Deduced a trap composed of 161 places in 965 ms of which 2 ms to minimize.
[2023-03-18 21:08:59] [INFO ] Deduced a trap composed of 41 places in 1057 ms of which 2 ms to minimize.
[2023-03-18 21:09:01] [INFO ] Deduced a trap composed of 12 places in 1114 ms of which 2 ms to minimize.
[2023-03-18 21:09:02] [INFO ] Deduced a trap composed of 52 places in 995 ms of which 2 ms to minimize.
[2023-03-18 21:09:03] [INFO ] Deduced a trap composed of 91 places in 1036 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:09:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:09:03] [INFO ] After 25433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 68 ms.
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 57 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 927 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1043 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 249160 steps, run timeout after 6001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 249160 steps, saw 151032 distinct states, run finished after 6002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:09:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-18 21:09:12] [INFO ] Invariant cache hit.
[2023-03-18 21:09:15] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-18 21:09:15] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-18 21:09:16] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:09:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-18 21:09:16] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-18 21:09:18] [INFO ] After 1472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:09:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-18 21:09:20] [INFO ] After 1932ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:09:21] [INFO ] Deduced a trap composed of 42 places in 1129 ms of which 1 ms to minimize.
[2023-03-18 21:09:22] [INFO ] Deduced a trap composed of 12 places in 1188 ms of which 2 ms to minimize.
[2023-03-18 21:09:24] [INFO ] Deduced a trap composed of 60 places in 1067 ms of which 2 ms to minimize.
[2023-03-18 21:09:25] [INFO ] Deduced a trap composed of 54 places in 981 ms of which 5 ms to minimize.
[2023-03-18 21:09:26] [INFO ] Deduced a trap composed of 16 places in 1018 ms of which 5 ms to minimize.
[2023-03-18 21:09:27] [INFO ] Deduced a trap composed of 53 places in 1145 ms of which 1 ms to minimize.
[2023-03-18 21:09:29] [INFO ] Deduced a trap composed of 64 places in 1188 ms of which 2 ms to minimize.
[2023-03-18 21:09:30] [INFO ] Deduced a trap composed of 63 places in 1148 ms of which 2 ms to minimize.
[2023-03-18 21:09:31] [INFO ] Deduced a trap composed of 12 places in 748 ms of which 2 ms to minimize.
[2023-03-18 21:09:32] [INFO ] Deduced a trap composed of 46 places in 1109 ms of which 2 ms to minimize.
[2023-03-18 21:09:33] [INFO ] Deduced a trap composed of 101 places in 1028 ms of which 2 ms to minimize.
[2023-03-18 21:09:34] [INFO ] Deduced a trap composed of 161 places in 1009 ms of which 2 ms to minimize.
[2023-03-18 21:09:36] [INFO ] Deduced a trap composed of 41 places in 935 ms of which 2 ms to minimize.
[2023-03-18 21:09:37] [INFO ] Deduced a trap composed of 12 places in 1053 ms of which 2 ms to minimize.
[2023-03-18 21:09:39] [INFO ] Deduced a trap composed of 52 places in 941 ms of which 2 ms to minimize.
[2023-03-18 21:09:40] [INFO ] Deduced a trap composed of 91 places in 1161 ms of which 1 ms to minimize.
[2023-03-18 21:09:41] [INFO ] Deduced a trap composed of 46 places in 990 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:09:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:09:41] [INFO ] After 25472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 111 ms.
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 56 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 48 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-18 21:09:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-18 21:09:41] [INFO ] Invariant cache hit.
[2023-03-18 21:09:42] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-18 21:09:42] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-18 21:09:42] [INFO ] Invariant cache hit.
[2023-03-18 21:09:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-18 21:09:43] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
[2023-03-18 21:09:43] [INFO ] Redundant transitions in 190 ms returned []
[2023-03-18 21:09:43] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-18 21:09:43] [INFO ] Invariant cache hit.
[2023-03-18 21:09:45] [INFO ] Dead Transitions using invariants and state equation in 1795 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3424 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1330 transition count 1820
Applied a total of 210 rules in 32 ms. Remains 1330 /1330 variables (removed 0) and now considering 1820/2030 (removed 210) transitions.
Running SMT prover for 3 properties.
[2023-03-18 21:09:45] [INFO ] Invariant cache hit.
[2023-03-18 21:09:48] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-18 21:09:48] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-18 21:09:48] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:09:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 44 ms returned sat
[2023-03-18 21:09:48] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-18 21:09:50] [INFO ] After 1582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:09:51] [INFO ] After 2553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 740 ms.
[2023-03-18 21:09:52] [INFO ] After 4244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:09:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 26 ms.
[2023-03-18 21:09:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 13 ms.
[2023-03-18 21:09:52] [INFO ] Flatten gal took : 255 ms
Total runtime 143959 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Peterson_COL_6_unf
(NrP: 1330 NrTr: 2030 NrArc: 6272)

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

net check time: 0m 0.001sec

init dd package: 0m 3.067sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 10054752 kB
After kill :
MemTotal: 16393228 kB
MemFree: 16093700 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.024sec

85311 269878 276707

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="Peterson-COL-6"
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 Peterson-COL-6, 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 r266-smll-167863541100591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;