Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r394-oct2-167903718200654.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldPPPt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718200654
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 569K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679527674419

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=ShieldPPPt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:27:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 23:27:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:27:57] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-22 23:27:57] [INFO ] Transformed 2343 places.
[2023-03-22 23:27:57] [INFO ] Transformed 2133 transitions.
[2023-03-22 23:27:57] [INFO ] Found NUPN structural information;
[2023-03-22 23:27:57] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 14) seen :7
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2023-03-22 23:27:58] [INFO ] Computed 331 place invariants in 30 ms
[2023-03-22 23:27:59] [INFO ] After 1057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 23:28:00] [INFO ] [Nat]Absence check using 331 positive place invariants in 110 ms returned sat
[2023-03-22 23:28:02] [INFO ] After 2398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 23:28:04] [INFO ] Deduced a trap composed of 19 places in 915 ms of which 11 ms to minimize.
[2023-03-22 23:28:04] [INFO ] Deduced a trap composed of 23 places in 745 ms of which 3 ms to minimize.
[2023-03-22 23:28:05] [INFO ] Deduced a trap composed of 29 places in 808 ms of which 10 ms to minimize.
[2023-03-22 23:28:06] [INFO ] Deduced a trap composed of 25 places in 605 ms of which 1 ms to minimize.
[2023-03-22 23:28:07] [INFO ] Deduced a trap composed of 21 places in 938 ms of which 2 ms to minimize.
[2023-03-22 23:28:08] [INFO ] Deduced a trap composed of 25 places in 578 ms of which 1 ms to minimize.
[2023-03-22 23:28:08] [INFO ] Deduced a trap composed of 22 places in 555 ms of which 2 ms to minimize.
[2023-03-22 23:28:09] [INFO ] Deduced a trap composed of 19 places in 643 ms of which 4 ms to minimize.
[2023-03-22 23:28:10] [INFO ] Deduced a trap composed of 22 places in 662 ms of which 2 ms to minimize.
[2023-03-22 23:28:10] [INFO ] Deduced a trap composed of 39 places in 544 ms of which 1 ms to minimize.
[2023-03-22 23:28:11] [INFO ] Deduced a trap composed of 23 places in 553 ms of which 1 ms to minimize.
[2023-03-22 23:28:12] [INFO ] Deduced a trap composed of 34 places in 529 ms of which 1 ms to minimize.
[2023-03-22 23:28:13] [INFO ] Deduced a trap composed of 20 places in 779 ms of which 2 ms to minimize.
[2023-03-22 23:28:13] [INFO ] Deduced a trap composed of 42 places in 478 ms of which 1 ms to minimize.
[2023-03-22 23:28:14] [INFO ] Deduced a trap composed of 48 places in 501 ms of which 2 ms to minimize.
[2023-03-22 23:28:14] [INFO ] Deduced a trap composed of 23 places in 513 ms of which 1 ms to minimize.
[2023-03-22 23:28:15] [INFO ] Deduced a trap composed of 21 places in 531 ms of which 1 ms to minimize.
[2023-03-22 23:28:16] [INFO ] Deduced a trap composed of 42 places in 548 ms of which 1 ms to minimize.
[2023-03-22 23:28:16] [INFO ] Deduced a trap composed of 28 places in 487 ms of which 1 ms to minimize.
[2023-03-22 23:28:17] [INFO ] Deduced a trap composed of 33 places in 482 ms of which 1 ms to minimize.
[2023-03-22 23:28:17] [INFO ] Deduced a trap composed of 34 places in 402 ms of which 1 ms to minimize.
[2023-03-22 23:28:18] [INFO ] Deduced a trap composed of 31 places in 402 ms of which 1 ms to minimize.
[2023-03-22 23:28:18] [INFO ] Deduced a trap composed of 32 places in 418 ms of which 1 ms to minimize.
[2023-03-22 23:28:19] [INFO ] Deduced a trap composed of 32 places in 411 ms of which 1 ms to minimize.
[2023-03-22 23:28:19] [INFO ] Deduced a trap composed of 25 places in 487 ms of which 1 ms to minimize.
[2023-03-22 23:28:20] [INFO ] Deduced a trap composed of 36 places in 443 ms of which 10 ms to minimize.
[2023-03-22 23:28:20] [INFO ] Deduced a trap composed of 33 places in 460 ms of which 1 ms to minimize.
[2023-03-22 23:28:21] [INFO ] Deduced a trap composed of 48 places in 398 ms of which 1 ms to minimize.
[2023-03-22 23:28:21] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 2 ms to minimize.
[2023-03-22 23:28:22] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 1 ms to minimize.
[2023-03-22 23:28:22] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 1 ms to minimize.
[2023-03-22 23:28:23] [INFO ] Deduced a trap composed of 31 places in 457 ms of which 1 ms to minimize.
[2023-03-22 23:28:23] [INFO ] Deduced a trap composed of 36 places in 356 ms of which 1 ms to minimize.
[2023-03-22 23:28:24] [INFO ] Deduced a trap composed of 29 places in 340 ms of which 2 ms to minimize.
[2023-03-22 23:28:24] [INFO ] Deduced a trap composed of 38 places in 406 ms of which 1 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-22 23:28:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 23:28:24] [INFO ] After 25311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 516 ms.
Support contains 32 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 2343 transition count 1581
Reduce places removed 552 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 554 rules applied. Total rules applied 1106 place count 1791 transition count 1579
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 1114 place count 1790 transition count 1572
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1121 place count 1783 transition count 1572
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 120 Pre rules applied. Total rules applied 1121 place count 1783 transition count 1452
Deduced a syphon composed of 120 places in 4 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1361 place count 1663 transition count 1452
Discarding 203 places :
Symmetric choice reduction at 4 with 203 rule applications. Total rules 1564 place count 1460 transition count 1249
Iterating global reduction 4 with 203 rules applied. Total rules applied 1767 place count 1460 transition count 1249
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 85 Pre rules applied. Total rules applied 1767 place count 1460 transition count 1164
Deduced a syphon composed of 85 places in 5 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 1937 place count 1375 transition count 1164
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 2 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 4 with 994 rules applied. Total rules applied 2931 place count 878 transition count 667
Renaming transitions due to excessive name length > 1024 char.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 3101 place count 793 transition count 667
Partial Free-agglomeration rule applied 85 times.
Drop transitions removed 85 transitions
Iterating global reduction 4 with 85 rules applied. Total rules applied 3186 place count 793 transition count 667
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3187 place count 792 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3188 place count 791 transition count 666
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3188 place count 791 transition count 664
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3192 place count 789 transition count 664
Applied a total of 3192 rules in 623 ms. Remains 789 /2343 variables (removed 1554) and now considering 664/2133 (removed 1469) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 789/2343 places, 664/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 80976 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80976 steps, saw 61106 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 664 rows 789 cols
[2023-03-22 23:28:29] [INFO ] Computed 330 place invariants in 14 ms
[2023-03-22 23:28:29] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 23:28:30] [INFO ] [Nat]Absence check using 330 positive place invariants in 191 ms returned sat
[2023-03-22 23:28:30] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 23:28:30] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-22 23:28:31] [INFO ] After 465ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 23:28:31] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2023-03-22 23:28:31] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2023-03-22 23:28:31] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2023-03-22 23:28:31] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-22 23:28:31] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2023-03-22 23:28:32] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2023-03-22 23:28:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 632 ms
[2023-03-22 23:28:32] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2023-03-22 23:28:32] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 3 ms to minimize.
[2023-03-22 23:28:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2023-03-22 23:28:32] [INFO ] After 1805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 488 ms.
[2023-03-22 23:28:33] [INFO ] After 3314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 157 ms.
Support contains 32 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 664/664 transitions.
Applied a total of 0 rules in 25 ms. Remains 789 /789 variables (removed 0) and now considering 664/664 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 789/789 places, 664/664 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 664/664 transitions.
Applied a total of 0 rules in 34 ms. Remains 789 /789 variables (removed 0) and now considering 664/664 (removed 0) transitions.
[2023-03-22 23:28:33] [INFO ] Invariant cache hit.
[2023-03-22 23:28:33] [INFO ] Implicit Places using invariants in 452 ms returned [771, 775]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 454 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 787/789 places, 664/664 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 785 transition count 662
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 785 transition count 662
Applied a total of 4 rules in 47 ms. Remains 785 /787 variables (removed 2) and now considering 662/664 (removed 2) transitions.
// Phase 1: matrix 662 rows 785 cols
[2023-03-22 23:28:33] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 23:28:34] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-22 23:28:34] [INFO ] Invariant cache hit.
[2023-03-22 23:28:35] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-22 23:28:36] [INFO ] Implicit Places using invariants and state equation in 2455 ms returned []
Implicit Place search using SMT with State Equation took 2895 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 785/789 places, 662/664 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3431 ms. Remains : 785/789 places, 662/664 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 7) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 23:28:37] [INFO ] Invariant cache hit.
[2023-03-22 23:28:37] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 23:28:38] [INFO ] [Nat]Absence check using 328 positive place invariants in 62 ms returned sat
[2023-03-22 23:28:38] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 23:28:38] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-22 23:28:39] [INFO ] After 647ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 23:28:39] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-22 23:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-22 23:28:40] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-22 23:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-22 23:28:40] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-22 23:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2023-03-22 23:28:40] [INFO ] After 2117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 434 ms.
[2023-03-22 23:28:41] [INFO ] After 3665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 145 ms.
Support contains 31 out of 785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 662/662 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 785 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 784 transition count 661
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 783 transition count 661
Applied a total of 4 rules in 41 ms. Remains 783 /785 variables (removed 2) and now considering 661/662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 783/785 places, 661/662 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 98829 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98829 steps, saw 72173 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 661 rows 783 cols
[2023-03-22 23:28:45] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 23:28:45] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 23:28:45] [INFO ] [Nat]Absence check using 328 positive place invariants in 65 ms returned sat
[2023-03-22 23:28:46] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 23:28:46] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-22 23:28:47] [INFO ] After 487ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 23:28:47] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2023-03-22 23:28:47] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2023-03-22 23:28:47] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 12 ms to minimize.
[2023-03-22 23:28:47] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2023-03-22 23:28:47] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-22 23:28:47] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2023-03-22 23:28:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 785 ms
[2023-03-22 23:28:48] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-22 23:28:48] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 14 ms to minimize.
[2023-03-22 23:28:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2023-03-22 23:28:48] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 1 ms to minimize.
[2023-03-22 23:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-22 23:28:49] [INFO ] After 2522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 636 ms.
[2023-03-22 23:28:49] [INFO ] After 4137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 170 ms.
Support contains 31 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 661/661 transitions.
Applied a total of 0 rules in 18 ms. Remains 783 /783 variables (removed 0) and now considering 661/661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 783/783 places, 661/661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 661/661 transitions.
Applied a total of 0 rules in 17 ms. Remains 783 /783 variables (removed 0) and now considering 661/661 (removed 0) transitions.
[2023-03-22 23:28:49] [INFO ] Invariant cache hit.
[2023-03-22 23:28:50] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-22 23:28:50] [INFO ] Invariant cache hit.
[2023-03-22 23:28:50] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-22 23:28:52] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 2921 ms to find 0 implicit places.
[2023-03-22 23:28:52] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-22 23:28:52] [INFO ] Invariant cache hit.
[2023-03-22 23:28:53] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3375 ms. Remains : 783/783 places, 661/661 transitions.
Partial Free-agglomeration rule applied 180 times.
Drop transitions removed 180 transitions
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 783 transition count 661
Applied a total of 180 rules in 61 ms. Remains 783 /783 variables (removed 0) and now considering 661/661 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 661 rows 783 cols
[2023-03-22 23:28:53] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 23:28:53] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 23:28:53] [INFO ] [Nat]Absence check using 328 positive place invariants in 52 ms returned sat
[2023-03-22 23:28:54] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 23:28:54] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-22 23:28:55] [INFO ] After 612ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 23:28:55] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-22 23:28:55] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-22 23:28:55] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-22 23:28:55] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-22 23:28:56] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2023-03-22 23:28:56] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 12 ms to minimize.
[2023-03-22 23:28:56] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2023-03-22 23:28:56] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 1 ms to minimize.
[2023-03-22 23:28:56] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-22 23:28:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1657 ms
[2023-03-22 23:28:57] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-22 23:28:57] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 9 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 8 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1092 ms
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
[2023-03-22 23:28:59] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2023-03-22 23:28:59] [INFO ] After 5032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 859 ms.
[2023-03-22 23:29:00] [INFO ] After 6938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 23:29:00] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-22 23:29:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 783 places, 661 transitions and 2986 arcs took 11 ms.
[2023-03-22 23:29:01] [INFO ] Flatten gal took : 171 ms
Total runtime 63895 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: ShieldPPPt_PT_030B
(NrP: 783 NrTr: 661 NrArc: 2986)

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

net check time: 0m 0.000sec

init dd package: 0m 2.874sec


before gc: list nodes free: 1448561

after gc: idd nodes used:307526, unused:63692474; list nodes free:290081686
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6062940 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098864 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

360821

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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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 r394-oct2-167903718200654"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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