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.r298-tall-167873952400911.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 QuasiCertifProtocol-PT-32, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952400911
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 942K 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 QuasiCertifProtocol-PT-32-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679691718909

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=QuasiCertifProtocol-PT-32
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 21:02:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 21:02:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 21:02:00] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-24 21:02:00] [INFO ] Transformed 3806 places.
[2023-03-24 21:02:00] [INFO ] Transformed 506 transitions.
[2023-03-24 21:02:00] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 268 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=4 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=6 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=4 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 512364 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 512364 steps, saw 63958 distinct states, run finished after 3002 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 506 rows 3806 cols
[2023-03-24 21:02:05] [INFO ] Computed 3301 place invariants in 161 ms
[2023-03-24 21:02:12] [INFO ] [Real]Absence check using 3 positive place invariants in 24 ms returned sat
[2023-03-24 21:02:13] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 753 ms returned sat
[2023-03-24 21:02:13] [INFO ] After 3123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-24 21:02:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-24 21:02:16] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 687 ms returned sat
[2023-03-24 21:02:38] [INFO ] After 5726ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2023-03-24 21:02:38] [INFO ] After 5733ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 21:02:38] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3736 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3736 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.22 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 86 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 3736/3806 places, 506/506 transitions.
Incomplete random walk after 10000 steps, including 265 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=6 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=4 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 503115 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 503115 steps, saw 62894 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 21:02:43] [INFO ] Computed 3232 place invariants in 81 ms
[2023-03-24 21:02:48] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 764 ms returned sat
[2023-03-24 21:02:48] [INFO ] After 2584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-24 21:02:50] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 775 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-24 21:03:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 21:03:13] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3736 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 45 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 3736/3736 places, 506/506 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 1606 ms. (steps per millisecond=6 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 2410 ms. (steps per millisecond=4 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 3058384 steps, run timeout after 18001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 3058384 steps, saw 365549 distinct states, run finished after 18001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-24 21:03:37] [INFO ] Invariant cache hit.
[2023-03-24 21:03:42] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 785 ms returned sat
[2023-03-24 21:03:42] [INFO ] After 2387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-24 21:03:44] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 738 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-24 21:04:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 21:04:09] [INFO ] After 27252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3711 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 30 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 3736/3736 places, 506/506 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 2402 ms. (steps per millisecond=4 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 1947160 steps, run timeout after 12001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 1947160 steps, saw 232952 distinct states, run finished after 12001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-24 21:04:26] [INFO ] Invariant cache hit.
[2023-03-24 21:04:30] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 746 ms returned sat
[2023-03-24 21:04:30] [INFO ] After 2467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 21:04:32] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 803 ms returned sat
[2023-03-24 21:04:55] [INFO ] After 21809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-24 21:04:55] [INFO ] After 21817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 21:04:55] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 4 different solutions.
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 12 properties in 37 ms.
Support contains 226 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 2712 are kept as prefixes of interest. Removing 1024 places using SCC suffix rule.9 ms
Discarding 1024 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 2712 transition count 469
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 2711 transition count 469
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 37 place count 2711 transition count 468
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 2710 transition count 468
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 68 place count 2681 transition count 439
Iterating global reduction 2 with 29 rules applied. Total rules applied 97 place count 2681 transition count 439
Free-agglomeration rule (complex) applied 54 times.
Iterating global reduction 2 with 54 rules applied. Total rules applied 151 place count 2681 transition count 385
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 205 place count 2627 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 2626 transition count 384
Applied a total of 206 rules in 1003 ms. Remains 2626 /3736 variables (removed 1110) and now considering 384/506 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1003 ms. Remains : 2626/3736 places, 384/506 transitions.
Incomplete random walk after 10000 steps, including 252 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1461860 steps, run timeout after 3001 ms. (steps per millisecond=487 ) properties seen :{}
Probabilistic random walk after 1461860 steps, saw 185543 distinct states, run finished after 3001 ms. (steps per millisecond=487 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 384 rows 2626 cols
[2023-03-24 21:05:00] [INFO ] Computed 2242 place invariants in 24 ms
[2023-03-24 21:05:00] [INFO ] [Real]Absence check using 0 positive and 2242 generalized place invariants in 415 ms returned sat
[2023-03-24 21:05:01] [INFO ] After 1738ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 181493 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: QuasiCertifProtocol_PT_32
(NrP: 3806 NrTr: 506 NrArc: 8173)

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

net check time: 0m 0.001sec

init dd package: 0m 2.961sec


before gc: list nodes free: 837365

after gc: idd nodes used:40514878, unused:23485122; list nodes free:105046533

RS generation: 7m30.499sec


-> last computed set: #nodes 40511106 (4.1e+07) #states 4,194,305 (6)


CANNOT_COMPUTE


BK_STOP 1679692391903

--------------------
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.003sec

idd.cc:820: DD Exception: No free nodes

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="QuasiCertifProtocol-PT-32"
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 QuasiCertifProtocol-PT-32, 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 r298-tall-167873952400911"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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