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-167856420800790.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-S16C07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800790
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 13K Feb 26 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 02:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 02:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Feb 26 02:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 02:25 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 5.7M 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-S16C07-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679597759017

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-S16C07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 18:56:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 18:56:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:56:00] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2023-03-23 18:56:00] [INFO ] Transformed 6222 places.
[2023-03-23 18:56:00] [INFO ] Transformed 8685 transitions.
[2023-03-23 18:56:00] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 138 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-23 18:56:03] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2023-03-23 18:56:03] [INFO ] Computed 611 place invariants in 560 ms
[2023-03-23 18:56:05] [INFO ] After 1918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 18:56:07] [INFO ] [Nat]Absence check using 52 positive place invariants in 41 ms returned sat
[2023-03-23 18:56:07] [INFO ] [Nat]Absence check using 52 positive and 559 generalized place invariants in 261 ms returned sat
[2023-03-23 18:56:16] [INFO ] After 8755ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :3
[2023-03-23 18:56:16] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 18:56:20] [INFO ] After 3659ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :12 sat :2
[2023-03-23 18:56:29] [INFO ] Deduced a trap composed of 894 places in 7606 ms of which 23 ms to minimize.
[2023-03-23 18:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8216 ms
[2023-03-23 18:56:30] [INFO ] After 13965ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-23 18:56:30] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.21 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 1902 transitions
Trivial Post-agglo rules discarded 1902 transitions
Performed 1902 trivial Post agglomeration. Transition count delta: 1902
Iterating post reduction 0 with 1902 rules applied. Total rules applied 1903 place count 6188 transition count 6783
Reduce places removed 1902 places and 0 transitions.
Iterating post reduction 1 with 1902 rules applied. Total rules applied 3805 place count 4286 transition count 6783
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 3805 place count 4286 transition count 6545
Deduced a syphon composed of 238 places in 7 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 4281 place count 4048 transition count 6545
Discarding 1664 places :
Symmetric choice reduction at 2 with 1664 rule applications. Total rules 5945 place count 2384 transition count 4881
Iterating global reduction 2 with 1664 rules applied. Total rules applied 7609 place count 2384 transition count 4881
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 7609 place count 2384 transition count 4869
Deduced a syphon composed of 12 places in 8 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 7633 place count 2372 transition count 4869
Discarding 236 places :
Symmetric choice reduction at 2 with 236 rule applications. Total rules 7869 place count 2136 transition count 3217
Iterating global reduction 2 with 236 rules applied. Total rules applied 8105 place count 2136 transition count 3217
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 8139 place count 2119 transition count 3200
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 2 with 162 rules applied. Total rules applied 8301 place count 2119 transition count 4454
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 2 with 162 rules applied. Total rules applied 8463 place count 1957 transition count 4454
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 8497 place count 1957 transition count 4454
Applied a total of 8497 rules in 1917 ms. Remains 1957 /6222 variables (removed 4265) and now considering 4454/8685 (removed 4231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1918 ms. Remains : 1957/6222 places, 4454/8685 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 54700 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54700 steps, saw 24406 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 18:56:36] [INFO ] Flow matrix only has 4056 transitions (discarded 398 similar events)
// Phase 1: matrix 4056 rows 1957 cols
[2023-03-23 18:56:36] [INFO ] Computed 577 place invariants in 66 ms
[2023-03-23 18:56:36] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:56:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-23 18:56:37] [INFO ] [Nat]Absence check using 31 positive and 546 generalized place invariants in 111 ms returned sat
[2023-03-23 18:56:38] [INFO ] After 1533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:56:38] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 18:56:39] [INFO ] After 882ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:56:41] [INFO ] Deduced a trap composed of 265 places in 1557 ms of which 3 ms to minimize.
[2023-03-23 18:56:43] [INFO ] Deduced a trap composed of 341 places in 1539 ms of which 2 ms to minimize.
[2023-03-23 18:56:45] [INFO ] Deduced a trap composed of 309 places in 1530 ms of which 4 ms to minimize.
[2023-03-23 18:56:47] [INFO ] Deduced a trap composed of 334 places in 1588 ms of which 2 ms to minimize.
[2023-03-23 18:56:49] [INFO ] Deduced a trap composed of 269 places in 1584 ms of which 2 ms to minimize.
[2023-03-23 18:56:51] [INFO ] Deduced a trap composed of 287 places in 1595 ms of which 4 ms to minimize.
[2023-03-23 18:56:53] [INFO ] Deduced a trap composed of 346 places in 1579 ms of which 6 ms to minimize.
[2023-03-23 18:56:55] [INFO ] Deduced a trap composed of 188 places in 1579 ms of which 2 ms to minimize.
[2023-03-23 18:56:57] [INFO ] Deduced a trap composed of 124 places in 1530 ms of which 2 ms to minimize.
[2023-03-23 18:56:59] [INFO ] Deduced a trap composed of 163 places in 1601 ms of which 7 ms to minimize.
[2023-03-23 18:57:01] [INFO ] Deduced a trap composed of 130 places in 1567 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-23 18:57:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:57:01] [INFO ] After 25128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 1957 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1957/1957 places, 4454/4454 transitions.
Applied a total of 0 rules in 158 ms. Remains 1957 /1957 variables (removed 0) and now considering 4454/4454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 1957/1957 places, 4454/4454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1957/1957 places, 4454/4454 transitions.
Applied a total of 0 rules in 140 ms. Remains 1957 /1957 variables (removed 0) and now considering 4454/4454 (removed 0) transitions.
[2023-03-23 18:57:02] [INFO ] Flow matrix only has 4056 transitions (discarded 398 similar events)
[2023-03-23 18:57:02] [INFO ] Invariant cache hit.
[2023-03-23 18:57:06] [INFO ] Implicit Places using invariants in 4399 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 148, 165, 171, 173, 174, 175, 176, 177, 178, 179, 180, 182, 186, 192, 200, 210, 222, 235, 247, 248, 249, 250, 251, 252, 253, 254, 264, 272, 278, 282, 284, 286, 303, 309, 311, 312, 313, 314, 315, 316, 317, 318, 320, 322, 326, 332, 340, 350, 361, 371, 372, 373, 374, 375, 376, 377, 378, 386, 392, 396, 398, 400, 402, 419, 425, 427, 428, 429, 430, 431, 432, 433, 434, 436, 438, 440, 444, 450, 458, 467, 475, 476, 477, 478, 479, 480, 481, 482, 488, 492, 494, 496, 498, 500, 517, 523, 525, 526, 527, 528, 529, 530, 531, 532, 534, 536, 538, 540, 544, 550, 557, 563, 564, 565, 566, 567, 568, 569, 570, 574, 576, 578, 580, 582, 584, 601, 607, 609, 610, 611, 613, 614, 615, 616, 618, 620, 624, 626, 628, 632, 637, 641, 642, 643, 644, 645, 646, 647, 648, 650, 652, 654, 656, 658, 660, 677, 683, 685, 686, 687, 688, 689, 690, 691, 692, 694, 696, 698, 700, 702, 704, 707, 709, 710, 711, 712, 713, 714, 715, 716, 718, 720, 722, 724, 726, 728, 745, 751, 753, 754, 755, 756, 757, 758, 759, 760, 762, 764, 766, 768, 770, 772, 774, 776, 777, 778, 779, 780, 781, 782, 783, 785, 787, 789, 791, 793, 795, 812, 814, 817, 819, 820, 821, 822, 823, 825, 826, 828, 830, 832, 836, 838, 840, 842, 844, 845, 846, 847, 848, 849, 850, 851, 853, 855, 857, 859, 861, 863, 880, 886, 888, 889, 890, 891, 892, 893, 894, 895, 897, 899, 901, 903, 905, 907, 909, 911, 912, 913, 914, 915, 916, 917, 918, 920, 922, 924, 926, 928, 930, 947, 953, 955, 956, 957, 958, 959, 960, 961, 962, 964, 966, 968, 970, 972, 974, 976, 979, 980, 981, 982, 983, 984, 985, 986, 988, 990, 992, 994, 996, 998, 1015, 1021, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1032, 1034, 1036, 1038, 1040, 1042, 1046, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1062, 1064, 1066, 1068, 1070, 1072, 1089, 1095, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1106, 1108, 1110, 1112, 1114, 1118, 1124, 1131, 1132, 1133, 1134, 1135, 1136, 1137, 1138, 1144, 1148, 1150, 1152, 1154, 1156, 1173, 1179, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1190, 1192, 1194, 1196, 1200, 1206, 1214, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1238, 1244, 1248, 1250, 1252, 1254, 1271, 1277, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1288, 1290, 1292, 1296, 1302, 1310, 1320, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1348, 1356, 1362, 1366, 1368, 1370, 1387, 1393, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1404, 1406, 1410, 1416, 1424, 1434, 1446, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1478, 1488, 1496, 1502, 1506, 1508, 1525, 1527, 1530, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1541, 1545, 1551, 1559, 1569, 1581, 1595, 1610, 1611, 1612, 1613, 1614, 1615, 1616, 1617, 1631, 1643, 1653, 1661, 1667, 1671, 1688]
Discarding 528 places :
Implicit Place search using SMT only with invariants took 4415 ms to find 528 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1429/1957 places, 4454/4454 transitions.
Discarding 222 places :
Symmetric choice reduction at 0 with 222 rule applications. Total rules 222 place count 1207 transition count 4232
Iterating global reduction 0 with 222 rules applied. Total rules applied 444 place count 1207 transition count 4232
Discarding 222 places :
Symmetric choice reduction at 0 with 222 rule applications. Total rules 666 place count 985 transition count 4010
Iterating global reduction 0 with 222 rules applied. Total rules applied 888 place count 985 transition count 4010
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 891 place count 985 transition count 4007
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 894 place count 982 transition count 4007
Applied a total of 894 rules in 285 ms. Remains 982 /1429 variables (removed 447) and now considering 4007/4454 (removed 447) transitions.
[2023-03-23 18:57:06] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
// Phase 1: matrix 3609 rows 982 cols
[2023-03-23 18:57:06] [INFO ] Computed 49 place invariants in 31 ms
[2023-03-23 18:57:07] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2023-03-23 18:57:07] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2023-03-23 18:57:07] [INFO ] Invariant cache hit.
[2023-03-23 18:57:08] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 18:57:28] [INFO ] Implicit Places using invariants and state equation in 20914 ms returned []
Implicit Place search using SMT with State Equation took 22024 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 982/1957 places, 4007/4454 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26864 ms. Remains : 982/1957 places, 4007/4454 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70211 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{0=1}
Probabilistic random walk after 70211 steps, saw 29465 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-23 18:57:32] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2023-03-23 18:57:32] [INFO ] Invariant cache hit.
[2023-03-23 18:57:32] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:57:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 18:57:32] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-23 18:57:33] [INFO ] After 725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:57:33] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 18:57:33] [INFO ] After 476ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 18:57:33] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-23 18:57:33] [INFO ] After 1580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4007/4007 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 982 transition count 4006
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 981 transition count 4006
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 981 transition count 4005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 980 transition count 4005
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 979 transition count 4004
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 979 transition count 4004
Applied a total of 6 rules in 253 ms. Remains 979 /982 variables (removed 3) and now considering 4004/4007 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 979/982 places, 4004/4007 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71241 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71241 steps, saw 29894 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 18:57:37] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 979 cols
[2023-03-23 18:57:37] [INFO ] Computed 49 place invariants in 33 ms
[2023-03-23 18:57:37] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:57:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 18:57:37] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 11 ms returned sat
[2023-03-23 18:57:38] [INFO ] After 831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:57:38] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 18:57:38] [INFO ] After 298ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 18:57:38] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-23 18:57:38] [INFO ] After 1533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4004/4004 transitions.
Applied a total of 0 rules in 105 ms. Remains 979 /979 variables (removed 0) and now considering 4004/4004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 979/979 places, 4004/4004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4004/4004 transitions.
Applied a total of 0 rules in 101 ms. Remains 979 /979 variables (removed 0) and now considering 4004/4004 (removed 0) transitions.
[2023-03-23 18:57:39] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
[2023-03-23 18:57:39] [INFO ] Invariant cache hit.
[2023-03-23 18:57:40] [INFO ] Implicit Places using invariants in 1090 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1095 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 978/979 places, 4004/4004 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 977 transition count 4003
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 977 transition count 4003
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 976 transition count 4002
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 976 transition count 4002
Applied a total of 4 rules in 162 ms. Remains 976 /978 variables (removed 2) and now considering 4002/4004 (removed 2) transitions.
[2023-03-23 18:57:40] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2023-03-23 18:57:40] [INFO ] Computed 48 place invariants in 39 ms
[2023-03-23 18:57:41] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2023-03-23 18:57:41] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 18:57:41] [INFO ] Invariant cache hit.
[2023-03-23 18:57:42] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 18:58:03] [INFO ] Implicit Places using invariants and state equation in 21944 ms returned []
Implicit Place search using SMT with State Equation took 23050 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 976/979 places, 4002/4004 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24408 ms. Remains : 976/979 places, 4002/4004 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71475 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71475 steps, saw 29970 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 18:58:06] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 18:58:06] [INFO ] Invariant cache hit.
[2023-03-23 18:58:06] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:58:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 18:58:06] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-23 18:58:07] [INFO ] After 892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:58:07] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 18:58:08] [INFO ] After 361ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 18:58:08] [INFO ] After 508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-23 18:58:08] [INFO ] After 1647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 105 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 101 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2023-03-23 18:58:08] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 18:58:08] [INFO ] Invariant cache hit.
[2023-03-23 18:58:09] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2023-03-23 18:58:09] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 18:58:09] [INFO ] Invariant cache hit.
[2023-03-23 18:58:10] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 18:58:31] [INFO ] Implicit Places using invariants and state equation in 21962 ms returned []
Implicit Place search using SMT with State Equation took 23053 ms to find 0 implicit places.
[2023-03-23 18:58:31] [INFO ] Redundant transitions in 286 ms returned []
[2023-03-23 18:58:31] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2023-03-23 18:58:31] [INFO ] Invariant cache hit.
[2023-03-23 18:58:33] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24762 ms. Remains : 976/976 places, 4002/4002 transitions.
Graph (trivial) has 1052 edges and 976 vertex of which 17 / 976 are part of one of the 1 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4570 edges and 960 vertex of which 946 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 929 transition count 3233
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 832 transition count 3040
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 736 transition count 2872
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 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 3 with 214 rules applied. Total rules applied 869 place count 664 transition count 2730
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 594 transition count 2610
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 544 transition count 2512
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 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 128 rules applied. Total rules applied 1335 place count 496 transition count 2432
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 1429 place count 464 transition count 2370
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 1507 place count 434 transition count 2322
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 1559 place count 416 transition count 2288
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 1599 place count 400 transition count 2264
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 1621 place count 392 transition count 2250
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 1635 place count 386 transition count 2242
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 383 transition count 2240
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 1640 place count 383 transition count 2225
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 1670 place count 368 transition count 2225
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1954 place count 84 transition count 333
Iterating global reduction 14 with 284 rules applied. Total rules applied 2238 place count 84 transition count 333
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 253 rules applied. Total rules applied 2491 place count 84 transition count 80
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2498 place count 77 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2498 place count 77 transition count 79
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 2500 place count 76 transition count 79
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2512 place count 64 transition count 62
Iterating global reduction 16 with 12 rules applied. Total rules applied 2524 place count 64 transition count 62
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2529 place count 59 transition count 57
Iterating global reduction 16 with 5 rules applied. Total rules applied 2534 place count 59 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2538 place count 57 transition count 55
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2539 place count 56 transition count 53
Iterating global reduction 16 with 1 rules applied. Total rules applied 2540 place count 56 transition count 53
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 16 with 14 rules applied. Total rules applied 2554 place count 56 transition count 39
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 16 with 14 rules applied. Total rules applied 2568 place count 42 transition count 39
Applied a total of 2568 rules in 456 ms. Remains 42 /976 variables (removed 934) and now considering 39/4002 (removed 3963) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 42 cols
[2023-03-23 18:58:33] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-23 18:58:33] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:58:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 18:58:33] [INFO ] [Nat]Absence check using 2 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 18:58:33] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:58:33] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 18:58:33] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 18:58:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-23 18:58:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 976 places, 4002 transitions and 19956 arcs took 23 ms.
[2023-03-23 18:58:34] [INFO ] Flatten gal took : 293 ms
Total runtime 153818 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: 976 NrTr: 4002 NrArc: 19956)

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

net check time: 0m 0.002sec

init dd package: 0m 2.712sec

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

25336 49283 73868 100206 163839 223216 290638 400244 412429 656948 731092

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

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