Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696200742.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANInsertWithFailure-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696200742
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 CANInsertWithFailure-PT-050-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678746822432

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=CANInsertWithFailure-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:33:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 22:33:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:33:44] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2023-03-13 22:33:44] [INFO ] Transformed 5604 places.
[2023-03-13 22:33:44] [INFO ] Transformed 15300 transitions.
[2023-03-13 22:33:44] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 16) seen :5
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 15300 rows 5604 cols
[2023-03-13 22:33:46] [INFO ] Computed 53 place invariants in 1113 ms
[2023-03-13 22:33:48] [INFO ] After 1896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 22:33:51] [INFO ] [Nat]Absence check using 51 positive place invariants in 164 ms returned sat
[2023-03-13 22:33:51] [INFO ] [Nat]Absence check using 51 positive and 2 generalized place invariants in 91 ms returned sat
[2023-03-13 22:34:14] [INFO ] After 21852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-13 22:34:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-13 22:34:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 22:34:14] [INFO ] After 25256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 206 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 321 place count 5603 transition count 14980
Reduce places removed 320 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 329 rules applied. Total rules applied 650 place count 5283 transition count 14971
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 659 place count 5274 transition count 14971
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 659 place count 5274 transition count 14966
Deduced a syphon composed of 5 places in 21 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 669 place count 5269 transition count 14966
Performed 2227 Post agglomeration using F-continuation condition.Transition count delta: 2227
Deduced a syphon composed of 2227 places in 15 ms
Reduce places removed 2227 places and 0 transitions.
Iterating global reduction 3 with 4454 rules applied. Total rules applied 5123 place count 3042 transition count 12739
Drop transitions removed 2140 transitions
Redundant transition composition rules discarded 2140 transitions
Iterating global reduction 3 with 2140 rules applied. Total rules applied 7263 place count 3042 transition count 10599
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 7271 place count 3042 transition count 10591
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 7279 place count 3034 transition count 10591
Partial Free-agglomeration rule applied 2674 times.
Drop transitions removed 2674 transitions
Iterating global reduction 4 with 2674 rules applied. Total rules applied 9953 place count 3034 transition count 10591
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 4 with 200 rules applied. Total rules applied 10153 place count 3034 transition count 10591
Applied a total of 10153 rules in 4542 ms. Remains 3034 /5604 variables (removed 2570) and now considering 10591/15300 (removed 4709) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4547 ms. Remains : 3034/5604 places, 10591/15300 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 10591 rows 3034 cols
[2023-03-13 22:34:19] [INFO ] Computed 52 place invariants in 376 ms
[2023-03-13 22:34:20] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 22:34:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 60 ms returned sat
[2023-03-13 22:34:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-13 22:34:30] [INFO ] After 8159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 22:34:30] [INFO ] State equation strengthened by 9497 read => feed constraints.
[2023-03-13 22:34:40] [INFO ] After 10557ms SMT Verify possible using 9497 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-13 22:34:45] [INFO ] After 15457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-13 22:34:45] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 333 ms.
Support contains 156 out of 3034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3034/3034 places, 10591/10591 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 1 rules applied. Total rules applied 1 place count 3034 transition count 10590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3033 transition count 10590
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 46 place count 3011 transition count 10568
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 3011 transition count 10567
Partial Free-agglomeration rule applied 170 times.
Drop transitions removed 170 transitions
Iterating global reduction 2 with 170 rules applied. Total rules applied 217 place count 3011 transition count 10567
Applied a total of 217 rules in 1520 ms. Remains 3011 /3034 variables (removed 23) and now considering 10567/10591 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1520 ms. Remains : 3011/3034 places, 10567/10591 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 9) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 10567 rows 3011 cols
[2023-03-13 22:34:48] [INFO ] Computed 52 place invariants in 402 ms
[2023-03-13 22:34:49] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 22:34:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 37 ms returned sat
[2023-03-13 22:34:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 43 ms returned sat
[2023-03-13 22:34:56] [INFO ] After 5975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 22:34:56] [INFO ] State equation strengthened by 9804 read => feed constraints.
[2023-03-13 22:35:08] [INFO ] After 11617ms SMT Verify possible using 9804 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 22:35:14] [INFO ] After 17916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 22:35:14] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 745 ms.
Support contains 138 out of 3011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3011/3011 places, 10567/10567 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 3004 transition count 10560
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 3004 transition count 10559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 3003 transition count 10559
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 3003 transition count 10559
Applied a total of 25 rules in 1281 ms. Remains 3003 /3011 variables (removed 8) and now considering 10559/10567 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1283 ms. Remains : 3003/3011 places, 10559/10567 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 8) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10559 rows 3003 cols
[2023-03-13 22:35:17] [INFO ] Computed 52 place invariants in 316 ms
[2023-03-13 22:35:18] [INFO ] After 889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 22:35:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2023-03-13 22:35:19] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 33 ms returned sat
[2023-03-13 22:35:24] [INFO ] After 5315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 22:35:24] [INFO ] State equation strengthened by 9824 read => feed constraints.
[2023-03-13 22:35:35] [INFO ] After 11206ms SMT Verify possible using 9824 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 22:35:42] [INFO ] After 17932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 874 ms.
[2023-03-13 22:35:43] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 316 ms.
Support contains 92 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 10559/10559 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3003 transition count 10557
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 3001 transition count 10556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 3000 transition count 10556
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 54 place count 2976 transition count 10532
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 75 place count 2976 transition count 10532
Applied a total of 75 rules in 1163 ms. Remains 2976 /3003 variables (removed 27) and now considering 10532/10559 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1172 ms. Remains : 2976/3003 places, 10532/10559 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 71422 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71422 steps, saw 30264 distinct states, run finished after 3016 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10532 rows 2976 cols
[2023-03-13 22:35:49] [INFO ] Computed 52 place invariants in 450 ms
[2023-03-13 22:35:49] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 22:35:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 24 ms returned sat
[2023-03-13 22:35:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2023-03-13 22:35:54] [INFO ] After 4706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 22:35:54] [INFO ] State equation strengthened by 9938 read => feed constraints.
[2023-03-13 22:36:04] [INFO ] After 9568ms SMT Verify possible using 9938 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 22:36:08] [INFO ] After 14012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3960 ms.
[2023-03-13 22:36:12] [INFO ] After 23437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 504 ms.
Support contains 92 out of 2976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2976/2976 places, 10532/10532 transitions.
Applied a total of 0 rules in 368 ms. Remains 2976 /2976 variables (removed 0) and now considering 10532/10532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 2976/2976 places, 10532/10532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2976/2976 places, 10532/10532 transitions.
Applied a total of 0 rules in 517 ms. Remains 2976 /2976 variables (removed 0) and now considering 10532/10532 (removed 0) transitions.
[2023-03-13 22:36:14] [INFO ] Invariant cache hit.
[2023-03-13 22:36:19] [INFO ] Implicit Places using invariants in 4712 ms returned []
Implicit Place search using SMT only with invariants took 4714 ms to find 0 implicit places.
[2023-03-13 22:36:19] [INFO ] Invariant cache hit.
[2023-03-13 22:36:24] [INFO ] Dead Transitions using invariants and state equation in 5064 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10311 ms. Remains : 2976/2976 places, 10532/10532 transitions.
Graph (trivial) has 9610 edges and 2976 vertex of which 2528 / 2976 are part of one of the 2 SCC in 9 ms
Free SCC test removed 2526 places
Drop transitions removed 6962 transitions
Ensure Unique test removed 2449 transitions
Reduce isomorphic transitions removed 9411 transitions.
Graph (complete) has 1432 edges and 450 vertex of which 308 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.1 ms
Discarding 142 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Drop transitions removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 231 rules applied. Total rules applied 233 place count 308 transition count 846
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 237 place count 306 transition count 844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 237 place count 306 transition count 843
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 239 place count 305 transition count 843
Discarding 169 places :
Symmetric choice reduction at 2 with 169 rule applications. Total rules 408 place count 136 transition count 503
Iterating global reduction 2 with 169 rules applied. Total rules applied 577 place count 136 transition count 503
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 703 place count 136 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 705 place count 135 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 707 place count 134 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 708 place count 134 transition count 374
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 719 place count 134 transition count 363
Free-agglomeration rule applied 14 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 733 place count 134 transition count 347
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 755 place count 120 transition count 339
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 759 place count 120 transition count 335
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 760 place count 120 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 761 place count 119 transition count 334
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 762 place count 118 transition count 331
Iterating global reduction 6 with 1 rules applied. Total rules applied 763 place count 118 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 764 place count 118 transition count 330
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 771 place count 118 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 772 place count 118 transition count 329
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 773 place count 117 transition count 326
Iterating global reduction 8 with 1 rules applied. Total rules applied 774 place count 117 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 775 place count 117 transition count 325
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 778 place count 114 transition count 322
Applied a total of 778 rules in 116 ms. Remains 114 /2976 variables (removed 2862) and now considering 322/10532 (removed 10210) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 322 rows 114 cols
[2023-03-13 22:36:24] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-13 22:36:24] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 22:36:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-13 22:36:24] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 22:36:24] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-13 22:36:24] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-13 22:36:24] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 22:36:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2976 places, 10532 transitions and 41827 arcs took 39 ms.
[2023-03-13 22:36:25] [INFO ] Flatten gal took : 419 ms
Total runtime 161148 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: gen
(NrP: 2976 NrTr: 10532 NrArc: 41827)

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

net check time: 0m 0.007sec

init dd package: 0m 3.225sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 9980256 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16076868 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 0.280sec

113769 1295985

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="CANInsertWithFailure-PT-050"
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 CANInsertWithFailure-PT-050, 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 r042-tajo-167813696200742"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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