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-167903717700302.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 ShieldIIPt-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-167903717700302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 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 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 512K 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 ShieldIIPt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679502497229

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=ShieldIIPt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:28:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 16:28:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:28:21] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-22 16:28:21] [INFO ] Transformed 2103 places.
[2023-03-22 16:28:21] [INFO ] Transformed 1953 transitions.
[2023-03-22 16:28:21] [INFO ] Found NUPN structural information;
[2023-03-22 16:28:21] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 15) seen :10
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-01 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-22 16:28:22] [INFO ] Computed 271 place invariants in 30 ms
[2023-03-22 16:28:23] [INFO ] After 1242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:28:24] [INFO ] [Nat]Absence check using 271 positive place invariants in 339 ms returned sat
[2023-03-22 16:28:29] [INFO ] After 4529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:28:30] [INFO ] Deduced a trap composed of 21 places in 1099 ms of which 17 ms to minimize.
[2023-03-22 16:28:32] [INFO ] Deduced a trap composed of 18 places in 1297 ms of which 2 ms to minimize.
[2023-03-22 16:28:33] [INFO ] Deduced a trap composed of 19 places in 1418 ms of which 12 ms to minimize.
[2023-03-22 16:28:34] [INFO ] Deduced a trap composed of 28 places in 665 ms of which 2 ms to minimize.
[2023-03-22 16:28:36] [INFO ] Deduced a trap composed of 18 places in 1250 ms of which 15 ms to minimize.
[2023-03-22 16:28:37] [INFO ] Deduced a trap composed of 31 places in 1845 ms of which 1 ms to minimize.
[2023-03-22 16:28:42] [INFO ] Deduced a trap composed of 45 places in 4454 ms of which 24 ms to minimize.
[2023-03-22 16:28:43] [INFO ] Deduced a trap composed of 37 places in 975 ms of which 2 ms to minimize.
[2023-03-22 16:28:44] [INFO ] Deduced a trap composed of 28 places in 612 ms of which 1 ms to minimize.
[2023-03-22 16:28:45] [INFO ] Deduced a trap composed of 28 places in 658 ms of which 1 ms to minimize.
[2023-03-22 16:28:45] [INFO ] Deduced a trap composed of 29 places in 678 ms of which 2 ms to minimize.
[2023-03-22 16:28:46] [INFO ] Deduced a trap composed of 19 places in 654 ms of which 2 ms to minimize.
[2023-03-22 16:28:47] [INFO ] Deduced a trap composed of 50 places in 834 ms of which 2 ms to minimize.
[2023-03-22 16:28:48] [INFO ] Deduced a trap composed of 27 places in 628 ms of which 2 ms to minimize.
[2023-03-22 16:28:48] [INFO ] Deduced a trap composed of 28 places in 577 ms of which 2 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 16:28:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:28:48] [INFO ] After 25313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 339 ms.
Support contains 113 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2103 transition count 1516
Reduce places removed 437 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 439 rules applied. Total rules applied 876 place count 1666 transition count 1514
Reduce places removed 1 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 30 rules applied. Total rules applied 906 place count 1665 transition count 1485
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 935 place count 1636 transition count 1485
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 935 place count 1636 transition count 1360
Deduced a syphon composed of 125 places in 3 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1185 place count 1511 transition count 1360
Discarding 188 places :
Symmetric choice reduction at 4 with 188 rule applications. Total rules 1373 place count 1323 transition count 1172
Iterating global reduction 4 with 188 rules applied. Total rules applied 1561 place count 1323 transition count 1172
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 1561 place count 1323 transition count 1098
Deduced a syphon composed of 74 places in 5 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 1709 place count 1249 transition count 1098
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 2 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 4 with 900 rules applied. Total rules applied 2609 place count 799 transition count 648
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2763 place count 722 transition count 688
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 722 transition count 686
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2767 place count 720 transition count 686
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 2793 place count 720 transition count 686
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2794 place count 719 transition count 685
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2796 place count 717 transition count 685
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2796 place count 717 transition count 684
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2798 place count 716 transition count 684
Applied a total of 2798 rules in 748 ms. Remains 716 /2103 variables (removed 1387) and now considering 684/1953 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 761 ms. Remains : 716/2103 places, 684/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 101291 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101291 steps, saw 58480 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 684 rows 716 cols
[2023-03-22 16:28:54] [INFO ] Computed 269 place invariants in 16 ms
[2023-03-22 16:28:54] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:28:54] [INFO ] [Nat]Absence check using 269 positive place invariants in 60 ms returned sat
[2023-03-22 16:28:55] [INFO ] After 819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:28:55] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-22 16:28:56] [INFO ] After 693ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:28:56] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2023-03-22 16:28:57] [INFO ] Deduced a trap composed of 5 places in 785 ms of which 2 ms to minimize.
[2023-03-22 16:28:57] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 2 ms to minimize.
[2023-03-22 16:28:57] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-22 16:28:57] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-22 16:28:58] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 0 ms to minimize.
[2023-03-22 16:28:58] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 23 ms to minimize.
[2023-03-22 16:28:58] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-22 16:28:58] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 0 ms to minimize.
[2023-03-22 16:28:59] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 0 ms to minimize.
[2023-03-22 16:28:59] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 1 ms to minimize.
[2023-03-22 16:28:59] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 1 ms to minimize.
[2023-03-22 16:29:00] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-22 16:29:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3998 ms
[2023-03-22 16:29:00] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 2 ms to minimize.
[2023-03-22 16:29:01] [INFO ] Deduced a trap composed of 10 places in 395 ms of which 1 ms to minimize.
[2023-03-22 16:29:01] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 1 ms to minimize.
[2023-03-22 16:29:01] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-22 16:29:02] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2023-03-22 16:29:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1750 ms
[2023-03-22 16:29:02] [INFO ] Deduced a trap composed of 8 places in 426 ms of which 9 ms to minimize.
[2023-03-22 16:29:03] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 1 ms to minimize.
[2023-03-22 16:29:03] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 1 ms to minimize.
[2023-03-22 16:29:03] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 0 ms to minimize.
[2023-03-22 16:29:04] [INFO ] Deduced a trap composed of 6 places in 616 ms of which 0 ms to minimize.
[2023-03-22 16:29:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2168 ms
[2023-03-22 16:29:04] [INFO ] After 9199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 575 ms.
[2023-03-22 16:29:05] [INFO ] After 10971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 119 ms.
Support contains 113 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 24 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 716/716 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 25 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2023-03-22 16:29:05] [INFO ] Invariant cache hit.
[2023-03-22 16:29:05] [INFO ] Implicit Places using invariants in 438 ms returned [702]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 442 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 715/716 places, 684/684 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 714 transition count 683
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 714 transition count 683
Applied a total of 2 rules in 44 ms. Remains 714 /715 variables (removed 1) and now considering 683/684 (removed 1) transitions.
// Phase 1: matrix 683 rows 714 cols
[2023-03-22 16:29:05] [INFO ] Computed 268 place invariants in 7 ms
[2023-03-22 16:29:06] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2023-03-22 16:29:06] [INFO ] Invariant cache hit.
[2023-03-22 16:29:07] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-22 16:29:10] [INFO ] Implicit Places using invariants and state equation in 4042 ms returned []
Implicit Place search using SMT with State Equation took 5085 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 714/716 places, 683/684 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5598 ms. Remains : 714/716 places, 683/684 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 126698 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126698 steps, saw 72768 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 16:29:14] [INFO ] Invariant cache hit.
[2023-03-22 16:29:14] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:29:14] [INFO ] [Nat]Absence check using 268 positive place invariants in 49 ms returned sat
[2023-03-22 16:29:15] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:29:15] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-22 16:29:16] [INFO ] After 610ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:29:16] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-22 16:29:16] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-22 16:29:17] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 1 ms to minimize.
[2023-03-22 16:29:17] [INFO ] Deduced a trap composed of 6 places in 489 ms of which 14 ms to minimize.
[2023-03-22 16:29:18] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2023-03-22 16:29:18] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2023-03-22 16:29:18] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-22 16:29:18] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2023-03-22 16:29:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2364 ms
[2023-03-22 16:29:19] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2023-03-22 16:29:20] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 1 ms to minimize.
[2023-03-22 16:29:20] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-22 16:29:20] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-22 16:29:20] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-22 16:29:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1548 ms
[2023-03-22 16:29:21] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2023-03-22 16:29:21] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 0 ms to minimize.
[2023-03-22 16:29:21] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2023-03-22 16:29:21] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 30 ms to minimize.
[2023-03-22 16:29:22] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 0 ms to minimize.
[2023-03-22 16:29:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1490 ms
[2023-03-22 16:29:22] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-22 16:29:23] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-22 16:29:23] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 0 ms to minimize.
[2023-03-22 16:29:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 868 ms
[2023-03-22 16:29:23] [INFO ] After 7523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 553 ms.
[2023-03-22 16:29:23] [INFO ] After 9285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 152 ms.
Support contains 113 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Applied a total of 0 rules in 47 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 714/714 places, 683/683 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Applied a total of 0 rules in 41 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
[2023-03-22 16:29:24] [INFO ] Invariant cache hit.
[2023-03-22 16:29:24] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-22 16:29:24] [INFO ] Invariant cache hit.
[2023-03-22 16:29:25] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-22 16:29:26] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2603 ms to find 0 implicit places.
[2023-03-22 16:29:26] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-22 16:29:26] [INFO ] Invariant cache hit.
[2023-03-22 16:29:27] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3457 ms. Remains : 714/714 places, 683/683 transitions.
Partial Free-agglomeration rule applied 73 times.
Drop transitions removed 73 transitions
Iterating global reduction 0 with 73 rules applied. Total rules applied 73 place count 714 transition count 683
Applied a total of 73 rules in 27 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 683 rows 714 cols
[2023-03-22 16:29:27] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-22 16:29:27] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:29:28] [INFO ] [Nat]Absence check using 268 positive place invariants in 166 ms returned sat
[2023-03-22 16:29:29] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:29:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-22 16:29:29] [INFO ] After 556ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:29:29] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-22 16:29:30] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 0 ms to minimize.
[2023-03-22 16:29:30] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 9 ms to minimize.
[2023-03-22 16:29:30] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2023-03-22 16:29:31] [INFO ] Deduced a trap composed of 5 places in 644 ms of which 37 ms to minimize.
[2023-03-22 16:29:31] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-22 16:29:31] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-22 16:29:32] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 28 ms to minimize.
[2023-03-22 16:29:32] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-22 16:29:32] [INFO ] Deduced a trap composed of 8 places in 538 ms of which 0 ms to minimize.
[2023-03-22 16:29:33] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 1 ms to minimize.
[2023-03-22 16:29:33] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-22 16:29:33] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-22 16:29:33] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-22 16:29:34] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 1 ms to minimize.
[2023-03-22 16:29:34] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 0 ms to minimize.
[2023-03-22 16:29:35] [INFO ] Deduced a trap composed of 6 places in 528 ms of which 2 ms to minimize.
[2023-03-22 16:29:35] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-22 16:29:35] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 0 ms to minimize.
[2023-03-22 16:29:35] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6115 ms
[2023-03-22 16:29:36] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2023-03-22 16:29:36] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 3 ms to minimize.
[2023-03-22 16:29:36] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2023-03-22 16:29:37] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-22 16:29:37] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2023-03-22 16:29:37] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-22 16:29:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1639 ms
[2023-03-22 16:29:38] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-22 16:29:38] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2023-03-22 16:29:38] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-22 16:29:38] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 1 ms to minimize.
[2023-03-22 16:29:39] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-22 16:29:39] [INFO ] Deduced a trap composed of 6 places in 522 ms of which 1 ms to minimize.
[2023-03-22 16:29:40] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-22 16:29:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2234 ms
[2023-03-22 16:29:40] [INFO ] After 11050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 494 ms.
[2023-03-22 16:29:40] [INFO ] After 12733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:29:40] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-22 16:29:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 714 places, 683 transitions and 2947 arcs took 4 ms.
[2023-03-22 16:29:41] [INFO ] Flatten gal took : 205 ms
Total runtime 80062 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: ShieldIIPt_PT_030B
(NrP: 714 NrTr: 683 NrArc: 2947)

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

net check time: 0m 0.000sec

init dd package: 0m 2.988sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6259816 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098772 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.003sec

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="ShieldIIPt-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 ShieldIIPt-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-167903717700302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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