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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 7.2K Feb 26 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.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 14K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:46 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 30M 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-070-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678748664706

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 23:04:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 23:04:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:04:27] [INFO ] Load time of PNML (sax parser for PT used): 759 ms
[2023-03-13 23:04:27] [INFO ] Transformed 10644 places.
[2023-03-13 23:04:27] [INFO ] Transformed 29820 transitions.
[2023-03-13 23:04:27] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 937 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 712 ms. (steps per millisecond=14 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) 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 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 29 ms. (steps per millisecond=344 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 29820 rows 10644 cols
[2023-03-13 23:04:33] [INFO ] Computed 73 place invariants in 4791 ms
[2023-03-13 23:04:37] [INFO ] [Real]Absence check using 71 positive place invariants in 178 ms returned sat
[2023-03-13 23:04:37] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 245 ms returned sat
[2023-03-13 23:04:38] [INFO ] After 5364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 23:04:42] [INFO ] [Nat]Absence check using 71 positive place invariants in 132 ms returned sat
[2023-03-13 23:04:42] [INFO ] [Nat]Absence check using 71 positive and 2 generalized place invariants in 238 ms returned sat
[2023-03-13 23:05:03] [INFO ] After 19128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-13 23:05:04] [INFO ] State equation strengthened by 9730 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:05:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:05:04] [INFO ] After 25238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 155 out of 10644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Graph (complete) has 40251 edges and 10644 vertex of which 10643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.51 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 438 rules applied. Total rules applied 439 place count 10643 transition count 29382
Reduce places removed 438 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 440 rules applied. Total rules applied 879 place count 10205 transition count 29380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 881 place count 10203 transition count 29380
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 881 place count 10203 transition count 29363
Deduced a syphon composed of 17 places in 35 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 915 place count 10186 transition count 29363
Performed 4756 Post agglomeration using F-continuation condition.Transition count delta: 4756
Deduced a syphon composed of 4756 places in 14 ms
Reduce places removed 4756 places and 0 transitions.
Iterating global reduction 3 with 9512 rules applied. Total rules applied 10427 place count 5430 transition count 24607
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 10456 place count 5430 transition count 24578
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 10485 place count 5401 transition count 24578
Partial Free-agglomeration rule applied 4869 times.
Drop transitions removed 4869 transitions
Iterating global reduction 4 with 4869 rules applied. Total rules applied 15354 place count 5401 transition count 24578
Partial Free-agglomeration rule applied 1218 times.
Drop transitions removed 1218 transitions
Iterating global reduction 4 with 1218 rules applied. Total rules applied 16572 place count 5401 transition count 24578
Applied a total of 16572 rules in 11341 ms. Remains 5401 /10644 variables (removed 5243) and now considering 24578/29820 (removed 5242) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11345 ms. Remains : 5401/10644 places, 24578/29820 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 13) seen :3
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 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 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 38 ms. (steps per millisecond=263 ) properties (out of 10) 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 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 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) 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-13 23:05:16] [INFO ] Flow matrix only has 24533 transitions (discarded 45 similar events)
// Phase 1: matrix 24533 rows 5401 cols
[2023-03-13 23:05:18] [INFO ] Computed 72 place invariants in 1520 ms
[2023-03-13 23:05:19] [INFO ] [Real]Absence check using 70 positive place invariants in 76 ms returned sat
[2023-03-13 23:05:19] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 97 ms returned sat
[2023-03-13 23:05:20] [INFO ] After 2383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 23:05:22] [INFO ] [Nat]Absence check using 70 positive place invariants in 91 ms returned sat
[2023-03-13 23:05:22] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 100 ms returned sat
[2023-03-13 23:05:40] [INFO ] After 17260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-13 23:05:41] [INFO ] State equation strengthened by 23876 read => feed constraints.
[2023-03-13 23:05:45] [INFO ] After 4545ms SMT Verify possible using 23876 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-13 23:05:45] [INFO ] After 4546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 23:05:45] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 151 out of 5401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5401/5401 places, 24578/24578 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 5398 transition count 24575
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 5398 transition count 24575
Applied a total of 7 rules in 4108 ms. Remains 5398 /5401 variables (removed 3) and now considering 24575/24578 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4108 ms. Remains : 5398/5401 places, 24575/24578 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 10) seen :3
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) 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 7) 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 7) seen :1
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 23:05:50] [INFO ] Flow matrix only has 24531 transitions (discarded 44 similar events)
// Phase 1: matrix 24531 rows 5398 cols
[2023-03-13 23:05:51] [INFO ] Computed 72 place invariants in 1104 ms
[2023-03-13 23:05:52] [INFO ] [Real]Absence check using 70 positive place invariants in 89 ms returned sat
[2023-03-13 23:05:52] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 99 ms returned sat
[2023-03-13 23:05:53] [INFO ] After 1646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 23:05:54] [INFO ] [Nat]Absence check using 70 positive place invariants in 61 ms returned sat
[2023-03-13 23:05:54] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 93 ms returned sat
[2023-03-13 23:06:08] [INFO ] After 13619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 23:06:08] [INFO ] State equation strengthened by 23884 read => feed constraints.
[2023-03-13 23:06:18] [INFO ] After 9140ms SMT Verify possible using 23884 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 23:06:18] [INFO ] After 9256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-13 23:06:18] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 122 out of 5398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5398/5398 places, 24575/24575 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 9 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 5385 transition count 24562
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 38 place count 5385 transition count 24562
Applied a total of 38 rules in 4051 ms. Remains 5385 /5398 variables (removed 13) and now considering 24562/24575 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4051 ms. Remains : 5385/5398 places, 24562/24575 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 62632 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{5=1}
Probabilistic random walk after 62632 steps, saw 52498 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :1
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-13 23:06:26] [INFO ] Flow matrix only has 24530 transitions (discarded 32 similar events)
// Phase 1: matrix 24530 rows 5385 cols
[2023-03-13 23:06:27] [INFO ] Computed 72 place invariants in 1311 ms
[2023-03-13 23:06:28] [INFO ] [Real]Absence check using 70 positive place invariants in 88 ms returned sat
[2023-03-13 23:06:28] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 97 ms returned sat
[2023-03-13 23:06:28] [INFO ] After 1515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 23:06:29] [INFO ] [Nat]Absence check using 70 positive place invariants in 68 ms returned sat
[2023-03-13 23:06:30] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 89 ms returned sat
[2023-03-13 23:06:45] [INFO ] After 14611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 23:06:45] [INFO ] State equation strengthened by 23928 read => feed constraints.
[2023-03-13 23:06:53] [INFO ] After 7928ms SMT Verify possible using 23928 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 23:07:03] [INFO ] Deduced a trap composed of 2 places in 9300 ms of which 16 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:07:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:07:03] [INFO ] After 34401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 5385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5385/5385 places, 24562/24562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5384 transition count 24561
Applied a total of 2 rules in 2808 ms. Remains 5384 /5385 variables (removed 1) and now considering 24561/24562 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2808 ms. Remains : 5384/5385 places, 24561/24562 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 62138 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62138 steps, saw 50118 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 23:07:09] [INFO ] Flow matrix only has 24529 transitions (discarded 32 similar events)
// Phase 1: matrix 24529 rows 5384 cols
[2023-03-13 23:07:11] [INFO ] Computed 72 place invariants in 1410 ms
[2023-03-13 23:07:12] [INFO ] [Real]Absence check using 70 positive place invariants in 68 ms returned sat
[2023-03-13 23:07:12] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 93 ms returned sat
[2023-03-13 23:07:12] [INFO ] After 1310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 23:07:13] [INFO ] [Nat]Absence check using 70 positive place invariants in 61 ms returned sat
[2023-03-13 23:07:13] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 90 ms returned sat
[2023-03-13 23:07:26] [INFO ] After 12198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 23:07:26] [INFO ] State equation strengthened by 23930 read => feed constraints.
[2023-03-13 23:07:33] [INFO ] After 6767ms SMT Verify possible using 23930 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 23:07:37] [INFO ] After 10928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-13 23:07:37] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 5384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5384/5384 places, 24561/24561 transitions.
Applied a total of 0 rules in 1299 ms. Remains 5384 /5384 variables (removed 0) and now considering 24561/24561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1299 ms. Remains : 5384/5384 places, 24561/24561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5384/5384 places, 24561/24561 transitions.
Applied a total of 0 rules in 1579 ms. Remains 5384 /5384 variables (removed 0) and now considering 24561/24561 (removed 0) transitions.
[2023-03-13 23:07:40] [INFO ] Flow matrix only has 24529 transitions (discarded 32 similar events)
[2023-03-13 23:07:40] [INFO ] Invariant cache hit.
[2023-03-13 23:07:43] [INFO ] Implicit Places using invariants in 3496 ms returned []
Implicit Place search using SMT only with invariants took 3499 ms to find 0 implicit places.
[2023-03-13 23:07:43] [INFO ] Flow matrix only has 24529 transitions (discarded 32 similar events)
[2023-03-13 23:07:43] [INFO ] Invariant cache hit.
[2023-03-13 23:07:54] [INFO ] Dead Transitions using invariants and state equation in 10872 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15955 ms. Remains : 5384/5384 places, 24561/24561 transitions.
Graph (trivial) has 21736 edges and 5384 vertex of which 3940 / 5384 are part of one of the 2 SCC in 13 ms
Free SCC test removed 3938 places
Drop transitions removed 14127 transitions
Ensure Unique test removed 4691 transitions
Reduce isomorphic transitions removed 18818 transitions.
Graph (complete) has 6168 edges and 1446 vertex of which 1313 are kept as prefixes of interest. Removing 133 places using SCC suffix rule.1 ms
Discarding 133 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Drop transitions removed 763 transitions
Reduce isomorphic transitions removed 763 transitions.
Iterating post reduction 0 with 763 rules applied. Total rules applied 765 place count 1313 transition count 4936
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 765 place count 1313 transition count 4926
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 785 place count 1303 transition count 4926
Discarding 833 places :
Symmetric choice reduction at 1 with 833 rule applications. Total rules 1618 place count 470 transition count 2248
Iterating global reduction 1 with 833 rules applied. Total rules applied 2451 place count 470 transition count 2248
Ensure Unique test removed 790 transitions
Reduce isomorphic transitions removed 790 transitions.
Iterating post reduction 1 with 790 rules applied. Total rules applied 3241 place count 470 transition count 1458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3243 place count 469 transition count 1457
Drop transitions removed 255 transitions
Redundant transition composition rules discarded 255 transitions
Iterating global reduction 2 with 255 rules applied. Total rules applied 3498 place count 469 transition count 1202
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 3543 place count 424 transition count 1112
Iterating global reduction 2 with 45 rules applied. Total rules applied 3588 place count 424 transition count 1112
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 3816 place count 310 transition count 998
Ensure Unique test removed 155 transitions
Reduce isomorphic transitions removed 155 transitions.
Iterating post reduction 2 with 155 rules applied. Total rules applied 3971 place count 310 transition count 843
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 4061 place count 265 transition count 843
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 90 rules applied. Total rules applied 4151 place count 265 transition count 753
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 4212 place count 265 transition count 692
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 4225 place count 265 transition count 679
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 4238 place count 252 transition count 679
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4239 place count 252 transition count 678
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4240 place count 251 transition count 678
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 4279 place count 251 transition count 678
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 4293 place count 251 transition count 664
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 4299 place count 251 transition count 658
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 4304 place count 251 transition count 658
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 4309 place count 246 transition count 653
Iterating global reduction 7 with 5 rules applied. Total rules applied 4314 place count 246 transition count 653
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 4319 place count 246 transition count 648
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4320 place count 245 transition count 647
Applied a total of 4320 rules in 4528 ms. Remains 245 /5384 variables (removed 5139) and now considering 647/24561 (removed 23914) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 647 rows 245 cols
[2023-03-13 23:07:59] [INFO ] Computed 26 place invariants in 4 ms
[2023-03-13 23:07:59] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2023-03-13 23:07:59] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 23:07:59] [INFO ] [Nat]Absence check using 26 positive place invariants in 2 ms returned sat
[2023-03-13 23:07:59] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 23:07:59] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-13 23:08:00] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-13 23:08:00] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2023-03-13 23:08:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5384 places, 24561 transitions and 97743 arcs took 76 ms.
[2023-03-13 23:08:01] [INFO ] Flatten gal took : 751 ms
Total runtime 214810 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: gen
(NrP: 5384 NrTr: 24561 NrArc: 97743)

parse formulas
formulas created successfully
place and transition orderings generation:0m16.060sec

net check time: 0m 0.022sec

init dd package: 0m 3.187sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 8823472 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16051872 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 1.872sec

277202

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-070"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is CANInsertWithFailure-PT-070, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696200759"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-070.tgz
mv CANInsertWithFailure-PT-070 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;