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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:19 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.0K 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 11K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 00:39 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 60M 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-100-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678751743769

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-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 23:55:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 23:55:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:55:46] [INFO ] Load time of PNML (sax parser for PT used): 1176 ms
[2023-03-13 23:55:47] [INFO ] Transformed 21204 places.
[2023-03-13 23:55:47] [INFO ] Transformed 60600 transitions.
[2023-03-13 23:55:47] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1468 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 869 ms. (steps per millisecond=11 ) properties (out of 16) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 72430 steps, run timeout after 3003 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72430 steps, saw 71497 distinct states, run finished after 3004 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 60600 rows 21204 cols
[2023-03-13 23:56:15] [INFO ] Computed 103 place invariants in 23713 ms
[2023-03-13 23:56:23] [INFO ] After 8016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 23:56:31] [INFO ] [Nat]Absence check using 101 positive place invariants in 339 ms returned sat
[2023-03-13 23:56:31] [INFO ] [Nat]Absence check using 101 positive and 2 generalized place invariants in 589 ms returned sat
[2023-03-13 23:56:48] [INFO ] After 11688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-13 23:56:48] [INFO ] State equation strengthened by 19900 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:56:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:56:48] [INFO ] After 25356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 194 out of 21204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Graph (complete) has 81501 edges and 21204 vertex of which 21203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.78 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 678 transitions
Trivial Post-agglo rules discarded 678 transitions
Performed 678 trivial Post agglomeration. Transition count delta: 678
Iterating post reduction 0 with 678 rules applied. Total rules applied 679 place count 21203 transition count 59922
Reduce places removed 678 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 685 rules applied. Total rules applied 1364 place count 20525 transition count 59915
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1371 place count 20518 transition count 59915
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1371 place count 20518 transition count 59913
Deduced a syphon composed of 2 places in 41 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1375 place count 20516 transition count 59913
Performed 9423 Post agglomeration using F-continuation condition.Transition count delta: 9423
Deduced a syphon composed of 9423 places in 51 ms
Reduce places removed 9423 places and 0 transitions.
Iterating global reduction 3 with 18846 rules applied. Total rules applied 20221 place count 11093 transition count 50490
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 20228 place count 11093 transition count 50483
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 20235 place count 11086 transition count 50483
Partial Free-agglomeration rule applied 10682 times.
Drop transitions removed 10682 transitions
Iterating global reduction 4 with 10682 rules applied. Total rules applied 30917 place count 11086 transition count 50483
Partial Free-agglomeration rule applied 308 times.
Drop transitions removed 308 transitions
Iterating global reduction 4 with 308 rules applied. Total rules applied 31225 place count 11086 transition count 50483
Applied a total of 31225 rules in 33791 ms. Remains 11086 /21204 variables (removed 10118) and now considering 50483/60600 (removed 10117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33801 ms. Remains : 11086/21204 places, 50483/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 813 ms. (steps per millisecond=12 ) properties (out of 15) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-12 FALSE 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) 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 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 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 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) 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 14) seen :0
Interrupted probabilistic random walk after 66343 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66343 steps, saw 64761 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-13 23:57:26] [INFO ] Flow matrix only has 50391 transitions (discarded 92 similar events)
// Phase 1: matrix 50391 rows 11086 cols
[2023-03-13 23:57:37] [INFO ] Computed 102 place invariants in 10954 ms
[2023-03-13 23:57:41] [INFO ] After 3960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 23:57:45] [INFO ] [Nat]Absence check using 100 positive place invariants in 158 ms returned sat
[2023-03-13 23:57:46] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 245 ms returned sat
[2023-03-13 23:58:06] [INFO ] After 18253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-13 23:58:07] [INFO ] State equation strengthened by 48633 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:58:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:58:07] [INFO ] After 25628ms 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 0 ms.
Support contains 150 out of 11086 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11086/11086 places, 50483/50483 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 11086 transition count 50482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11085 transition count 50482
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 20 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 48 place count 11062 transition count 50459
Partial Free-agglomeration rule applied 410 times.
Drop transitions removed 410 transitions
Iterating global reduction 2 with 410 rules applied. Total rules applied 458 place count 11062 transition count 50459
Applied a total of 458 rules in 14144 ms. Remains 11062 /11086 variables (removed 24) and now considering 50459/50483 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14144 ms. Remains : 11062/11086 places, 50459/50483 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 951 ms. (steps per millisecond=10 ) properties (out of 14) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) 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 13) 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 13) seen :0
Interrupted probabilistic random walk after 63641 steps, run timeout after 3002 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63641 steps, saw 62164 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-13 23:58:26] [INFO ] Flow matrix only has 50384 transitions (discarded 75 similar events)
// Phase 1: matrix 50384 rows 11062 cols
[2023-03-13 23:58:35] [INFO ] Computed 102 place invariants in 9617 ms
[2023-03-13 23:58:39] [INFO ] After 3640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 23:58:43] [INFO ] [Nat]Absence check using 100 positive place invariants in 164 ms returned sat
[2023-03-13 23:58:43] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 248 ms returned sat
[2023-03-13 23:59:04] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 149 out of 11062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11062/11062 places, 50459/50459 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11062 transition count 50459
Applied a total of 1 rules in 8520 ms. Remains 11062 /11062 variables (removed 0) and now considering 50459/50459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8520 ms. Remains : 11062/11062 places, 50459/50459 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 13) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-00 FALSE 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) 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 :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 35 ms. (steps per millisecond=285 ) properties (out of 12) 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 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
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
Interrupted probabilistic random walk after 83716 steps, run timeout after 3002 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83716 steps, saw 81486 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-13 23:59:17] [INFO ] Flow matrix only has 50385 transitions (discarded 74 similar events)
// Phase 1: matrix 50385 rows 11062 cols
[2023-03-13 23:59:26] [INFO ] Computed 102 place invariants in 9432 ms
[2023-03-13 23:59:30] [INFO ] [Real]Absence check using 100 positive place invariants in 154 ms returned sat
[2023-03-13 23:59:30] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 249 ms returned sat
[2023-03-13 23:59:30] [INFO ] After 4195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 23:59:34] [INFO ] [Nat]Absence check using 100 positive place invariants in 166 ms returned sat
[2023-03-13 23:59:34] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 255 ms returned sat
[2023-03-13 23:59:55] [INFO ] After 25017ms 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 147 out of 11062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11062/11062 places, 50459/50459 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11062 transition count 50459
Applied a total of 2 rules in 9121 ms. Remains 11062 /11062 variables (removed 0) and now considering 50459/50459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9121 ms. Remains : 11062/11062 places, 50459/50459 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 12) seen :2
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 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 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 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 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 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 34 ms. (steps per millisecond=294 ) properties (out of 10) 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 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 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-14 00:00:05] [INFO ] Flow matrix only has 50386 transitions (discarded 73 similar events)
// Phase 1: matrix 50386 rows 11062 cols
[2023-03-14 00:00:17] [INFO ] Computed 102 place invariants in 11597 ms
[2023-03-14 00:00:20] [INFO ] [Real]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-14 00:00:20] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 267 ms returned sat
[2023-03-14 00:00:21] [INFO ] After 3479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 00:00:24] [INFO ] [Nat]Absence check using 100 positive place invariants in 155 ms returned sat
[2023-03-14 00:00:24] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 246 ms returned sat
[2023-03-14 00:00:46] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 142 out of 11062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11062/11062 places, 50459/50459 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 11059 transition count 50456
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 11059 transition count 50456
Applied a total of 8 rules in 13302 ms. Remains 11059 /11062 variables (removed 3) and now considering 50456/50459 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13303 ms. Remains : 11059/11062 places, 50456/50459 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-14 00:01:00] [INFO ] Flow matrix only has 50385 transitions (discarded 71 similar events)
// Phase 1: matrix 50385 rows 11059 cols
[2023-03-14 00:01:10] [INFO ] Computed 102 place invariants in 10072 ms
[2023-03-14 00:01:13] [INFO ] [Real]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-14 00:01:13] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 242 ms returned sat
[2023-03-14 00:01:13] [INFO ] After 3299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 00:01:16] [INFO ] [Nat]Absence check using 100 positive place invariants in 156 ms returned sat
[2023-03-14 00:01:16] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 248 ms returned sat
[2023-03-14 00:01:38] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 140 out of 11059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11059/11059 places, 50456/50456 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 11056 transition count 50453
Applied a total of 6 rules in 12307 ms. Remains 11056 /11059 variables (removed 3) and now considering 50453/50456 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12308 ms. Remains : 11056/11059 places, 50453/50456 transitions.
[2023-03-14 00:01:51] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-14 00:01:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11056 places, 50453 transitions and 201190 arcs took 121 ms.
[2023-03-14 00:01:53] [INFO ] Flatten gal took : 1581 ms
Total runtime 367572 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: 11056 NrTr: 50453 NrArc: 201190)

parse formulas
formulas created successfully
place and transition orderings generation:1m58.781sec

net check time: 0m 0.034sec

init dd package: 0m 2.893sec


before gc: list nodes free: 1761779

after gc: idd nodes used:212129, unused:63787871; list nodes free:257045269
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6446200 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15998360 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 7.115sec

76110 625378

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

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