About the Execution of Smart+red for MultiCrashLeafsetExtension-PT-S16C04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1201.132 | 146567.00 | 176880.00 | 497.60 | T?FF??FTFTFFTFFT | normal |
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.r235-tall-167856422300767.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 smartxred
Input is MultiCrashLeafsetExtension-PT-S16C04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422300767
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 11K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 02:26 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.3K 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 24K Feb 26 02:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 02:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:34 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.1M 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-S16C04-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678693011863
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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 07:36:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 07:36:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:36:53] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2023-03-13 07:36:53] [INFO ] Transformed 4260 places.
[2023-03-13 07:36:53] [INFO ] Transformed 6027 transitions.
[2023-03-13 07:36:53] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 239 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 16) seen :6
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 10) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-13 07:36:55] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2023-03-13 07:36:55] [INFO ] Computed 497 place invariants in 281 ms
[2023-03-13 07:36:56] [INFO ] [Real]Absence check using 46 positive place invariants in 27 ms returned sat
[2023-03-13 07:36:57] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 196 ms returned sat
[2023-03-13 07:36:57] [INFO ] After 1563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 07:36:58] [INFO ] [Nat]Absence check using 46 positive place invariants in 32 ms returned sat
[2023-03-13 07:36:58] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 166 ms returned sat
[2023-03-13 07:37:07] [INFO ] After 8542ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-13 07:37:07] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:37:15] [INFO ] After 8028ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :5 sat :4
[2023-03-13 07:37:20] [INFO ] Deduced a trap composed of 1505 places in 3776 ms of which 17 ms to minimize.
[2023-03-13 07:37:24] [INFO ] Deduced a trap composed of 884 places in 3504 ms of which 13 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 07:37:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 07:37:24] [INFO ] After 27359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 48 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.22 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 1062 transitions
Trivial Post-agglo rules discarded 1062 transitions
Performed 1062 trivial Post agglomeration. Transition count delta: 1062
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1063 place count 4232 transition count 4965
Reduce places removed 1062 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 1086 rules applied. Total rules applied 2149 place count 3170 transition count 4941
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 2173 place count 3146 transition count 4941
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 2173 place count 3146 transition count 4808
Deduced a syphon composed of 133 places in 4 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 2439 place count 3013 transition count 4808
Discarding 947 places :
Symmetric choice reduction at 3 with 947 rule applications. Total rules 3386 place count 2066 transition count 3861
Iterating global reduction 3 with 947 rules applied. Total rules applied 4333 place count 2066 transition count 3861
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4333 place count 2066 transition count 3856
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4343 place count 2061 transition count 3856
Discarding 226 places :
Symmetric choice reduction at 3 with 226 rule applications. Total rules 4569 place count 1835 transition count 2952
Iterating global reduction 3 with 226 rules applied. Total rules applied 4795 place count 1835 transition count 2952
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 4823 place count 1821 transition count 2938
Free-agglomeration rule (complex) applied 107 times.
Iterating global reduction 3 with 107 rules applied. Total rules applied 4930 place count 1821 transition count 2831
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 3 with 107 rules applied. Total rules applied 5037 place count 1714 transition count 2831
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 5085 place count 1714 transition count 2831
Applied a total of 5085 rules in 1193 ms. Remains 1714 /4260 variables (removed 2546) and now considering 2831/6027 (removed 3196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1194 ms. Remains : 1714/4260 places, 2831/6027 transitions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 61334 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61334 steps, saw 27946 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 07:37:29] [INFO ] Flow matrix only has 2452 transitions (discarded 379 similar events)
// Phase 1: matrix 2452 rows 1714 cols
[2023-03-13 07:37:29] [INFO ] Computed 469 place invariants in 29 ms
[2023-03-13 07:37:29] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-13 07:37:29] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 88 ms returned sat
[2023-03-13 07:37:29] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 07:37:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2023-03-13 07:37:30] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 92 ms returned sat
[2023-03-13 07:37:32] [INFO ] After 2288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 07:37:32] [INFO ] State equation strengthened by 956 read => feed constraints.
[2023-03-13 07:37:34] [INFO ] After 2099ms SMT Verify possible using 956 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 07:37:36] [INFO ] Deduced a trap composed of 186 places in 913 ms of which 2 ms to minimize.
[2023-03-13 07:37:37] [INFO ] Deduced a trap composed of 189 places in 876 ms of which 3 ms to minimize.
[2023-03-13 07:37:38] [INFO ] Deduced a trap composed of 229 places in 878 ms of which 2 ms to minimize.
[2023-03-13 07:37:39] [INFO ] Deduced a trap composed of 173 places in 868 ms of which 2 ms to minimize.
[2023-03-13 07:37:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4514 ms
[2023-03-13 07:37:41] [INFO ] Deduced a trap composed of 250 places in 859 ms of which 2 ms to minimize.
[2023-03-13 07:37:42] [INFO ] Deduced a trap composed of 270 places in 853 ms of which 2 ms to minimize.
[2023-03-13 07:37:43] [INFO ] Deduced a trap composed of 357 places in 870 ms of which 2 ms to minimize.
[2023-03-13 07:37:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2920 ms
[2023-03-13 07:37:44] [INFO ] Deduced a trap composed of 223 places in 875 ms of which 2 ms to minimize.
[2023-03-13 07:37:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1130 ms
[2023-03-13 07:37:45] [INFO ] After 13431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2721 ms.
[2023-03-13 07:37:48] [INFO ] After 18930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 6 ms.
Support contains 48 out of 1714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1714/1714 places, 2831/2831 transitions.
Applied a total of 0 rules in 87 ms. Remains 1714 /1714 variables (removed 0) and now considering 2831/2831 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1714/1714 places, 2831/2831 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1714/1714 places, 2831/2831 transitions.
Applied a total of 0 rules in 80 ms. Remains 1714 /1714 variables (removed 0) and now considering 2831/2831 (removed 0) transitions.
[2023-03-13 07:37:48] [INFO ] Flow matrix only has 2452 transitions (discarded 379 similar events)
[2023-03-13 07:37:48] [INFO ] Invariant cache hit.
[2023-03-13 07:37:50] [INFO ] Implicit Places using invariants in 1853 ms returned [4, 8, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 99, 100, 101, 102, 103, 116, 126, 134, 141, 145, 147, 164, 167, 169, 170, 171, 173, 177, 186, 194, 204, 216, 229, 242, 243, 244, 245, 246, 257, 265, 271, 276, 278, 280, 291, 297, 300, 302, 303, 304, 306, 308, 314, 320, 328, 338, 349, 360, 361, 362, 363, 364, 373, 379, 384, 387, 389, 391, 403, 409, 412, 413, 414, 415, 416, 418, 420, 422, 426, 432, 440, 460, 461, 462, 463, 470, 474, 476, 478, 480, 484, 496, 502, 505, 506, 507, 508, 509, 511, 513, 515, 517, 521, 527, 534, 541, 542, 543, 544, 545, 550, 552, 554, 556, 558, 560, 571, 577, 580, 581, 582, 583, 584, 586, 588, 590, 592, 594, 598, 603, 608, 609, 610, 612, 615, 617, 619, 621, 623, 627, 640, 646, 649, 650, 651, 652, 653, 655, 657, 659, 661, 663, 665, 668, 671, 672, 673, 674, 675, 677, 679, 681, 683, 685, 687, 704, 707, 709, 710, 711, 716, 718, 720, 722, 726, 728, 731, 732, 733, 734, 735, 737, 739, 741, 743, 745, 747, 758, 760, 763, 766, 767, 768, 769, 770, 772, 774, 776, 778, 780, 782, 784, 787, 788, 789, 790, 791, 793, 795, 797, 799, 801, 803, 814, 820, 823, 824, 825, 826, 827, 829, 831, 833, 835, 837, 839, 841, 844, 845, 846, 847, 848, 850, 852, 854, 856, 858, 860, 878, 881, 882, 883, 884, 885, 887, 889, 891, 893, 895, 897, 899, 903, 904, 905, 906, 907, 909, 911, 914, 916, 918, 920, 931, 937, 940, 941, 942, 943, 944, 946, 948, 950, 952, 954, 956, 960, 966, 967, 968, 969, 970, 974, 977, 979, 981, 983, 985, 996, 1002, 1005, 1006, 1007, 1008, 1009, 1011, 1013, 1015, 1017, 1019, 1023, 1029, 1037, 1038, 1039, 1040, 1041, 1048, 1053, 1056, 1058, 1060, 1062, 1073, 1080, 1083, 1084, 1085, 1086, 1087, 1089, 1091, 1093, 1095, 1099, 1105, 1113, 1123, 1124, 1125, 1126, 1127, 1135, 1142, 1146, 1148, 1150, 1152, 1163, 1169, 1172, 1173, 1174, 1175, 1176, 1178, 1180, 1182, 1186, 1192, 1200, 1210, 1222, 1223, 1224, 1225, 1226, 1236, 1245, 1251, 1255, 1258, 1260, 1271, 1277, 1280, 1281, 1282, 1283, 1284, 1286, 1288, 1292, 1298, 1306, 1316, 1328, 1342, 1343, 1344, 1345, 1346, 1358, 1369, 1377, 1384, 1389, 1391, 1402, 1404, 1410, 1411, 1412, 1413, 1414, 1416, 1420, 1426, 1434, 1444, 1456, 1470, 1486, 1487, 1488, 1489, 1490, 1505, 1518, 1528, 1536, 1543, 1547, 1558]
Discarding 417 places :
Implicit Place search using SMT only with invariants took 1861 ms to find 417 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1297/1714 places, 2831/2831 transitions.
Discarding 123 places :
Symmetric choice reduction at 0 with 123 rule applications. Total rules 123 place count 1174 transition count 2708
Iterating global reduction 0 with 123 rules applied. Total rules applied 246 place count 1174 transition count 2708
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 368 place count 1052 transition count 2586
Iterating global reduction 0 with 122 rules applied. Total rules applied 490 place count 1052 transition count 2586
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 516 place count 1026 transition count 2482
Iterating global reduction 0 with 26 rules applied. Total rules applied 542 place count 1026 transition count 2482
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 544 place count 1026 transition count 2480
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 546 place count 1024 transition count 2480
Applied a total of 546 rules in 267 ms. Remains 1024 /1297 variables (removed 273) and now considering 2480/2831 (removed 351) transitions.
[2023-03-13 07:37:50] [INFO ] Flow matrix only has 2101 transitions (discarded 379 similar events)
// Phase 1: matrix 2101 rows 1024 cols
[2023-03-13 07:37:50] [INFO ] Computed 52 place invariants in 21 ms
[2023-03-13 07:37:51] [INFO ] Implicit Places using invariants in 769 ms returned []
[2023-03-13 07:37:51] [INFO ] Flow matrix only has 2101 transitions (discarded 379 similar events)
[2023-03-13 07:37:51] [INFO ] Invariant cache hit.
[2023-03-13 07:37:52] [INFO ] State equation strengthened by 878 read => feed constraints.
[2023-03-13 07:38:00] [INFO ] Implicit Places using invariants and state equation in 8877 ms returned []
Implicit Place search using SMT with State Equation took 9651 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1024/1714 places, 2480/2831 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11864 ms. Remains : 1024/1714 places, 2480/2831 transitions.
Incomplete random walk after 10000 steps, including 352 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 07:38:00] [INFO ] Flow matrix only has 2101 transitions (discarded 379 similar events)
[2023-03-13 07:38:00] [INFO ] Invariant cache hit.
[2023-03-13 07:38:00] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-13 07:38:00] [INFO ] [Real]Absence check using 31 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-13 07:38:00] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:38:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-13 07:38:01] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-13 07:38:02] [INFO ] After 850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:38:02] [INFO ] State equation strengthened by 878 read => feed constraints.
[2023-03-13 07:38:03] [INFO ] After 1740ms SMT Verify possible using 878 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:38:04] [INFO ] Deduced a trap composed of 183 places in 376 ms of which 1 ms to minimize.
[2023-03-13 07:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2023-03-13 07:38:04] [INFO ] After 2844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 681 ms.
[2023-03-13 07:38:05] [INFO ] After 4606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 32 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 2480/2480 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 1024 transition count 2479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1023 transition count 2479
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1023 transition count 2477
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1021 transition count 2477
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 12 place count 1015 transition count 2462
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 1015 transition count 2462
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 1015 transition count 2460
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 1013 transition count 2460
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 1010 transition count 2448
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 1010 transition count 2448
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 1010 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 1009 transition count 2447
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 1009 transition count 2447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 1008 transition count 2443
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 1008 transition count 2443
Applied a total of 33 rules in 282 ms. Remains 1008 /1024 variables (removed 16) and now considering 2443/2480 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 1008/1024 places, 2443/2480 transitions.
Incomplete random walk after 10000 steps, including 353 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 81505 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81505 steps, saw 34604 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 07:38:09] [INFO ] Flow matrix only has 2064 transitions (discarded 379 similar events)
// Phase 1: matrix 2064 rows 1008 cols
[2023-03-13 07:38:09] [INFO ] Computed 52 place invariants in 29 ms
[2023-03-13 07:38:09] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2023-03-13 07:38:09] [INFO ] [Real]Absence check using 33 positive and 19 generalized place invariants in 9 ms returned sat
[2023-03-13 07:38:09] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:38:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-13 07:38:09] [INFO ] [Nat]Absence check using 33 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-13 07:38:10] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:38:10] [INFO ] State equation strengthened by 857 read => feed constraints.
[2023-03-13 07:38:11] [INFO ] After 1080ms SMT Verify possible using 857 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:38:12] [INFO ] Deduced a trap composed of 185 places in 378 ms of which 1 ms to minimize.
[2023-03-13 07:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 495 ms
[2023-03-13 07:38:13] [INFO ] Deduced a trap composed of 82 places in 375 ms of which 1 ms to minimize.
[2023-03-13 07:38:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 571 ms
[2023-03-13 07:38:13] [INFO ] After 3038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 703 ms.
[2023-03-13 07:38:14] [INFO ] After 4877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 32 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 2443/2443 transitions.
Applied a total of 0 rules in 56 ms. Remains 1008 /1008 variables (removed 0) and now considering 2443/2443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1008/1008 places, 2443/2443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 2443/2443 transitions.
Applied a total of 0 rules in 55 ms. Remains 1008 /1008 variables (removed 0) and now considering 2443/2443 (removed 0) transitions.
[2023-03-13 07:38:14] [INFO ] Flow matrix only has 2064 transitions (discarded 379 similar events)
[2023-03-13 07:38:14] [INFO ] Invariant cache hit.
[2023-03-13 07:38:15] [INFO ] Implicit Places using invariants in 721 ms returned [356, 435, 469, 477, 483]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 724 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1003/1008 places, 2443/2443 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1000 transition count 2440
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1000 transition count 2440
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 997 transition count 2437
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 997 transition count 2437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 994 transition count 2425
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 994 transition count 2425
Applied a total of 18 rules in 150 ms. Remains 994 /1003 variables (removed 9) and now considering 2425/2443 (removed 18) transitions.
[2023-03-13 07:38:15] [INFO ] Flow matrix only has 2046 transitions (discarded 379 similar events)
// Phase 1: matrix 2046 rows 994 cols
[2023-03-13 07:38:15] [INFO ] Computed 47 place invariants in 27 ms
[2023-03-13 07:38:15] [INFO ] Implicit Places using invariants in 726 ms returned []
[2023-03-13 07:38:15] [INFO ] Flow matrix only has 2046 transitions (discarded 379 similar events)
[2023-03-13 07:38:15] [INFO ] Invariant cache hit.
[2023-03-13 07:38:16] [INFO ] State equation strengthened by 848 read => feed constraints.
[2023-03-13 07:38:24] [INFO ] Implicit Places using invariants and state equation in 8197 ms returned []
Implicit Place search using SMT with State Equation took 8925 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 994/1008 places, 2425/2443 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9854 ms. Remains : 994/1008 places, 2425/2443 transitions.
Incomplete random walk after 10000 steps, including 353 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 83215 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83215 steps, saw 35097 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 07:38:27] [INFO ] Flow matrix only has 2046 transitions (discarded 379 similar events)
[2023-03-13 07:38:27] [INFO ] Invariant cache hit.
[2023-03-13 07:38:27] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-13 07:38:27] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 22 ms returned sat
[2023-03-13 07:38:27] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:38:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-13 07:38:27] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 21 ms returned sat
[2023-03-13 07:38:28] [INFO ] After 839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:38:28] [INFO ] State equation strengthened by 848 read => feed constraints.
[2023-03-13 07:38:29] [INFO ] After 1021ms SMT Verify possible using 848 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:38:30] [INFO ] Deduced a trap composed of 90 places in 369 ms of which 1 ms to minimize.
[2023-03-13 07:38:30] [INFO ] Deduced a trap composed of 85 places in 372 ms of which 1 ms to minimize.
[2023-03-13 07:38:31] [INFO ] Deduced a trap composed of 189 places in 349 ms of which 1 ms to minimize.
[2023-03-13 07:38:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1434 ms
[2023-03-13 07:38:31] [INFO ] Deduced a trap composed of 82 places in 360 ms of which 1 ms to minimize.
[2023-03-13 07:38:32] [INFO ] Deduced a trap composed of 175 places in 351 ms of which 1 ms to minimize.
[2023-03-13 07:38:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 882 ms
[2023-03-13 07:38:33] [INFO ] Deduced a trap composed of 144 places in 372 ms of which 1 ms to minimize.
[2023-03-13 07:38:33] [INFO ] Deduced a trap composed of 104 places in 365 ms of which 1 ms to minimize.
[2023-03-13 07:38:33] [INFO ] Deduced a trap composed of 89 places in 371 ms of which 2 ms to minimize.
[2023-03-13 07:38:34] [INFO ] Deduced a trap composed of 88 places in 374 ms of which 1 ms to minimize.
[2023-03-13 07:38:34] [INFO ] Deduced a trap composed of 95 places in 368 ms of which 0 ms to minimize.
[2023-03-13 07:38:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2360 ms
[2023-03-13 07:38:35] [INFO ] After 6343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 707 ms.
[2023-03-13 07:38:35] [INFO ] After 8126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 32 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 2425/2425 transitions.
Applied a total of 0 rules in 55 ms. Remains 994 /994 variables (removed 0) and now considering 2425/2425 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 994/994 places, 2425/2425 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 2425/2425 transitions.
Applied a total of 0 rules in 55 ms. Remains 994 /994 variables (removed 0) and now considering 2425/2425 (removed 0) transitions.
[2023-03-13 07:38:35] [INFO ] Flow matrix only has 2046 transitions (discarded 379 similar events)
[2023-03-13 07:38:35] [INFO ] Invariant cache hit.
[2023-03-13 07:38:36] [INFO ] Implicit Places using invariants in 689 ms returned []
[2023-03-13 07:38:36] [INFO ] Flow matrix only has 2046 transitions (discarded 379 similar events)
[2023-03-13 07:38:36] [INFO ] Invariant cache hit.
[2023-03-13 07:38:37] [INFO ] State equation strengthened by 848 read => feed constraints.
[2023-03-13 07:38:44] [INFO ] Implicit Places using invariants and state equation in 8081 ms returned []
Implicit Place search using SMT with State Equation took 8773 ms to find 0 implicit places.
[2023-03-13 07:38:44] [INFO ] Redundant transitions in 143 ms returned []
[2023-03-13 07:38:44] [INFO ] Flow matrix only has 2046 transitions (discarded 379 similar events)
[2023-03-13 07:38:44] [INFO ] Invariant cache hit.
[2023-03-13 07:38:45] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9857 ms. Remains : 994/994 places, 2425/2425 transitions.
Graph (trivial) has 735 edges and 994 vertex of which 14 / 994 are part of one of the 1 SCC in 2 ms
Free SCC test removed 13 places
Drop transitions removed 205 transitions
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 609 transitions.
Graph (complete) has 3022 edges and 981 vertex of which 967 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 15 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 951 transition count 1750
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 1 with 166 rules applied. Total rules applied 234 place count 887 transition count 1648
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 2 with 117 rules applied. Total rules applied 351 place count 836 transition count 1582
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 57 rules applied. Total rules applied 408 place count 809 transition count 1552
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 37 rules applied. Total rules applied 445 place count 794 transition count 1530
Reduce places removed 9 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 19 rules applied. Total rules applied 464 place count 785 transition count 1520
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 474 place count 775 transition count 1520
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 474 place count 775 transition count 1511
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 492 place count 766 transition count 1511
Discarding 187 places :
Symmetric choice reduction at 7 with 187 rule applications. Total rules 679 place count 579 transition count 1319
Iterating global reduction 7 with 187 rules applied. Total rules applied 866 place count 579 transition count 1319
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 7 with 140 rules applied. Total rules applied 1006 place count 579 transition count 1179
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 0 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 8 with 756 rules applied. Total rules applied 1762 place count 201 transition count 801
Drop transitions removed 279 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 339 transitions.
Iterating post reduction 8 with 339 rules applied. Total rules applied 2101 place count 201 transition count 462
Discarding 41 places :
Symmetric choice reduction at 9 with 41 rule applications. Total rules 2142 place count 160 transition count 366
Iterating global reduction 9 with 41 rules applied. Total rules applied 2183 place count 160 transition count 366
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 2206 place count 160 transition count 343
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2210 place count 158 transition count 359
Drop transitions removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 10 with 77 rules applied. Total rules applied 2287 place count 158 transition count 282
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 3 rules applied. Total rules applied 2290 place count 158 transition count 279
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 4 rules applied. Total rules applied 2294 place count 155 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2295 place count 154 transition count 278
Discarding 37 places :
Symmetric choice reduction at 13 with 37 rule applications. Total rules 2332 place count 117 transition count 229
Iterating global reduction 13 with 37 rules applied. Total rules applied 2369 place count 117 transition count 229
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 13 with 35 rules applied. Total rules applied 2404 place count 117 transition count 194
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2408 place count 113 transition count 180
Iterating global reduction 14 with 4 rules applied. Total rules applied 2412 place count 113 transition count 180
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 2413 place count 112 transition count 179
Iterating global reduction 14 with 1 rules applied. Total rules applied 2414 place count 112 transition count 179
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2418 place count 110 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2422 place count 110 transition count 200
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2427 place count 106 transition count 199
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2428 place count 106 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 2429 place count 106 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2430 place count 105 transition count 197
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 2437 place count 105 transition count 190
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 2444 place count 98 transition count 190
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 2447 place count 98 transition count 190
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 17 with 7 rules applied. Total rules applied 2454 place count 98 transition count 190
Applied a total of 2454 rules in 558 ms. Remains 98 /994 variables (removed 896) and now considering 190/2425 (removed 2235) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 190 rows 98 cols
[2023-03-13 07:38:46] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-13 07:38:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 07:38:46] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-13 07:38:46] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:38:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 07:38:46] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-13 07:38:46] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:38:46] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-13 07:38:46] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:38:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-13 07:38:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 994 places, 2425 transitions and 11401 arcs took 16 ms.
[2023-03-13 07:38:47] [INFO ] Flatten gal took : 254 ms
Total runtime 113808 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S16C04
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 994 places, 2425 transitions, 11401 arcs.
Final Score: 303470.17
Took : 30 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1678693158430
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 14870:
syntax error
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-S16C04"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856422300767"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;