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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 13K Feb 26 03:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K 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 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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.2M 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-S16C06-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679594740607

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-S16C06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 18:05:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 18:05:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:05:42] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2023-03-23 18:05:42] [INFO ] Transformed 5568 places.
[2023-03-23 18:05:42] [INFO ] Transformed 7799 transitions.
[2023-03-23 18:05:42] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 160 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 26382 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{11=1}
Probabilistic random walk after 26382 steps, saw 12575 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
[2023-03-23 18:05:46] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2023-03-23 18:05:46] [INFO ] Computed 573 place invariants in 339 ms
[2023-03-23 18:05:48] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2023-03-23 18:05:49] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 270 ms returned sat
[2023-03-23 18:06:01] [INFO ] After 14073ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-23 18:06:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-23 18:06:02] [INFO ] [Nat]Absence check using 50 positive and 523 generalized place invariants in 220 ms returned sat
[2023-03-23 18:06:20] [INFO ] After 16835ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :8
[2023-03-23 18:06:20] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:06:26] [INFO ] After 5910ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :6 sat :7
[2023-03-23 18:06:26] [INFO ] After 5912ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :7
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 18:06:26] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :7
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 69 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.28 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1558 transitions
Trivial Post-agglo rules discarded 1558 transitions
Performed 1558 trivial Post agglomeration. Transition count delta: 1558
Iterating post reduction 0 with 1558 rules applied. Total rules applied 1559 place count 5536 transition count 6241
Reduce places removed 1558 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 1 with 1622 rules applied. Total rules applied 3181 place count 3978 transition count 6177
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 3245 place count 3914 transition count 6177
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 3245 place count 3914 transition count 5981
Deduced a syphon composed of 196 places in 4 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 3637 place count 3718 transition count 5981
Discarding 1410 places :
Symmetric choice reduction at 3 with 1410 rule applications. Total rules 5047 place count 2308 transition count 4571
Iterating global reduction 3 with 1410 rules applied. Total rules applied 6457 place count 2308 transition count 4571
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6457 place count 2308 transition count 4569
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 6461 place count 2306 transition count 4569
Discarding 210 places :
Symmetric choice reduction at 3 with 210 rule applications. Total rules 6671 place count 2096 transition count 3309
Iterating global reduction 3 with 210 rules applied. Total rules applied 6881 place count 2096 transition count 3309
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 18 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 6909 place count 2082 transition count 3295
Free-agglomeration rule (complex) applied 154 times.
Iterating global reduction 3 with 154 rules applied. Total rules applied 7063 place count 2082 transition count 4126
Reduce places removed 154 places and 0 transitions.
Iterating post reduction 3 with 154 rules applied. Total rules applied 7217 place count 1928 transition count 4126
Partial Free-agglomeration rule applied 162 times.
Drop transitions removed 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 7379 place count 1928 transition count 4126
Applied a total of 7379 rules in 2546 ms. Remains 1928 /5568 variables (removed 3640) and now considering 4126/7799 (removed 3673) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2564 ms. Remains : 1928/5568 places, 4126/7799 transitions.
Incomplete random walk after 10000 steps, including 258 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 8) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 18:06:29] [INFO ] Flow matrix only has 3750 transitions (discarded 376 similar events)
// Phase 1: matrix 3750 rows 1928 cols
[2023-03-23 18:06:29] [INFO ] Computed 541 place invariants in 44 ms
[2023-03-23 18:06:30] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 18:06:30] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 99 ms returned sat
[2023-03-23 18:06:30] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 18:06:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 18:06:31] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 99 ms returned sat
[2023-03-23 18:06:34] [INFO ] After 2830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 18:06:34] [INFO ] State equation strengthened by 2113 read => feed constraints.
[2023-03-23 18:06:37] [INFO ] After 3695ms SMT Verify possible using 2113 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-23 18:06:40] [INFO ] Deduced a trap composed of 201 places in 1431 ms of which 6 ms to minimize.
[2023-03-23 18:06:42] [INFO ] Deduced a trap composed of 226 places in 1651 ms of which 2 ms to minimize.
[2023-03-23 18:06:44] [INFO ] Deduced a trap composed of 268 places in 1639 ms of which 8 ms to minimize.
[2023-03-23 18:06:45] [INFO ] Deduced a trap composed of 215 places in 1276 ms of which 4 ms to minimize.
[2023-03-23 18:06:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 6989 ms
[2023-03-23 18:06:48] [INFO ] Deduced a trap composed of 267 places in 1506 ms of which 3 ms to minimize.
[2023-03-23 18:06:50] [INFO ] Deduced a trap composed of 206 places in 1395 ms of which 2 ms to minimize.
[2023-03-23 18:06:53] [INFO ] Deduced a trap composed of 238 places in 1434 ms of which 2 ms to minimize.
[2023-03-23 18:06:54] [INFO ] Deduced a trap composed of 205 places in 1418 ms of which 5 ms to minimize.
[2023-03-23 18:06:56] [INFO ] Deduced a trap composed of 204 places in 1428 ms of which 1 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:06:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:06:56] [INFO ] After 25995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 48 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 4126/4126 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1928 transition count 4122
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1924 transition count 4122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 1924 transition count 4118
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 16 place count 1920 transition count 4118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 1916 transition count 4114
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 1916 transition count 4114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 1916 transition count 4113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 1915 transition count 4113
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 1915 transition count 4111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 1913 transition count 4111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 1912 transition count 4110
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 1912 transition count 4110
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 1912 transition count 4110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 41 place count 1909 transition count 4107
Iterating global reduction 3 with 3 rules applied. Total rules applied 44 place count 1909 transition count 4107
Applied a total of 44 rules in 1210 ms. Remains 1909 /1928 variables (removed 19) and now considering 4107/4126 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1210 ms. Remains : 1909/1928 places, 4107/4126 transitions.
Incomplete random walk after 10000 steps, including 261 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 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 48 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 52492 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52492 steps, saw 23591 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 18:07:01] [INFO ] Flow matrix only has 3731 transitions (discarded 376 similar events)
// Phase 1: matrix 3731 rows 1909 cols
[2023-03-23 18:07:01] [INFO ] Computed 541 place invariants in 63 ms
[2023-03-23 18:07:01] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 18:07:02] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 98 ms returned sat
[2023-03-23 18:07:02] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 18:07:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 18:07:02] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 103 ms returned sat
[2023-03-23 18:07:04] [INFO ] After 2130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 18:07:04] [INFO ] State equation strengthened by 2113 read => feed constraints.
[2023-03-23 18:07:09] [INFO ] After 4559ms SMT Verify possible using 2113 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 18:07:13] [INFO ] Deduced a trap composed of 341 places in 1264 ms of which 1 ms to minimize.
[2023-03-23 18:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1577 ms
[2023-03-23 18:07:13] [INFO ] After 8991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2278 ms.
[2023-03-23 18:07:16] [INFO ] After 13915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 48 out of 1909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1909/1909 places, 4107/4107 transitions.
Applied a total of 0 rules in 146 ms. Remains 1909 /1909 variables (removed 0) and now considering 4107/4107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 1909/1909 places, 4107/4107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1909/1909 places, 4107/4107 transitions.
Applied a total of 0 rules in 150 ms. Remains 1909 /1909 variables (removed 0) and now considering 4107/4107 (removed 0) transitions.
[2023-03-23 18:07:16] [INFO ] Flow matrix only has 3731 transitions (discarded 376 similar events)
[2023-03-23 18:07:16] [INFO ] Invariant cache hit.
[2023-03-23 18:07:20] [INFO ] Implicit Places using invariants in 3680 ms returned [4, 8, 10, 11, 12, 13, 14, 15, 16, 20, 26, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 119, 129, 137, 143, 147, 149, 164, 170, 172, 173, 174, 175, 176, 177, 178, 180, 184, 191, 199, 209, 221, 234, 246, 247, 248, 249, 250, 251, 252, 263, 271, 277, 281, 283, 285, 300, 306, 308, 309, 310, 311, 312, 313, 314, 316, 318, 323, 329, 337, 347, 358, 368, 369, 370, 371, 372, 373, 374, 383, 389, 393, 395, 397, 399, 414, 420, 422, 423, 424, 425, 426, 427, 428, 431, 433, 436, 440, 446, 454, 463, 471, 472, 473, 474, 475, 476, 477, 484, 488, 490, 492, 494, 496, 511, 518, 520, 521, 522, 523, 524, 525, 526, 528, 530, 533, 535, 540, 547, 554, 560, 561, 562, 563, 564, 565, 566, 571, 573, 575, 577, 579, 581, 596, 602, 605, 606, 607, 609, 610, 611, 613, 615, 619, 621, 623, 627, 632, 636, 637, 638, 639, 640, 641, 642, 645, 647, 649, 651, 653, 655, 670, 676, 678, 679, 680, 681, 682, 683, 684, 686, 688, 690, 692, 694, 696, 699, 701, 702, 703, 704, 705, 706, 707, 709, 711, 713, 715, 717, 719, 734, 740, 742, 744, 745, 746, 747, 748, 750, 752, 754, 756, 758, 760, 764, 766, 768, 769, 770, 771, 772, 775, 777, 779, 781, 783, 785, 801, 803, 806, 808, 809, 810, 811, 812, 813, 814, 816, 818, 820, 822, 824, 826, 828, 831, 832, 833, 834, 835, 836, 837, 839, 841, 843, 845, 847, 849, 864, 870, 872, 873, 874, 875, 876, 877, 878, 881, 883, 885, 887, 889, 891, 893, 895, 896, 897, 899, 900, 901, 903, 905, 909, 911, 913, 915, 930, 937, 939, 940, 941, 942, 943, 945, 947, 949, 952, 954, 956, 958, 961, 964, 965, 966, 968, 969, 970, 972, 974, 976, 978, 980, 982, 1000, 1006, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1017, 1019, 1021, 1023, 1025, 1027, 1031, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1046, 1049, 1051, 1054, 1056, 1058, 1073, 1079, 1081, 1082, 1084, 1085, 1086, 1087, 1089, 1091, 1093, 1095, 1099, 1103, 1109, 1117, 1118, 1119, 1120, 1121, 1122, 1130, 1135, 1137, 1139, 1141, 1143, 1158, 1164, 1166, 1167, 1169, 1170, 1171, 1172, 1174, 1176, 1179, 1182, 1186, 1192, 1200, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1223, 1231, 1235, 1237, 1239, 1241, 1257, 1263, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1273, 1275, 1277, 1282, 1288, 1296, 1306, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1334, 1343, 1349, 1353, 1355, 1357, 1372, 1378, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1388, 1390, 1394, 1401, 1409, 1419, 1431, 1444, 1445, 1446, 1447, 1449, 1450, 1463, 1474, 1482, 1489, 1493, 1495, 1511, 1513, 1516, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1526, 1530, 1536, 1545, 1555, 1567, 1581, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1616, 1629, 1639, 1647, 1653, 1657, 1672]
Discarding 486 places :
Implicit Place search using SMT only with invariants took 3705 ms to find 486 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1423/1909 places, 4107/4107 transitions.
Discarding 182 places :
Symmetric choice reduction at 0 with 182 rule applications. Total rules 182 place count 1241 transition count 3925
Iterating global reduction 0 with 182 rules applied. Total rules applied 364 place count 1241 transition count 3925
Discarding 182 places :
Symmetric choice reduction at 0 with 182 rule applications. Total rules 546 place count 1059 transition count 3743
Iterating global reduction 0 with 182 rules applied. Total rules applied 728 place count 1059 transition count 3743
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 731 place count 1059 transition count 3740
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 734 place count 1056 transition count 3740
Applied a total of 734 rules in 256 ms. Remains 1056 /1423 variables (removed 367) and now considering 3740/4107 (removed 367) transitions.
[2023-03-23 18:07:20] [INFO ] Flow matrix only has 3364 transitions (discarded 376 similar events)
// Phase 1: matrix 3364 rows 1056 cols
[2023-03-23 18:07:20] [INFO ] Computed 55 place invariants in 27 ms
[2023-03-23 18:07:21] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2023-03-23 18:07:21] [INFO ] Flow matrix only has 3364 transitions (discarded 376 similar events)
[2023-03-23 18:07:21] [INFO ] Invariant cache hit.
[2023-03-23 18:07:22] [INFO ] State equation strengthened by 2113 read => feed constraints.
[2023-03-23 18:07:42] [INFO ] Implicit Places using invariants and state equation in 21075 ms returned []
Implicit Place search using SMT with State Equation took 22151 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1056/1909 places, 3740/4107 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26263 ms. Remains : 1056/1909 places, 3740/4107 transitions.
Incomplete random walk after 10000 steps, including 275 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 64819 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{2=1}
Probabilistic random walk after 64819 steps, saw 27590 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-23 18:07:45] [INFO ] Flow matrix only has 3364 transitions (discarded 376 similar events)
[2023-03-23 18:07:45] [INFO ] Invariant cache hit.
[2023-03-23 18:07:46] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-23 18:07:46] [INFO ] [Real]Absence check using 31 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-23 18:07:46] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:07:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-23 18:07:46] [INFO ] [Nat]Absence check using 31 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-23 18:07:47] [INFO ] After 1410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:07:47] [INFO ] State equation strengthened by 2113 read => feed constraints.
[2023-03-23 18:07:48] [INFO ] After 862ms SMT Verify possible using 2113 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:07:49] [INFO ] Deduced a trap composed of 124 places in 541 ms of which 1 ms to minimize.
[2023-03-23 18:07:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 727 ms
[2023-03-23 18:07:49] [INFO ] After 2101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 309 ms.
[2023-03-23 18:07:50] [INFO ] After 4029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 30 out of 1056 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1056/1056 places, 3740/3740 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1056 transition count 3737
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1053 transition count 3737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1053 transition count 3736
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1052 transition count 3736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 1049 transition count 3723
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 1049 transition count 3723
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 18 place count 1047 transition count 3721
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 1047 transition count 3778
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 54 place count 1029 transition count 3778
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 1027 transition count 3776
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 1027 transition count 3776
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 1027 transition count 3776
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 1026 transition count 3775
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 1026 transition count 3775
Applied a total of 61 rules in 417 ms. Remains 1026 /1056 variables (removed 30) and now considering 3775/3740 (removed -35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 1026/1056 places, 3775/3740 transitions.
Incomplete random walk after 10000 steps, including 280 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68122 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68122 steps, saw 28831 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 18:07:54] [INFO ] Flow matrix only has 3387 transitions (discarded 388 similar events)
// Phase 1: matrix 3387 rows 1026 cols
[2023-03-23 18:07:54] [INFO ] Computed 55 place invariants in 44 ms
[2023-03-23 18:07:54] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 18:07:54] [INFO ] [Real]Absence check using 31 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-23 18:07:54] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:07:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 18:07:54] [INFO ] [Nat]Absence check using 31 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-23 18:07:55] [INFO ] After 1199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:07:55] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:07:56] [INFO ] After 921ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:07:57] [INFO ] Deduced a trap composed of 119 places in 521 ms of which 1 ms to minimize.
[2023-03-23 18:07:58] [INFO ] Deduced a trap composed of 110 places in 545 ms of which 1 ms to minimize.
[2023-03-23 18:07:59] [INFO ] Deduced a trap composed of 97 places in 526 ms of which 1 ms to minimize.
[2023-03-23 18:07:59] [INFO ] Deduced a trap composed of 83 places in 556 ms of which 1 ms to minimize.
[2023-03-23 18:08:00] [INFO ] Deduced a trap composed of 93 places in 558 ms of which 1 ms to minimize.
[2023-03-23 18:08:01] [INFO ] Deduced a trap composed of 94 places in 540 ms of which 1 ms to minimize.
[2023-03-23 18:08:02] [INFO ] Deduced a trap composed of 201 places in 546 ms of which 4 ms to minimize.
[2023-03-23 18:08:03] [INFO ] Deduced a trap composed of 82 places in 537 ms of which 1 ms to minimize.
[2023-03-23 18:08:03] [INFO ] Deduced a trap composed of 106 places in 537 ms of which 1 ms to minimize.
[2023-03-23 18:08:04] [INFO ] Deduced a trap composed of 84 places in 535 ms of which 1 ms to minimize.
[2023-03-23 18:08:05] [INFO ] Deduced a trap composed of 205 places in 557 ms of which 1 ms to minimize.
[2023-03-23 18:08:06] [INFO ] Deduced a trap composed of 206 places in 542 ms of which 1 ms to minimize.
[2023-03-23 18:08:07] [INFO ] Deduced a trap composed of 220 places in 568 ms of which 1 ms to minimize.
[2023-03-23 18:08:07] [INFO ] Deduced a trap composed of 81 places in 543 ms of which 0 ms to minimize.
[2023-03-23 18:08:08] [INFO ] Deduced a trap composed of 206 places in 583 ms of which 1 ms to minimize.
[2023-03-23 18:08:09] [INFO ] Deduced a trap composed of 91 places in 551 ms of which 1 ms to minimize.
[2023-03-23 18:08:09] [INFO ] Deduced a trap composed of 84 places in 559 ms of which 1 ms to minimize.
[2023-03-23 18:08:10] [INFO ] Deduced a trap composed of 261 places in 532 ms of which 15 ms to minimize.
[2023-03-23 18:08:11] [INFO ] Deduced a trap composed of 85 places in 535 ms of which 1 ms to minimize.
[2023-03-23 18:08:12] [INFO ] Deduced a trap composed of 231 places in 542 ms of which 0 ms to minimize.
[2023-03-23 18:08:13] [INFO ] Deduced a trap composed of 88 places in 530 ms of which 2 ms to minimize.
[2023-03-23 18:08:13] [INFO ] Deduced a trap composed of 79 places in 537 ms of which 4 ms to minimize.
[2023-03-23 18:08:14] [INFO ] Deduced a trap composed of 85 places in 557 ms of which 1 ms to minimize.
[2023-03-23 18:08:15] [INFO ] Deduced a trap composed of 113 places in 514 ms of which 1 ms to minimize.
[2023-03-23 18:08:16] [INFO ] Deduced a trap composed of 110 places in 521 ms of which 1 ms to minimize.
[2023-03-23 18:08:16] [INFO ] Deduced a trap composed of 104 places in 529 ms of which 1 ms to minimize.
[2023-03-23 18:08:17] [INFO ] Deduced a trap composed of 84 places in 527 ms of which 1 ms to minimize.
[2023-03-23 18:08:18] [INFO ] Deduced a trap composed of 69 places in 528 ms of which 1 ms to minimize.
[2023-03-23 18:08:19] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 22253 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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:08:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:08:19] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 5 ms.
Support contains 30 out of 1026 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 3775/3775 transitions.
Applied a total of 0 rules in 94 ms. Remains 1026 /1026 variables (removed 0) and now considering 3775/3775 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 1026/1026 places, 3775/3775 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 3775/3775 transitions.
Applied a total of 0 rules in 91 ms. Remains 1026 /1026 variables (removed 0) and now considering 3775/3775 (removed 0) transitions.
[2023-03-23 18:08:19] [INFO ] Flow matrix only has 3387 transitions (discarded 388 similar events)
[2023-03-23 18:08:19] [INFO ] Invariant cache hit.
[2023-03-23 18:08:20] [INFO ] Implicit Places using invariants in 1085 ms returned [400, 541, 589, 634]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1096 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1022/1026 places, 3775/3775 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1018 transition count 3771
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1018 transition count 3771
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1014 transition count 3767
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1014 transition count 3767
Applied a total of 16 rules in 152 ms. Remains 1014 /1022 variables (removed 8) and now considering 3767/3775 (removed 8) transitions.
[2023-03-23 18:08:20] [INFO ] Flow matrix only has 3379 transitions (discarded 388 similar events)
// Phase 1: matrix 3379 rows 1014 cols
[2023-03-23 18:08:20] [INFO ] Computed 51 place invariants in 33 ms
[2023-03-23 18:08:21] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2023-03-23 18:08:21] [INFO ] Flow matrix only has 3379 transitions (discarded 388 similar events)
[2023-03-23 18:08:21] [INFO ] Invariant cache hit.
[2023-03-23 18:08:22] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:08:43] [INFO ] Implicit Places using invariants and state equation in 21377 ms returned []
Implicit Place search using SMT with State Equation took 22420 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1014/1026 places, 3767/3775 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23759 ms. Remains : 1014/1026 places, 3767/3775 transitions.
Incomplete random walk after 10000 steps, including 279 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68417 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68417 steps, saw 28807 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 18:08:46] [INFO ] Flow matrix only has 3379 transitions (discarded 388 similar events)
[2023-03-23 18:08:46] [INFO ] Invariant cache hit.
[2023-03-23 18:08:46] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 18:08:46] [INFO ] [Real]Absence check using 31 positive and 20 generalized place invariants in 9 ms returned sat
[2023-03-23 18:08:46] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:08:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-23 18:08:46] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 10 ms returned sat
[2023-03-23 18:08:47] [INFO ] After 1026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:08:47] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:08:48] [INFO ] After 938ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:08:49] [INFO ] Deduced a trap composed of 80 places in 501 ms of which 1 ms to minimize.
[2023-03-23 18:08:50] [INFO ] Deduced a trap composed of 82 places in 529 ms of which 0 ms to minimize.
[2023-03-23 18:08:51] [INFO ] Deduced a trap composed of 95 places in 524 ms of which 1 ms to minimize.
[2023-03-23 18:08:52] [INFO ] Deduced a trap composed of 86 places in 522 ms of which 1 ms to minimize.
[2023-03-23 18:08:52] [INFO ] Deduced a trap composed of 97 places in 511 ms of which 1 ms to minimize.
[2023-03-23 18:08:53] [INFO ] Deduced a trap composed of 83 places in 534 ms of which 1 ms to minimize.
[2023-03-23 18:08:54] [INFO ] Deduced a trap composed of 95 places in 553 ms of which 1 ms to minimize.
[2023-03-23 18:08:54] [INFO ] Deduced a trap composed of 96 places in 550 ms of which 1 ms to minimize.
[2023-03-23 18:08:55] [INFO ] Deduced a trap composed of 95 places in 529 ms of which 1 ms to minimize.
[2023-03-23 18:08:56] [INFO ] Deduced a trap composed of 92 places in 532 ms of which 1 ms to minimize.
[2023-03-23 18:08:56] [INFO ] Deduced a trap composed of 79 places in 532 ms of which 1 ms to minimize.
[2023-03-23 18:08:58] [INFO ] Deduced a trap composed of 89 places in 539 ms of which 1 ms to minimize.
[2023-03-23 18:08:59] [INFO ] Deduced a trap composed of 98 places in 522 ms of which 1 ms to minimize.
[2023-03-23 18:08:59] [INFO ] Deduced a trap composed of 92 places in 520 ms of which 1 ms to minimize.
[2023-03-23 18:09:00] [INFO ] Deduced a trap composed of 76 places in 510 ms of which 3 ms to minimize.
[2023-03-23 18:09:01] [INFO ] Deduced a trap composed of 78 places in 510 ms of which 1 ms to minimize.
[2023-03-23 18:09:01] [INFO ] Deduced a trap composed of 82 places in 528 ms of which 0 ms to minimize.
[2023-03-23 18:09:02] [INFO ] Deduced a trap composed of 103 places in 513 ms of which 1 ms to minimize.
[2023-03-23 18:09:03] [INFO ] Deduced a trap composed of 93 places in 521 ms of which 1 ms to minimize.
[2023-03-23 18:09:03] [INFO ] Deduced a trap composed of 86 places in 541 ms of which 0 ms to minimize.
[2023-03-23 18:09:04] [INFO ] Deduced a trap composed of 85 places in 520 ms of which 0 ms to minimize.
[2023-03-23 18:09:05] [INFO ] Deduced a trap composed of 89 places in 548 ms of which 1 ms to minimize.
[2023-03-23 18:09:06] [INFO ] Deduced a trap composed of 91 places in 550 ms of which 1 ms to minimize.
[2023-03-23 18:09:06] [INFO ] Deduced a trap composed of 87 places in 555 ms of which 3 ms to minimize.
[2023-03-23 18:09:08] [INFO ] Deduced a trap composed of 92 places in 539 ms of which 1 ms to minimize.
[2023-03-23 18:09:08] [INFO ] Deduced a trap composed of 96 places in 520 ms of which 3 ms to minimize.
[2023-03-23 18:09:09] [INFO ] Deduced a trap composed of 86 places in 522 ms of which 4 ms to minimize.
[2023-03-23 18:09:10] [INFO ] Deduced a trap composed of 101 places in 515 ms of which 13 ms to minimize.
[2023-03-23 18:09:10] [INFO ] Deduced a trap composed of 90 places in 522 ms of which 1 ms to minimize.
[2023-03-23 18:09:11] [INFO ] Deduced a trap composed of 100 places in 514 ms of which 1 ms to minimize.
[2023-03-23 18:09:11] [INFO ] Deduced a trap composed of 77 places in 539 ms of which 1 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:09:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:09:11] [INFO ] After 25203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4 ms.
Support contains 30 out of 1014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1014/1014 places, 3767/3767 transitions.
Applied a total of 0 rules in 92 ms. Remains 1014 /1014 variables (removed 0) and now considering 3767/3767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1014/1014 places, 3767/3767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1014/1014 places, 3767/3767 transitions.
Applied a total of 0 rules in 91 ms. Remains 1014 /1014 variables (removed 0) and now considering 3767/3767 (removed 0) transitions.
[2023-03-23 18:09:12] [INFO ] Flow matrix only has 3379 transitions (discarded 388 similar events)
[2023-03-23 18:09:12] [INFO ] Invariant cache hit.
[2023-03-23 18:09:13] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-23 18:09:13] [INFO ] Flow matrix only has 3379 transitions (discarded 388 similar events)
[2023-03-23 18:09:13] [INFO ] Invariant cache hit.
[2023-03-23 18:09:13] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:09:32] [INFO ] Implicit Places using invariants and state equation in 19673 ms returned []
Implicit Place search using SMT with State Equation took 20709 ms to find 0 implicit places.
[2023-03-23 18:09:33] [INFO ] Redundant transitions in 261 ms returned []
[2023-03-23 18:09:33] [INFO ] Flow matrix only has 3379 transitions (discarded 388 similar events)
[2023-03-23 18:09:33] [INFO ] Invariant cache hit.
[2023-03-23 18:09:34] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22483 ms. Remains : 1014/1014 places, 3767/3767 transitions.
Graph (trivial) has 1019 edges and 1014 vertex of which 16 / 1014 are part of one of the 1 SCC in 4 ms
Free SCC test removed 15 places
Drop transitions removed 262 transitions
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 646 transitions.
Graph (complete) has 4434 edges and 999 vertex of which 987 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 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 970 transition count 3036
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 1 with 234 rules applied. Total rules applied 321 place count 887 transition count 2885
Reduce places removed 75 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 68 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 2 with 194 rules applied. Total rules applied 515 place count 812 transition count 2766
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 3 with 136 rules applied. Total rules applied 651 place count 761 transition count 2681
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 4 with 101 rules applied. Total rules applied 752 place count 720 transition count 2621
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 5 with 62 rules applied. Total rules applied 814 place count 694 transition count 2585
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 11 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 6 with 35 rules applied. Total rules applied 849 place count 677 transition count 2567
Reduce places removed 7 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 7 with 18 rules applied. Total rules applied 867 place count 670 transition count 2556
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 879 place count 659 transition count 2555
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 879 place count 659 transition count 2537
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 915 place count 641 transition count 2537
Discarding 204 places :
Symmetric choice reduction at 9 with 204 rule applications. Total rules 1119 place count 437 transition count 1383
Iterating global reduction 9 with 204 rules applied. Total rules applied 1323 place count 437 transition count 1383
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 9 with 132 rules applied. Total rules applied 1455 place count 437 transition count 1251
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 10 with 476 rules applied. Total rules applied 1931 place count 199 transition count 1013
Drop transitions removed 234 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 10 with 236 rules applied. Total rules applied 2167 place count 199 transition count 777
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 2216 place count 150 transition count 434
Iterating global reduction 11 with 49 rules applied. Total rules applied 2265 place count 150 transition count 434
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 11 with 26 rules applied. Total rules applied 2291 place count 150 transition count 408
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 12 with 34 rules applied. Total rules applied 2325 place count 150 transition count 374
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2335 place count 140 transition count 314
Iterating global reduction 12 with 10 rules applied. Total rules applied 2345 place count 140 transition count 314
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 2362 place count 140 transition count 297
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 2363 place count 139 transition count 293
Iterating global reduction 13 with 1 rules applied. Total rules applied 2364 place count 139 transition count 293
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 2370 place count 139 transition count 287
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 2371 place count 138 transition count 284
Iterating global reduction 13 with 1 rules applied. Total rules applied 2372 place count 138 transition count 284
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2373 place count 138 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2374 place count 137 transition count 283
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 14 with 12 rules applied. Total rules applied 2386 place count 137 transition count 271
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 14 with 12 rules applied. Total rules applied 2398 place count 125 transition count 271
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2399 place count 124 transition count 266
Iterating global reduction 15 with 1 rules applied. Total rules applied 2400 place count 124 transition count 266
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 15 with 101 rules applied. Total rules applied 2501 place count 124 transition count 266
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 2506 place count 124 transition count 266
Applied a total of 2506 rules in 673 ms. Remains 124 /1014 variables (removed 890) and now considering 266/3767 (removed 3501) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 266 rows 124 cols
[2023-03-23 18:09:35] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-23 18:09:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 18:09:35] [INFO ] [Real]Absence check using 5 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-23 18:09:35] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:09:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 18:09:35] [INFO ] [Nat]Absence check using 5 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-23 18:09:35] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:09:35] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-23 18:09:35] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 18:09:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-23 18:09:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1014 places, 3767 transitions and 18705 arcs took 22 ms.
[2023-03-23 18:09:36] [INFO ] Flatten gal took : 429 ms
Total runtime 234239 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: 1014 NrTr: 3767 NrArc: 18705)

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

net check time: 0m 0.002sec

init dd package: 0m 2.678sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10509608 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16090096 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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.045sec

35648 70126 101303 185817 288775 384224 441529 608550 782864

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

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