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.r234-tall-167856420800774.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800774
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M 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 MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679592074986

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=MultiCrashLeafsetExtension-PT-S16C05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 17:21:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 17:21:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 17:21:16] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-23 17:21:16] [INFO ] Transformed 4914 places.
[2023-03-23 17:21:16] [INFO ] Transformed 6913 transitions.
[2023-03-23 17:21:16] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 192 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-23 17:21:17] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2023-03-23 17:21:18] [INFO ] Computed 535 place invariants in 261 ms
[2023-03-23 17:21:19] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned sat
[2023-03-23 17:21:19] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 212 ms returned sat
[2023-03-23 17:21:19] [INFO ] After 1812ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:10
[2023-03-23 17:21:20] [INFO ] [Nat]Absence check using 48 positive place invariants in 18 ms returned sat
[2023-03-23 17:21:21] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 208 ms returned sat
[2023-03-23 17:21:27] [INFO ] After 5757ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :4
[2023-03-23 17:21:27] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 17:21:36] [INFO ] After 8873ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :10 sat :3
[2023-03-23 17:21:42] [INFO ] Deduced a trap composed of 423 places in 4671 ms of which 12 ms to minimize.
[2023-03-23 17:21:47] [INFO ] Deduced a trap composed of 553 places in 4710 ms of which 6 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-23 17:21:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 17:21:47] [INFO ] After 27730ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:10
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 59 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.16 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1309 transitions
Trivial Post-agglo rules discarded 1309 transitions
Performed 1309 trivial Post agglomeration. Transition count delta: 1309
Iterating post reduction 0 with 1309 rules applied. Total rules applied 1310 place count 4884 transition count 5604
Reduce places removed 1309 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 1 with 1343 rules applied. Total rules applied 2653 place count 3575 transition count 5570
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 2687 place count 3541 transition count 5570
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 2687 place count 3541 transition count 5402
Deduced a syphon composed of 168 places in 6 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 3023 place count 3373 transition count 5402
Discarding 1155 places :
Symmetric choice reduction at 3 with 1155 rule applications. Total rules 4178 place count 2218 transition count 4247
Iterating global reduction 3 with 1155 rules applied. Total rules applied 5333 place count 2218 transition count 4247
Discarding 201 places :
Symmetric choice reduction at 3 with 201 rule applications. Total rules 5534 place count 2017 transition count 3242
Iterating global reduction 3 with 201 rules applied. Total rules applied 5735 place count 2017 transition count 3242
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5769 place count 2000 transition count 3225
Free-agglomeration rule (complex) applied 183 times.
Iterating global reduction 3 with 183 rules applied. Total rules applied 5952 place count 2000 transition count 3686
Reduce places removed 183 places and 0 transitions.
Iterating post reduction 3 with 183 rules applied. Total rules applied 6135 place count 1817 transition count 3686
Partial Free-agglomeration rule applied 168 times.
Drop transitions removed 168 transitions
Iterating global reduction 4 with 168 rules applied. Total rules applied 6303 place count 1817 transition count 3686
Applied a total of 6303 rules in 1770 ms. Remains 1817 /4914 variables (removed 3097) and now considering 3686/6913 (removed 3227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1772 ms. Remains : 1817/4914 places, 3686/6913 transitions.
Incomplete random walk after 10000 steps, including 308 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 17:21:49] [INFO ] Flow matrix only has 3291 transitions (discarded 395 similar events)
// Phase 1: matrix 3291 rows 1817 cols
[2023-03-23 17:21:49] [INFO ] Computed 505 place invariants in 49 ms
[2023-03-23 17:21:49] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 17:21:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-23 17:21:50] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 99 ms returned sat
[2023-03-23 17:21:51] [INFO ] After 1500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 17:21:51] [INFO ] State equation strengthened by 1746 read => feed constraints.
[2023-03-23 17:21:52] [INFO ] After 500ms SMT Verify possible using 1746 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 17:21:52] [INFO ] After 864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 356 ms.
[2023-03-23 17:21:53] [INFO ] After 3135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 1817 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1817/1817 places, 3686/3686 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1817 transition count 3675
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 1806 transition count 3675
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 1806 transition count 3674
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 24 place count 1805 transition count 3674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 1804 transition count 3673
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 1804 transition count 3673
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1804 transition count 3734
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1797 transition count 3734
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 1795 transition count 3732
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 1795 transition count 3732
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 64 place count 1795 transition count 3732
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 83 place count 1776 transition count 3713
Iterating global reduction 3 with 19 rules applied. Total rules applied 102 place count 1776 transition count 3713
Applied a total of 102 rules in 462 ms. Remains 1776 /1817 variables (removed 41) and now considering 3713/3686 (removed -27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 1776/1817 places, 3713/3686 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71612 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71612 steps, saw 31982 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 17:21:56] [INFO ] Flow matrix only has 3316 transitions (discarded 397 similar events)
// Phase 1: matrix 3316 rows 1776 cols
[2023-03-23 17:21:56] [INFO ] Computed 505 place invariants in 41 ms
[2023-03-23 17:21:56] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 17:21:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-23 17:21:57] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 98 ms returned sat
[2023-03-23 17:21:58] [INFO ] After 1243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 17:21:58] [INFO ] State equation strengthened by 1814 read => feed constraints.
[2023-03-23 17:21:59] [INFO ] After 498ms SMT Verify possible using 1814 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 17:22:00] [INFO ] Deduced a trap composed of 174 places in 1132 ms of which 7 ms to minimize.
[2023-03-23 17:22:01] [INFO ] Deduced a trap composed of 261 places in 1062 ms of which 2 ms to minimize.
[2023-03-23 17:22:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2713 ms
[2023-03-23 17:22:02] [INFO ] After 3448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-23 17:22:02] [INFO ] After 5330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 25 out of 1776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1776/1776 places, 3713/3713 transitions.
Applied a total of 0 rules in 91 ms. Remains 1776 /1776 variables (removed 0) and now considering 3713/3713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1776/1776 places, 3713/3713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1776/1776 places, 3713/3713 transitions.
Applied a total of 0 rules in 93 ms. Remains 1776 /1776 variables (removed 0) and now considering 3713/3713 (removed 0) transitions.
[2023-03-23 17:22:02] [INFO ] Flow matrix only has 3316 transitions (discarded 397 similar events)
[2023-03-23 17:22:02] [INFO ] Invariant cache hit.
[2023-03-23 17:22:05] [INFO ] Implicit Places using invariants in 3189 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 239, 240, 241, 242, 253, 261, 267, 271, 273, 275, 288, 294, 296, 297, 298, 299, 300, 301, 303, 305, 309, 315, 323, 333, 344, 355, 356, 357, 358, 359, 360, 368, 374, 378, 381, 383, 386, 399, 405, 407, 408, 410, 413, 416, 418, 422, 426, 432, 440, 449, 457, 458, 459, 461, 462, 468, 472, 475, 477, 479, 481, 494, 500, 502, 503, 504, 505, 506, 507, 509, 511, 513, 515, 519, 525, 532, 538, 539, 540, 541, 542, 543, 547, 549, 551, 553, 555, 557, 570, 576, 579, 580, 581, 582, 583, 584, 586, 588, 590, 592, 594, 598, 603, 607, 608, 609, 610, 611, 612, 614, 616, 618, 620, 622, 624, 637, 643, 645, 646, 647, 648, 649, 650, 652, 654, 656, 658, 660, 662, 665, 667, 668, 669, 670, 671, 672, 674, 676, 678, 680, 682, 684, 697, 703, 705, 706, 707, 708, 709, 710, 712, 714, 716, 718, 720, 722, 724, 726, 727, 728, 729, 730, 731, 734, 736, 738, 740, 744, 757, 759, 762, 764, 765, 766, 767, 768, 769, 771, 773, 775, 777, 779, 781, 783, 785, 786, 788, 789, 790, 792, 794, 796, 799, 801, 803, 816, 822, 824, 825, 826, 827, 828, 829, 831, 833, 835, 837, 839, 841, 843, 846, 847, 848, 849, 850, 851, 853, 855, 857, 859, 863, 876, 882, 884, 885, 886, 887, 888, 889, 891, 893, 895, 897, 899, 901, 903, 906, 908, 910, 911, 913, 917, 920, 922, 924, 926, 939, 945, 947, 948, 949, 951, 952, 954, 956, 958, 962, 964, 966, 970, 975, 976, 977, 978, 979, 980, 984, 986, 988, 990, 992, 994, 1007, 1013, 1015, 1016, 1017, 1018, 1019, 1020, 1022, 1024, 1026, 1028, 1030, 1035, 1041, 1048, 1049, 1050, 1051, 1052, 1053, 1059, 1063, 1065, 1067, 1069, 1071, 1084, 1090, 1092, 1095, 1096, 1097, 1100, 1102, 1105, 1107, 1111, 1117, 1125, 1134, 1135, 1136, 1137, 1138, 1139, 1147, 1153, 1157, 1159, 1161, 1163, 1176, 1182, 1184, 1185, 1186, 1187, 1188, 1189, 1191, 1193, 1195, 1199, 1205, 1213, 1223, 1234, 1235, 1236, 1237, 1239, 1250, 1258, 1264, 1268, 1270, 1272, 1285, 1291, 1293, 1295, 1296, 1297, 1298, 1300, 1302, 1306, 1314, 1322, 1332, 1344, 1358, 1359, 1360, 1361, 1362, 1374, 1384, 1394, 1400, 1404, 1406, 1420, 1422, 1425, 1427, 1428, 1429, 1430, 1431, 1432, 1434, 1439, 1445, 1453, 1463, 1475, 1489, 1504, 1505, 1506, 1507, 1508, 1509, 1523, 1535, 1545, 1553, 1559, 1563, 1576]
Discarding 447 places :
Implicit Place search using SMT only with invariants took 3200 ms to find 447 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1329/1776 places, 3713/3713 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 1183 transition count 3567
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 1183 transition count 3567
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 437 place count 1038 transition count 3422
Iterating global reduction 0 with 145 rules applied. Total rules applied 582 place count 1038 transition count 3422
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 584 place count 1036 transition count 3412
Iterating global reduction 0 with 2 rules applied. Total rules applied 586 place count 1036 transition count 3412
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 589 place count 1036 transition count 3409
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 592 place count 1033 transition count 3409
Applied a total of 592 rules in 221 ms. Remains 1033 /1329 variables (removed 296) and now considering 3409/3713 (removed 304) transitions.
[2023-03-23 17:22:05] [INFO ] Flow matrix only has 3012 transitions (discarded 397 similar events)
// Phase 1: matrix 3012 rows 1033 cols
[2023-03-23 17:22:05] [INFO ] Computed 58 place invariants in 44 ms
[2023-03-23 17:22:06] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2023-03-23 17:22:06] [INFO ] Flow matrix only has 3012 transitions (discarded 397 similar events)
[2023-03-23 17:22:06] [INFO ] Invariant cache hit.
[2023-03-23 17:22:07] [INFO ] State equation strengthened by 1806 read => feed constraints.
[2023-03-23 17:22:21] [INFO ] Implicit Places using invariants and state equation in 14596 ms returned []
Implicit Place search using SMT with State Equation took 15670 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1033/1776 places, 3409/3713 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19188 ms. Remains : 1033/1776 places, 3409/3713 transitions.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 82248 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82248 steps, saw 34857 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 17:22:24] [INFO ] Flow matrix only has 3012 transitions (discarded 397 similar events)
[2023-03-23 17:22:24] [INFO ] Invariant cache hit.
[2023-03-23 17:22:24] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 17:22:24] [INFO ] [Nat]Absence check using 32 positive place invariants in 23 ms returned sat
[2023-03-23 17:22:25] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-23 17:22:25] [INFO ] After 963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 17:22:26] [INFO ] State equation strengthened by 1806 read => feed constraints.
[2023-03-23 17:22:26] [INFO ] After 509ms SMT Verify possible using 1806 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 17:22:27] [INFO ] Deduced a trap composed of 184 places in 408 ms of which 0 ms to minimize.
[2023-03-23 17:22:27] [INFO ] Deduced a trap composed of 174 places in 404 ms of which 1 ms to minimize.
[2023-03-23 17:22:28] [INFO ] Deduced a trap composed of 185 places in 405 ms of which 1 ms to minimize.
[2023-03-23 17:22:28] [INFO ] Deduced a trap composed of 170 places in 416 ms of which 1 ms to minimize.
[2023-03-23 17:22:29] [INFO ] Deduced a trap composed of 195 places in 400 ms of which 1 ms to minimize.
[2023-03-23 17:22:30] [INFO ] Deduced a trap composed of 211 places in 409 ms of which 1 ms to minimize.
[2023-03-23 17:22:30] [INFO ] Deduced a trap composed of 209 places in 410 ms of which 1 ms to minimize.
[2023-03-23 17:22:31] [INFO ] Deduced a trap composed of 218 places in 399 ms of which 1 ms to minimize.
[2023-03-23 17:22:31] [INFO ] Deduced a trap composed of 186 places in 421 ms of which 1 ms to minimize.
[2023-03-23 17:22:32] [INFO ] Deduced a trap composed of 210 places in 401 ms of which 0 ms to minimize.
[2023-03-23 17:22:32] [INFO ] Deduced a trap composed of 200 places in 410 ms of which 1 ms to minimize.
[2023-03-23 17:22:33] [INFO ] Deduced a trap composed of 211 places in 398 ms of which 2 ms to minimize.
[2023-03-23 17:22:33] [INFO ] Deduced a trap composed of 200 places in 406 ms of which 1 ms to minimize.
[2023-03-23 17:22:34] [INFO ] Deduced a trap composed of 194 places in 405 ms of which 1 ms to minimize.
[2023-03-23 17:22:35] [INFO ] Deduced a trap composed of 204 places in 427 ms of which 1 ms to minimize.
[2023-03-23 17:22:35] [INFO ] Deduced a trap composed of 136 places in 433 ms of which 1 ms to minimize.
[2023-03-23 17:22:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9133 ms
[2023-03-23 17:22:36] [INFO ] After 9988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-23 17:22:36] [INFO ] After 11477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 3409/3409 transitions.
Applied a total of 0 rules in 77 ms. Remains 1033 /1033 variables (removed 0) and now considering 3409/3409 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1033/1033 places, 3409/3409 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 3409/3409 transitions.
Applied a total of 0 rules in 73 ms. Remains 1033 /1033 variables (removed 0) and now considering 3409/3409 (removed 0) transitions.
[2023-03-23 17:22:36] [INFO ] Flow matrix only has 3012 transitions (discarded 397 similar events)
[2023-03-23 17:22:36] [INFO ] Invariant cache hit.
[2023-03-23 17:22:37] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-23 17:22:37] [INFO ] Flow matrix only has 3012 transitions (discarded 397 similar events)
[2023-03-23 17:22:37] [INFO ] Invariant cache hit.
[2023-03-23 17:22:38] [INFO ] State equation strengthened by 1806 read => feed constraints.
[2023-03-23 17:22:52] [INFO ] Implicit Places using invariants and state equation in 14925 ms returned []
Implicit Place search using SMT with State Equation took 15938 ms to find 0 implicit places.
[2023-03-23 17:22:52] [INFO ] Redundant transitions in 215 ms returned []
[2023-03-23 17:22:52] [INFO ] Flow matrix only has 3012 transitions (discarded 397 similar events)
[2023-03-23 17:22:52] [INFO ] Invariant cache hit.
[2023-03-23 17:22:53] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17389 ms. Remains : 1033/1033 places, 3409/3409 transitions.
Graph (trivial) has 1065 edges and 1033 vertex of which 17 / 1033 are part of one of the 1 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 298 transitions
Ensure Unique test removed 371 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 4149 edges and 1017 vertex of which 1003 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 984 transition count 2643
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 284 rules applied. Total rules applied 383 place count 889 transition count 2454
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 2 with 258 rules applied. Total rules applied 641 place count 795 transition count 2290
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 3 with 208 rules applied. Total rules applied 849 place count 725 transition count 2152
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 185 rules applied. Total rules applied 1034 place count 657 transition count 2035
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1179 place count 608 transition count 1939
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 126 rules applied. Total rules applied 1305 place count 561 transition count 1860
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1399 place count 529 transition count 1798
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1477 place count 499 transition count 1750
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1529 place count 481 transition count 1716
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1569 place count 465 transition count 1692
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1591 place count 457 transition count 1678
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1605 place count 451 transition count 1670
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 6 rules applied. Total rules applied 1611 place count 449 transition count 1666
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1615 place count 447 transition count 1664
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 23 Pre rules applied. Total rules applied 1615 place count 447 transition count 1641
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 15 with 46 rules applied. Total rules applied 1661 place count 424 transition count 1641
Discarding 251 places :
Symmetric choice reduction at 15 with 251 rule applications. Total rules 1912 place count 173 transition count 534
Iterating global reduction 15 with 251 rules applied. Total rules applied 2163 place count 173 transition count 534
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 15 with 143 rules applied. Total rules applied 2306 place count 173 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2306 place count 173 transition count 390
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2308 place count 172 transition count 390
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 16 with 32 rules applied. Total rules applied 2340 place count 156 transition count 374
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2344 place count 156 transition count 370
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 2348 place count 154 transition count 384
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 2350 place count 152 transition count 374
Iterating global reduction 17 with 2 rules applied. Total rules applied 2352 place count 152 transition count 374
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 17 with 15 rules applied. Total rules applied 2367 place count 152 transition count 359
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 2369 place count 152 transition count 357
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 18 with 6 rules applied. Total rules applied 2375 place count 152 transition count 351
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2381 place count 146 transition count 351
Partial Free-agglomeration rule applied 104 times.
Drop transitions removed 104 transitions
Iterating global reduction 19 with 104 rules applied. Total rules applied 2485 place count 146 transition count 351
Applied a total of 2485 rules in 431 ms. Remains 146 /1033 variables (removed 887) and now considering 351/3409 (removed 3058) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 351 rows 146 cols
[2023-03-23 17:22:54] [INFO ] Computed 26 place invariants in 9 ms
[2023-03-23 17:22:54] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 17:22:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 17:22:54] [INFO ] [Nat]Absence check using 3 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-23 17:22:54] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 17:22:54] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-23 17:22:54] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 17:22:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-23 17:22:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1033 places, 3409 transitions and 16955 arcs took 17 ms.
[2023-03-23 17:22:54] [INFO ] Flatten gal took : 310 ms
Total runtime 98607 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: gen
(NrP: 1033 NrTr: 3409 NrArc: 16955)

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

net check time: 0m 0.002sec

init dd package: 0m 2.644sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10510212 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16091292 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.039sec

40479 62475 80137 98626 122334 151026 169873 187459 195347 240514 269285 303018 327690 385213 432617 449827 466061 489241 532868 609825 655902 704628

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="MultiCrashLeafsetExtension-PT-S16C05"
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 MultiCrashLeafsetExtension-PT-S16C05, 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 r234-tall-167856420800774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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