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-167856420800791.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800791
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679597816905

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=ReachabilityFireability
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:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 18:56:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:56:58] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2023-03-23 18:56:58] [INFO ] Transformed 6222 places.
[2023-03-23 18:56:58] [INFO ] Transformed 8685 transitions.
[2023-03-23 18:56:58] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 137 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 16) seen :7
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-23 18:57:00] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2023-03-23 18:57:00] [INFO ] Computed 611 place invariants in 377 ms
[2023-03-23 18:57:02] [INFO ] [Real]Absence check using 52 positive place invariants in 34 ms returned sat
[2023-03-23 18:57:02] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 282 ms returned sat
[2023-03-23 18:57:02] [INFO ] After 1999ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-23 18:57:03] [INFO ] [Nat]Absence check using 52 positive place invariants in 26 ms returned sat
[2023-03-23 18:57:04] [INFO ] [Nat]Absence check using 52 positive and 559 generalized place invariants in 273 ms returned sat
[2023-03-23 18:57:27] [INFO ] After 23338ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-23 18:57:28] [INFO ] State equation strengthened by 2450 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:57:28] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:6
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 179 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 1725 transitions
Trivial Post-agglo rules discarded 1725 transitions
Performed 1725 trivial Post agglomeration. Transition count delta: 1725
Iterating post reduction 0 with 1725 rules applied. Total rules applied 1726 place count 6188 transition count 6960
Reduce places removed 1725 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 1875 rules applied. Total rules applied 3601 place count 4463 transition count 6810
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 3751 place count 4313 transition count 6810
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 3751 place count 4313 transition count 6593
Deduced a syphon composed of 217 places in 6 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 4185 place count 4096 transition count 6593
Discarding 1615 places :
Symmetric choice reduction at 3 with 1615 rule applications. Total rules 5800 place count 2481 transition count 4978
Iterating global reduction 3 with 1615 rules applied. Total rules applied 7415 place count 2481 transition count 4978
Discarding 169 places :
Symmetric choice reduction at 3 with 169 rule applications. Total rules 7584 place count 2312 transition count 3795
Iterating global reduction 3 with 169 rules applied. Total rules applied 7753 place count 2312 transition count 3795
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 7769 place count 2304 transition count 3787
Free-agglomeration rule (complex) applied 53 times.
Iterating global reduction 3 with 53 rules applied. Total rules applied 7822 place count 2304 transition count 3734
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 7875 place count 2251 transition count 3734
Partial Free-agglomeration rule applied 219 times.
Drop transitions removed 219 transitions
Iterating global reduction 4 with 219 rules applied. Total rules applied 8094 place count 2251 transition count 3734
Applied a total of 8094 rules in 1472 ms. Remains 2251 /6222 variables (removed 3971) and now considering 3734/8685 (removed 4951) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1473 ms. Remains : 2251/6222 places, 3734/8685 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 18:57:29] [INFO ] Flow matrix only has 3409 transitions (discarded 325 similar events)
// Phase 1: matrix 3409 rows 2251 cols
[2023-03-23 18:57:29] [INFO ] Computed 577 place invariants in 47 ms
[2023-03-23 18:57:30] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-23 18:57:30] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 112 ms returned sat
[2023-03-23 18:57:30] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 18:57:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2023-03-23 18:57:30] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 107 ms returned sat
[2023-03-23 18:57:34] [INFO ] After 3152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 18:57:34] [INFO ] State equation strengthened by 1436 read => feed constraints.
[2023-03-23 18:57:39] [INFO ] After 5520ms SMT Verify possible using 1436 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 18:57:42] [INFO ] Deduced a trap composed of 349 places in 1408 ms of which 9 ms to minimize.
[2023-03-23 18:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2058 ms
[2023-03-23 18:57:44] [INFO ] After 9980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5002 ms.
[2023-03-23 18:57:49] [INFO ] After 18720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 83 out of 2251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2251/2251 places, 3734/3734 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 2251 transition count 3721
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 2238 transition count 3720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 2237 transition count 3720
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 28 place count 2237 transition count 3709
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 50 place count 2226 transition count 3709
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 78 place count 2198 transition count 3609
Iterating global reduction 3 with 28 rules applied. Total rules applied 106 place count 2198 transition count 3609
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 106 place count 2198 transition count 3608
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 2197 transition count 3608
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 121 place count 2184 transition count 3517
Iterating global reduction 3 with 13 rules applied. Total rules applied 134 place count 2184 transition count 3517
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 2180 transition count 3513
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 3 with 43 rules applied. Total rules applied 185 place count 2180 transition count 3470
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 228 place count 2137 transition count 3470
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 231 place count 2134 transition count 3467
Iterating global reduction 4 with 3 rules applied. Total rules applied 234 place count 2134 transition count 3467
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 237 place count 2131 transition count 3446
Iterating global reduction 4 with 3 rules applied. Total rules applied 240 place count 2131 transition count 3446
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 252 place count 2131 transition count 3446
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 259 place count 2124 transition count 3439
Iterating global reduction 4 with 7 rules applied. Total rules applied 266 place count 2124 transition count 3439
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 273 place count 2117 transition count 3390
Iterating global reduction 4 with 7 rules applied. Total rules applied 280 place count 2117 transition count 3390
Applied a total of 280 rules in 782 ms. Remains 2117 /2251 variables (removed 134) and now considering 3390/3734 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 782 ms. Remains : 2117/2251 places, 3390/3734 transitions.
Incomplete random walk after 10000 steps, including 196 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 62656 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62656 steps, saw 28591 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 18:57:53] [INFO ] Flow matrix only has 3024 transitions (discarded 366 similar events)
// Phase 1: matrix 3024 rows 2117 cols
[2023-03-23 18:57:53] [INFO ] Computed 577 place invariants in 39 ms
[2023-03-23 18:57:53] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2023-03-23 18:57:53] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 116 ms returned sat
[2023-03-23 18:57:53] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 18:57:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 18:57:54] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 111 ms returned sat
[2023-03-23 18:57:57] [INFO ] After 2664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 18:57:57] [INFO ] State equation strengthened by 1226 read => feed constraints.
[2023-03-23 18:58:06] [INFO ] After 9195ms SMT Verify possible using 1226 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 18:58:12] [INFO ] Deduced a trap composed of 380 places in 1247 ms of which 3 ms to minimize.
[2023-03-23 18:58:14] [INFO ] Deduced a trap composed of 365 places in 1249 ms of which 3 ms to minimize.
[2023-03-23 18:58:16] [INFO ] Deduced a trap composed of 289 places in 1217 ms of which 2 ms to minimize.
[2023-03-23 18:58:19] [INFO ] Deduced a trap composed of 331 places in 1221 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:58:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:58:19] [INFO ] After 25476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 7 ms.
Support contains 83 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 3390/3390 transitions.
Applied a total of 0 rules in 95 ms. Remains 2117 /2117 variables (removed 0) and now considering 3390/3390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2117/2117 places, 3390/3390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 3390/3390 transitions.
Applied a total of 0 rules in 81 ms. Remains 2117 /2117 variables (removed 0) and now considering 3390/3390 (removed 0) transitions.
[2023-03-23 18:58:19] [INFO ] Flow matrix only has 3024 transitions (discarded 366 similar events)
[2023-03-23 18:58:19] [INFO ] Invariant cache hit.
[2023-03-23 18:58:21] [INFO ] Implicit Places using invariants in 2246 ms returned [4, 7, 10, 11, 12, 13, 14, 15, 16, 17, 22, 28, 38, 49, 61, 75, 90, 105, 106, 107, 108, 109, 110, 111, 112, 125, 135, 143, 149, 153, 156, 173, 179, 182, 183, 187, 188, 189, 190, 196, 201, 208, 217, 227, 239, 252, 265, 267, 268, 269, 270, 271, 272, 283, 291, 297, 301, 303, 305, 325, 331, 335, 336, 337, 338, 339, 341, 343, 345, 350, 357, 367, 377, 391, 402, 403, 404, 405, 406, 407, 408, 409, 418, 424, 429, 431, 433, 435, 453, 459, 463, 464, 465, 466, 467, 469, 471, 477, 480, 485, 491, 499, 508, 517, 518, 519, 520, 521, 522, 523, 524, 531, 535, 537, 539, 542, 544, 563, 570, 573, 575, 576, 578, 579, 580, 585, 589, 591, 594, 598, 604, 611, 618, 619, 620, 621, 622, 623, 624, 625, 631, 633, 635, 637, 639, 641, 659, 666, 669, 671, 672, 673, 675, 676, 680, 682, 684, 686, 688, 692, 700, 705, 706, 707, 708, 709, 710, 711, 712, 715, 717, 719, 721, 723, 725, 743, 749, 752, 753, 754, 755, 756, 757, 758, 759, 761, 763, 765, 767, 769, 771, 774, 777, 778, 779, 782, 783, 785, 790, 794, 796, 798, 800, 818, 824, 827, 828, 830, 831, 832, 833, 834, 839, 841, 843, 845, 847, 849, 851, 854, 855, 856, 857, 858, 859, 860, 861, 863, 865, 867, 869, 871, 873, 890, 892, 895, 898, 899, 900, 901, 902, 904, 905, 907, 909, 913, 915, 917, 919, 921, 924, 925, 926, 927, 928, 929, 930, 931, 933, 936, 938, 940, 942, 944, 962, 968, 971, 973, 974, 975, 976, 978, 980, 982, 984, 988, 990, 995, 997, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1009, 1011, 1013, 1015, 1017, 1019, 1037, 1044, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1056, 1058, 1061, 1063, 1066, 1068, 1070, 1074, 1075, 1076, 1077, 1078, 1079, 1081, 1083, 1085, 1087, 1089, 1094, 1096, 1113, 1119, 1122, 1123, 1124, 1125, 1127, 1129, 1131, 1136, 1138, 1140, 1145, 1147, 1151, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1169, 1172, 1174, 1176, 1178, 1180, 1197, 1203, 1206, 1207, 1208, 1209, 1210, 1212, 1213, 1215, 1217, 1219, 1221, 1224, 1230, 1236, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1257, 1262, 1264, 1267, 1269, 1271, 1295, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1307, 1309, 1311, 1314, 1319, 1325, 1333, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1358, 1365, 1369, 1371, 1373, 1375, 1392, 1398, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1410, 1412, 1414, 1419, 1426, 1434, 1444, 1456, 1457, 1458, 1459, 1460, 1463, 1473, 1482, 1490, 1494, 1496, 1502, 1520, 1527, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1539, 1541, 1545, 1552, 1561, 1571, 1583, 1597, 1598, 1599, 1600, 1601, 1602, 1603, 1604, 1616, 1627, 1635, 1641, 1645, 1647, 1664, 1666, 1670, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1682, 1686, 1692, 1701, 1712, 1724, 1739, 1755, 1756, 1757, 1758, 1759, 1760, 1762, 1776, 1789, 1799, 1807, 1814, 1818, 1839]
Discarding 504 places :
Implicit Place search using SMT only with invariants took 2256 ms to find 504 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1613/2117 places, 3390/3390 transitions.
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 200 place count 1413 transition count 3190
Iterating global reduction 0 with 200 rules applied. Total rules applied 400 place count 1413 transition count 3190
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 599 place count 1214 transition count 2991
Iterating global reduction 0 with 199 rules applied. Total rules applied 798 place count 1214 transition count 2991
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 814 place count 1198 transition count 2879
Iterating global reduction 0 with 16 rules applied. Total rules applied 830 place count 1198 transition count 2879
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 833 place count 1198 transition count 2876
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 836 place count 1195 transition count 2876
Applied a total of 836 rules in 205 ms. Remains 1195 /1613 variables (removed 418) and now considering 2876/3390 (removed 514) transitions.
[2023-03-23 18:58:22] [INFO ] Flow matrix only has 2510 transitions (discarded 366 similar events)
// Phase 1: matrix 2510 rows 1195 cols
[2023-03-23 18:58:22] [INFO ] Computed 73 place invariants in 32 ms
[2023-03-23 18:58:22] [INFO ] Implicit Places using invariants in 836 ms returned []
[2023-03-23 18:58:22] [INFO ] Flow matrix only has 2510 transitions (discarded 366 similar events)
[2023-03-23 18:58:22] [INFO ] Invariant cache hit.
[2023-03-23 18:58:23] [INFO ] State equation strengthened by 1130 read => feed constraints.
[2023-03-23 18:58:38] [INFO ] Implicit Places using invariants and state equation in 15765 ms returned []
Implicit Place search using SMT with State Equation took 16605 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1195/2117 places, 2876/3390 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19148 ms. Remains : 1195/2117 places, 2876/3390 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 72555 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{2=1}
Probabilistic random walk after 72555 steps, saw 31490 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-23 18:58:42] [INFO ] Flow matrix only has 2510 transitions (discarded 366 similar events)
[2023-03-23 18:58:42] [INFO ] Invariant cache hit.
[2023-03-23 18:58:42] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-23 18:58:42] [INFO ] [Real]Absence check using 31 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-23 18:58:42] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:58:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-23 18:58:42] [INFO ] [Nat]Absence check using 31 positive and 42 generalized place invariants in 16 ms returned sat
[2023-03-23 18:58:43] [INFO ] After 1256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:58:43] [INFO ] State equation strengthened by 1130 read => feed constraints.
[2023-03-23 18:58:46] [INFO ] After 2715ms SMT Verify possible using 1130 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:58:47] [INFO ] After 3384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 630 ms.
[2023-03-23 18:58:47] [INFO ] After 5498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 50 out of 1195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1195/1195 places, 2876/2876 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 0 with 7 rules applied. Total rules applied 7 place count 1195 transition count 2869
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1188 transition count 2869
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 1188 transition count 2865
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 1184 transition count 2865
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 34 place count 1172 transition count 2811
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 1172 transition count 2811
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 1168 transition count 2783
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 1168 transition count 2783
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 58 place count 1166 transition count 2781
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 72 place count 1166 transition count 2767
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 86 place count 1152 transition count 2767
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 1149 transition count 2764
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 1149 transition count 2764
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 1147 transition count 2750
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 1147 transition count 2750
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 104 place count 1147 transition count 2750
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 1143 transition count 2746
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 1143 transition count 2746
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 1140 transition count 2725
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 1140 transition count 2725
Applied a total of 118 rules in 349 ms. Remains 1140 /1195 variables (removed 55) and now considering 2725/2876 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 1140/1195 places, 2725/2876 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81668 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81668 steps, saw 35245 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 18:58:51] [INFO ] Flow matrix only has 2347 transitions (discarded 378 similar events)
// Phase 1: matrix 2347 rows 1140 cols
[2023-03-23 18:58:51] [INFO ] Computed 73 place invariants in 28 ms
[2023-03-23 18:58:51] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-23 18:58:51] [INFO ] [Real]Absence check using 31 positive and 42 generalized place invariants in 15 ms returned sat
[2023-03-23 18:58:51] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:58:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 18:58:51] [INFO ] [Nat]Absence check using 31 positive and 42 generalized place invariants in 7 ms returned sat
[2023-03-23 18:58:53] [INFO ] After 1184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:58:53] [INFO ] State equation strengthened by 1034 read => feed constraints.
[2023-03-23 18:58:56] [INFO ] After 3653ms SMT Verify possible using 1034 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:58:58] [INFO ] Deduced a trap composed of 141 places in 451 ms of which 1 ms to minimize.
[2023-03-23 18:58:59] [INFO ] Deduced a trap composed of 136 places in 450 ms of which 1 ms to minimize.
[2023-03-23 18:59:00] [INFO ] Deduced a trap composed of 213 places in 438 ms of which 1 ms to minimize.
[2023-03-23 18:59:00] [INFO ] Deduced a trap composed of 139 places in 464 ms of which 1 ms to minimize.
[2023-03-23 18:59:01] [INFO ] Deduced a trap composed of 120 places in 461 ms of which 1 ms to minimize.
[2023-03-23 18:59:02] [INFO ] Deduced a trap composed of 134 places in 458 ms of which 1 ms to minimize.
[2023-03-23 18:59:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4142 ms
[2023-03-23 18:59:03] [INFO ] Deduced a trap composed of 141 places in 467 ms of which 1 ms to minimize.
[2023-03-23 18:59:04] [INFO ] Deduced a trap composed of 141 places in 470 ms of which 1 ms to minimize.
[2023-03-23 18:59:04] [INFO ] Deduced a trap composed of 155 places in 459 ms of which 1 ms to minimize.
[2023-03-23 18:59:06] [INFO ] Deduced a trap composed of 132 places in 485 ms of which 1 ms to minimize.
[2023-03-23 18:59:06] [INFO ] Deduced a trap composed of 143 places in 464 ms of which 1 ms to minimize.
[2023-03-23 18:59:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4557 ms
[2023-03-23 18:59:07] [INFO ] After 14284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1236 ms.
[2023-03-23 18:59:08] [INFO ] After 16907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 50 out of 1140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1140/1140 places, 2725/2725 transitions.
Applied a total of 0 rules in 50 ms. Remains 1140 /1140 variables (removed 0) and now considering 2725/2725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1140/1140 places, 2725/2725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1140/1140 places, 2725/2725 transitions.
Applied a total of 0 rules in 52 ms. Remains 1140 /1140 variables (removed 0) and now considering 2725/2725 (removed 0) transitions.
[2023-03-23 18:59:08] [INFO ] Flow matrix only has 2347 transitions (discarded 378 similar events)
[2023-03-23 18:59:08] [INFO ] Invariant cache hit.
[2023-03-23 18:59:09] [INFO ] Implicit Places using invariants in 801 ms returned [145, 255, 335, 504, 527, 550, 575, 635, 672, 811, 1012]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 803 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1129/1140 places, 2725/2725 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1118 transition count 2714
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1118 transition count 2714
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1107 transition count 2703
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1107 transition count 2703
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1103 transition count 2675
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1103 transition count 2675
Applied a total of 52 rules in 122 ms. Remains 1103 /1129 variables (removed 26) and now considering 2675/2725 (removed 50) transitions.
[2023-03-23 18:59:09] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
// Phase 1: matrix 2297 rows 1103 cols
[2023-03-23 18:59:09] [INFO ] Computed 62 place invariants in 24 ms
[2023-03-23 18:59:10] [INFO ] Implicit Places using invariants in 798 ms returned []
[2023-03-23 18:59:10] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-23 18:59:10] [INFO ] Invariant cache hit.
[2023-03-23 18:59:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-23 18:59:21] [INFO ] Implicit Places using invariants and state equation in 11558 ms returned []
Implicit Place search using SMT with State Equation took 12358 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1103/1140 places, 2675/2725 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13335 ms. Remains : 1103/1140 places, 2675/2725 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 82720 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82720 steps, saw 35535 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 18:59:25] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-23 18:59:25] [INFO ] Invariant cache hit.
[2023-03-23 18:59:25] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-23 18:59:25] [INFO ] [Real]Absence check using 31 positive and 31 generalized place invariants in 15 ms returned sat
[2023-03-23 18:59:25] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:59:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 18:59:25] [INFO ] [Nat]Absence check using 31 positive and 31 generalized place invariants in 7 ms returned sat
[2023-03-23 18:59:26] [INFO ] After 984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:59:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-23 18:59:28] [INFO ] After 1555ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:59:29] [INFO ] Deduced a trap composed of 127 places in 423 ms of which 1 ms to minimize.
[2023-03-23 18:59:29] [INFO ] Deduced a trap composed of 124 places in 420 ms of which 1 ms to minimize.
[2023-03-23 18:59:30] [INFO ] Deduced a trap composed of 122 places in 427 ms of which 1 ms to minimize.
[2023-03-23 18:59:30] [INFO ] Deduced a trap composed of 184 places in 404 ms of which 1 ms to minimize.
[2023-03-23 18:59:31] [INFO ] Deduced a trap composed of 125 places in 422 ms of which 0 ms to minimize.
[2023-03-23 18:59:32] [INFO ] Deduced a trap composed of 124 places in 418 ms of which 1 ms to minimize.
[2023-03-23 18:59:33] [INFO ] Deduced a trap composed of 132 places in 431 ms of which 1 ms to minimize.
[2023-03-23 18:59:33] [INFO ] Deduced a trap composed of 240 places in 421 ms of which 1 ms to minimize.
[2023-03-23 18:59:35] [INFO ] Deduced a trap composed of 154 places in 434 ms of which 1 ms to minimize.
[2023-03-23 18:59:36] [INFO ] Deduced a trap composed of 181 places in 421 ms of which 1 ms to minimize.
[2023-03-23 18:59:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7857 ms
[2023-03-23 18:59:37] [INFO ] Deduced a trap composed of 152 places in 441 ms of which 1 ms to minimize.
[2023-03-23 18:59:38] [INFO ] Deduced a trap composed of 111 places in 446 ms of which 1 ms to minimize.
[2023-03-23 18:59:39] [INFO ] Deduced a trap composed of 117 places in 439 ms of which 1 ms to minimize.
[2023-03-23 18:59:39] [INFO ] Deduced a trap composed of 101 places in 425 ms of which 1 ms to minimize.
[2023-03-23 18:59:40] [INFO ] Deduced a trap composed of 113 places in 453 ms of which 3 ms to minimize.
[2023-03-23 18:59:40] [INFO ] Deduced a trap composed of 181 places in 445 ms of which 3 ms to minimize.
[2023-03-23 18:59:41] [INFO ] Deduced a trap composed of 124 places in 429 ms of which 1 ms to minimize.
[2023-03-23 18:59:42] [INFO ] Deduced a trap composed of 126 places in 431 ms of which 1 ms to minimize.
[2023-03-23 18:59:42] [INFO ] Deduced a trap composed of 113 places in 441 ms of which 2 ms to minimize.
[2023-03-23 18:59:43] [INFO ] Deduced a trap composed of 119 places in 444 ms of which 1 ms to minimize.
[2023-03-23 18:59:43] [INFO ] Deduced a trap composed of 103 places in 447 ms of which 2 ms to minimize.
[2023-03-23 18:59:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6695 ms
[2023-03-23 18:59:43] [INFO ] After 17323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 772 ms.
[2023-03-23 18:59:44] [INFO ] After 19267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 50 out of 1103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 2675/2675 transitions.
Applied a total of 0 rules in 48 ms. Remains 1103 /1103 variables (removed 0) and now considering 2675/2675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1103/1103 places, 2675/2675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 2675/2675 transitions.
Applied a total of 0 rules in 50 ms. Remains 1103 /1103 variables (removed 0) and now considering 2675/2675 (removed 0) transitions.
[2023-03-23 18:59:44] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-23 18:59:44] [INFO ] Invariant cache hit.
[2023-03-23 18:59:45] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-23 18:59:45] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-23 18:59:45] [INFO ] Invariant cache hit.
[2023-03-23 18:59:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-23 18:59:57] [INFO ] Implicit Places using invariants and state equation in 11861 ms returned []
Implicit Place search using SMT with State Equation took 12628 ms to find 0 implicit places.
[2023-03-23 18:59:57] [INFO ] Redundant transitions in 173 ms returned []
[2023-03-23 18:59:57] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-23 18:59:57] [INFO ] Invariant cache hit.
[2023-03-23 18:59:58] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13836 ms. Remains : 1103/1103 places, 2675/2675 transitions.
Graph (trivial) has 878 edges and 1103 vertex of which 14 / 1103 are part of one of the 1 SCC in 4 ms
Free SCC test removed 13 places
Drop transitions removed 201 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 596 transitions.
Graph (complete) has 3425 edges and 1090 vertex of which 1078 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 1062 transition count 2026
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 31 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 1 with 112 rules applied. Total rules applied 167 place count 1011 transition count 1965
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 23 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 2 with 68 rules applied. Total rules applied 235 place count 981 transition count 1927
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 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 3 with 30 rules applied. Total rules applied 265 place count 966 transition count 1912
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 19 rules applied. Total rules applied 284 place count 959 transition count 1900
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 15 rules applied. Total rules applied 299 place count 954 transition count 1890
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 311 place count 944 transition count 1888
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 311 place count 944 transition count 1862
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 363 place count 918 transition count 1862
Discarding 157 places :
Symmetric choice reduction at 7 with 157 rule applications. Total rules 520 place count 761 transition count 1704
Iterating global reduction 7 with 157 rules applied. Total rules applied 677 place count 761 transition count 1704
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 7 with 88 rules applied. Total rules applied 765 place count 761 transition count 1616
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 8 with 894 rules applied. Total rules applied 1659 place count 314 transition count 1169
Drop transitions removed 308 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 357 transitions.
Iterating post reduction 8 with 357 rules applied. Total rules applied 2016 place count 314 transition count 812
Discarding 30 places :
Symmetric choice reduction at 9 with 30 rule applications. Total rules 2046 place count 284 transition count 722
Iterating global reduction 9 with 30 rules applied. Total rules applied 2076 place count 284 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2077 place count 284 transition count 721
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 2095 place count 275 transition count 838
Drop transitions removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 10 with 119 rules applied. Total rules applied 2214 place count 275 transition count 719
Discarding 54 places :
Symmetric choice reduction at 10 with 54 rule applications. Total rules 2268 place count 221 transition count 581
Iterating global reduction 10 with 54 rules applied. Total rules applied 2322 place count 221 transition count 581
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 10 with 53 rules applied. Total rules applied 2375 place count 221 transition count 528
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2377 place count 220 transition count 527
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2379 place count 219 transition count 532
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2382 place count 219 transition count 529
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2385 place count 216 transition count 529
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 12 with 14 rules applied. Total rules applied 2399 place count 216 transition count 515
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 2413 place count 202 transition count 515
Partial Free-agglomeration rule applied 35 times.
Drop transitions removed 35 transitions
Iterating global reduction 13 with 35 rules applied. Total rules applied 2448 place count 202 transition count 515
Partial Post-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 13 with 29 rules applied. Total rules applied 2477 place count 202 transition count 515
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 2479 place count 200 transition count 511
Iterating global reduction 13 with 2 rules applied. Total rules applied 2481 place count 200 transition count 511
Applied a total of 2481 rules in 579 ms. Remains 200 /1103 variables (removed 903) and now considering 511/2675 (removed 2164) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 511 rows 200 cols
[2023-03-23 18:59:59] [INFO ] Computed 35 place invariants in 9 ms
[2023-03-23 18:59:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:59:59] [INFO ] [Real]Absence check using 6 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-23 18:59:59] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:59:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 18:59:59] [INFO ] [Nat]Absence check using 6 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-23 18:59:59] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:59:59] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-23 18:59:59] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:59:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-23 18:59:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1103 places, 2675 transitions and 12421 arcs took 15 ms.
[2023-03-23 19:00:00] [INFO ] Flatten gal took : 232 ms
Total runtime 181800 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 1103 NrTr: 2675 NrArc: 12421)

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

net check time: 0m 0.001sec

init dd package: 0m 2.622sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9929120 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094980 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
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.036sec

20977 37651 55495 71173 102756 125949 147542 172354 213325 222479 229662 257371 297591 325224 343011 375726 441077 494486 568022 605910 629293 659429 820949 864515 966424

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="ReachabilityFireability"
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 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 r234-tall-167856420800791"
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 [ "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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;