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-167813696200774.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-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696200774
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 00:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 01:28 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 49M 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-090-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678750463009

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-090
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 23:34:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 23:34:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:34:25] [INFO ] Load time of PNML (sax parser for PT used): 891 ms
[2023-03-13 23:34:25] [INFO ] Transformed 17284 places.
[2023-03-13 23:34:25] [INFO ] Transformed 49140 transitions.
[2023-03-13 23:34:25] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1136 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 16) seen :2
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 49140 rows 17284 cols
[2023-03-13 23:34:41] [INFO ] Computed 93 place invariants in 13828 ms
[2023-03-13 23:34:47] [INFO ] After 5730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 23:34:53] [INFO ] [Nat]Absence check using 91 positive place invariants in 298 ms returned sat
[2023-03-13 23:34:53] [INFO ] [Nat]Absence check using 91 positive and 2 generalized place invariants in 477 ms returned sat
[2023-03-13 23:35:12] [INFO ] After 14904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-13 23:35:12] [INFO ] State equation strengthened by 16110 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 23:35:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:35:12] [INFO ] After 25362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 194 out of 17284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Graph (complete) has 66151 edges and 17284 vertex of which 17283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.59 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 602 transitions
Trivial Post-agglo rules discarded 602 transitions
Performed 602 trivial Post agglomeration. Transition count delta: 602
Iterating post reduction 0 with 602 rules applied. Total rules applied 603 place count 17283 transition count 48538
Reduce places removed 602 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 610 rules applied. Total rules applied 1213 place count 16681 transition count 48530
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1221 place count 16673 transition count 48530
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1221 place count 16673 transition count 48525
Deduced a syphon composed of 5 places in 18 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1231 place count 16668 transition count 48525
Performed 7653 Post agglomeration using F-continuation condition.Transition count delta: 7653
Deduced a syphon composed of 7653 places in 51 ms
Reduce places removed 7653 places and 0 transitions.
Iterating global reduction 3 with 15306 rules applied. Total rules applied 16537 place count 9015 transition count 40872
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16545 place count 9015 transition count 40864
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 16553 place count 9007 transition count 40864
Partial Free-agglomeration rule applied 8541 times.
Drop transitions removed 8541 transitions
Iterating global reduction 4 with 8541 rules applied. Total rules applied 25094 place count 9007 transition count 40864
Partial Free-agglomeration rule applied 553 times.
Drop transitions removed 553 transitions
Iterating global reduction 4 with 553 rules applied. Total rules applied 25647 place count 9007 transition count 40864
Applied a total of 25647 rules in 24777 ms. Remains 9007 /17284 variables (removed 8277) and now considering 40864/49140 (removed 8276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24784 ms. Remains : 9007/17284 places, 40864/49140 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 14) seen :2
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-09 FALSE 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2023-03-13 23:35:38] [INFO ] Flow matrix only has 40787 transitions (discarded 77 similar events)
// Phase 1: matrix 40787 rows 9007 cols
[2023-03-13 23:35:42] [INFO ] Computed 92 place invariants in 3726 ms
[2023-03-13 23:35:44] [INFO ] After 2436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 23:35:47] [INFO ] [Nat]Absence check using 90 positive place invariants in 116 ms returned sat
[2023-03-13 23:35:47] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 180 ms returned sat
[2023-03-13 23:36:09] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 186 out of 9007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9007/9007 places, 40864/40864 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 9001 transition count 40858
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 9001 transition count 40858
Applied a total of 14 rules in 9249 ms. Remains 9001 /9007 variables (removed 6) and now considering 40858/40864 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9249 ms. Remains : 9001/9007 places, 40858/40864 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 12) 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 12) 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 12) 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 12) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) 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 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 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 11) 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 11) seen :0
Interrupted probabilistic random walk after 109413 steps, run timeout after 3003 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109413 steps, saw 105796 distinct states, run finished after 3004 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-13 23:36:22] [INFO ] Flow matrix only has 40782 transitions (discarded 76 similar events)
// Phase 1: matrix 40782 rows 9001 cols
[2023-03-13 23:36:26] [INFO ] Computed 92 place invariants in 3806 ms
[2023-03-13 23:36:28] [INFO ] After 2548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 23:36:31] [INFO ] [Nat]Absence check using 90 positive place invariants in 130 ms returned sat
[2023-03-13 23:36:31] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 179 ms returned sat
[2023-03-13 23:36:53] [INFO ] After 20342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 23:36:54] [INFO ] State equation strengthened by 39082 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 23:36:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:36:54] [INFO ] After 25450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 183 out of 9001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9001/9001 places, 40858/40858 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9000 transition count 40857
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 9000 transition count 40857
Applied a total of 4 rules in 9130 ms. Remains 9000 /9001 variables (removed 1) and now considering 40857/40858 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9130 ms. Remains : 9000/9001 places, 40857/40858 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-10 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 24 ms. (steps per millisecond=416 ) 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 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) 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 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 103113 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103113 steps, saw 99791 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-13 23:37:07] [INFO ] Flow matrix only has 40783 transitions (discarded 74 similar events)
// Phase 1: matrix 40783 rows 9000 cols
[2023-03-13 23:37:10] [INFO ] Computed 92 place invariants in 3547 ms
[2023-03-13 23:37:13] [INFO ] After 2429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 23:37:15] [INFO ] [Nat]Absence check using 90 positive place invariants in 128 ms returned sat
[2023-03-13 23:37:16] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 178 ms returned sat
[2023-03-13 23:37:38] [INFO ] After 20620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 23:37:38] [INFO ] State equation strengthened by 39087 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 23:37:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:37:38] [INFO ] After 25537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 122 out of 9000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9000/9000 places, 40857/40857 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 9000 transition count 40855
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8998 transition count 40855
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 11 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 66 place count 8967 transition count 40824
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 8967 transition count 40823
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 8966 transition count 40823
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 98 place count 8966 transition count 40823
Applied a total of 98 rules in 13029 ms. Remains 8966 /9000 variables (removed 34) and now considering 40823/40857 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13030 ms. Remains : 8966/9000 places, 40823/40857 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 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 24 ms. (steps per millisecond=416 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 104291 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104291 steps, saw 101309 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-13 23:37:55] [INFO ] Flow matrix only has 40772 transitions (discarded 51 similar events)
// Phase 1: matrix 40772 rows 8966 cols
[2023-03-13 23:37:59] [INFO ] Computed 92 place invariants in 3494 ms
[2023-03-13 23:38:01] [INFO ] After 2657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 23:38:04] [INFO ] [Nat]Absence check using 90 positive place invariants in 127 ms returned sat
[2023-03-13 23:38:04] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 176 ms returned sat
[2023-03-13 23:38:26] [INFO ] After 20646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 23:38:27] [INFO ] State equation strengthened by 39378 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 23:38:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:38:27] [INFO ] After 25395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 122 out of 8966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8966/8966 places, 40823/40823 transitions.
Applied a total of 0 rules in 3001 ms. Remains 8966 /8966 variables (removed 0) and now considering 40823/40823 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3001 ms. Remains : 8966/8966 places, 40823/40823 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8966/8966 places, 40823/40823 transitions.
Applied a total of 0 rules in 3401 ms. Remains 8966 /8966 variables (removed 0) and now considering 40823/40823 (removed 0) transitions.
[2023-03-13 23:38:33] [INFO ] Flow matrix only has 40772 transitions (discarded 51 similar events)
[2023-03-13 23:38:33] [INFO ] Invariant cache hit.
[2023-03-13 23:38:34] [INFO ] Implicit Places using invariants in 869 ms returned []
Implicit Place search using SMT only with invariants took 870 ms to find 0 implicit places.
[2023-03-13 23:38:34] [INFO ] Flow matrix only has 40772 transitions (discarded 51 similar events)
[2023-03-13 23:38:34] [INFO ] Invariant cache hit.
[2023-03-13 23:38:57] [INFO ] Dead Transitions using invariants and state equation in 22968 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27259 ms. Remains : 8966/8966 places, 40823/40823 transitions.
Graph (trivial) has 38544 edges and 8966 vertex of which 7753 / 8966 are part of one of the 2 SCC in 11 ms
Free SCC test removed 7751 places
Drop transitions removed 28754 transitions
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 36812 transitions.
Graph (complete) has 4662 edges and 1215 vertex of which 959 are kept as prefixes of interest. Removing 256 places using SCC suffix rule.1 ms
Discarding 256 places :
Also discarding 81 output transitions
Drop transitions removed 81 transitions
Drop transitions removed 781 transitions
Reduce isomorphic transitions removed 781 transitions.
Iterating post reduction 0 with 781 rules applied. Total rules applied 783 place count 959 transition count 3149
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 783 place count 959 transition count 3146
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 789 place count 956 transition count 3146
Discarding 648 places :
Symmetric choice reduction at 1 with 648 rule applications. Total rules 1437 place count 308 transition count 1368
Iterating global reduction 1 with 648 rules applied. Total rules applied 2085 place count 308 transition count 1368
Ensure Unique test removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Iterating post reduction 1 with 481 rules applied. Total rules applied 2566 place count 308 transition count 887
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 2647 place count 227 transition count 725
Iterating global reduction 2 with 81 rules applied. Total rules applied 2728 place count 227 transition count 725
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 2809 place count 227 transition count 644
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 2811 place count 226 transition count 643
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2815 place count 224 transition count 648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2816 place count 224 transition count 647
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 4 with 44 rules applied. Total rules applied 2860 place count 224 transition count 603
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 2863 place count 224 transition count 600
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2866 place count 221 transition count 600
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2866 place count 221 transition count 599
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2868 place count 220 transition count 599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2869 place count 219 transition count 597
Iterating global reduction 6 with 1 rules applied. Total rules applied 2870 place count 219 transition count 597
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 2900 place count 204 transition count 582
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2907 place count 204 transition count 575
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2909 place count 203 transition count 575
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2911 place count 203 transition count 573
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 2916 place count 203 transition count 568
Free-agglomeration rule applied 28 times with reduction of 1 identical transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 2944 place count 203 transition count 539
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 8 with 70 rules applied. Total rules applied 3014 place count 175 transition count 497
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 3019 place count 175 transition count 492
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 3041 place count 175 transition count 492
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 3049 place count 175 transition count 484
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3050 place count 174 transition count 483
Iterating global reduction 10 with 1 rules applied. Total rules applied 3051 place count 174 transition count 483
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 3054 place count 171 transition count 480
Applied a total of 3054 rules in 962 ms. Remains 171 /8966 variables (removed 8795) and now considering 480/40823 (removed 40343) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 480 rows 171 cols
[2023-03-13 23:38:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 23:38:58] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 23:38:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 23:38:59] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-13 23:38:59] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-13 23:38:59] [INFO ] After 583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-13 23:38:59] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 23:38:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8966 places, 40823 transitions and 162034 arcs took 99 ms.
[2023-03-13 23:39:00] [INFO ] Flatten gal took : 1122 ms
Total runtime 276038 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: 8966 NrTr: 40823 NrArc: 162034)

parse formulas
formulas created successfully
place and transition orderings generation:1m19.680sec

net check time: 0m 0.031sec

init dd package: 0m 2.934sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 7318600 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16015604 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 4.582sec

95337 159584 210946

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-090"
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-090, 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-167813696200774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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