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.r394-oct2-167903717500143.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 675K Mar 5 18:23 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 ShieldIIPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679493800457

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=ShieldIIPs-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:03:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 14:03:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:03:22] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-22 14:03:22] [INFO ] Transformed 2403 places.
[2023-03-22 14:03:22] [INFO ] Transformed 2363 transitions.
[2023-03-22 14:03:22] [INFO ] Found NUPN structural information;
[2023-03-22 14:03:23] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 16) seen :9
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2023-03-22 14:03:23] [INFO ] Computed 361 place invariants in 41 ms
[2023-03-22 14:03:25] [INFO ] After 1051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 14:03:26] [INFO ] [Nat]Absence check using 361 positive place invariants in 153 ms returned sat
[2023-03-22 14:03:31] [INFO ] After 5242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 14:03:33] [INFO ] Deduced a trap composed of 19 places in 1339 ms of which 24 ms to minimize.
[2023-03-22 14:03:34] [INFO ] Deduced a trap composed of 27 places in 1038 ms of which 2 ms to minimize.
[2023-03-22 14:03:35] [INFO ] Deduced a trap composed of 16 places in 1015 ms of which 2 ms to minimize.
[2023-03-22 14:03:37] [INFO ] Deduced a trap composed of 44 places in 1041 ms of which 4 ms to minimize.
[2023-03-22 14:03:38] [INFO ] Deduced a trap composed of 39 places in 993 ms of which 10 ms to minimize.
[2023-03-22 14:03:39] [INFO ] Deduced a trap composed of 38 places in 962 ms of which 2 ms to minimize.
[2023-03-22 14:03:40] [INFO ] Deduced a trap composed of 30 places in 1029 ms of which 14 ms to minimize.
[2023-03-22 14:03:43] [INFO ] Deduced a trap composed of 13 places in 944 ms of which 2 ms to minimize.
[2023-03-22 14:03:44] [INFO ] Deduced a trap composed of 20 places in 959 ms of which 2 ms to minimize.
[2023-03-22 14:03:45] [INFO ] Deduced a trap composed of 19 places in 765 ms of which 2 ms to minimize.
[2023-03-22 14:03:46] [INFO ] Deduced a trap composed of 23 places in 767 ms of which 1 ms to minimize.
[2023-03-22 14:03:47] [INFO ] Deduced a trap composed of 18 places in 687 ms of which 1 ms to minimize.
[2023-03-22 14:03:48] [INFO ] Deduced a trap composed of 21 places in 714 ms of which 1 ms to minimize.
[2023-03-22 14:03:49] [INFO ] Deduced a trap composed of 24 places in 681 ms of which 3 ms to minimize.
[2023-03-22 14:03:49] [INFO ] Deduced a trap composed of 21 places in 856 ms of which 2 ms to minimize.
[2023-03-22 14:03:50] [INFO ] Deduced a trap composed of 23 places in 689 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-22 14:03:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:03:50] [INFO ] After 25726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 720 ms.
Support contains 148 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 2403 transition count 2190
Reduce places removed 173 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 180 rules applied. Total rules applied 353 place count 2230 transition count 2183
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 360 place count 2223 transition count 2183
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 360 place count 2223 transition count 1985
Deduced a syphon composed of 198 places in 5 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 756 place count 2025 transition count 1985
Discarding 250 places :
Symmetric choice reduction at 3 with 250 rule applications. Total rules 1006 place count 1775 transition count 1735
Iterating global reduction 3 with 250 rules applied. Total rules applied 1256 place count 1775 transition count 1735
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1256 place count 1775 transition count 1651
Deduced a syphon composed of 84 places in 9 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1424 place count 1691 transition count 1651
Performed 538 Post agglomeration using F-continuation condition.Transition count delta: 538
Deduced a syphon composed of 538 places in 4 ms
Reduce places removed 538 places and 0 transitions.
Iterating global reduction 3 with 1076 rules applied. Total rules applied 2500 place count 1153 transition count 1113
Partial Free-agglomeration rule applied 246 times.
Drop transitions removed 246 transitions
Iterating global reduction 3 with 246 rules applied. Total rules applied 2746 place count 1153 transition count 1113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2747 place count 1152 transition count 1112
Applied a total of 2747 rules in 661 ms. Remains 1152 /2403 variables (removed 1251) and now considering 1112/2363 (removed 1251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 662 ms. Remains : 1152/2403 places, 1112/2363 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 7) seen :4
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1112 rows 1152 cols
[2023-03-22 14:03:52] [INFO ] Computed 361 place invariants in 44 ms
[2023-03-22 14:03:53] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:03:53] [INFO ] [Nat]Absence check using 354 positive place invariants in 152 ms returned sat
[2023-03-22 14:03:53] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 14:03:54] [INFO ] After 1392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:03:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:03:55] [INFO ] After 809ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:03:56] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 1 ms to minimize.
[2023-03-22 14:03:56] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
[2023-03-22 14:03:57] [INFO ] Deduced a trap composed of 8 places in 403 ms of which 1 ms to minimize.
[2023-03-22 14:03:57] [INFO ] Deduced a trap composed of 8 places in 475 ms of which 1 ms to minimize.
[2023-03-22 14:03:58] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 0 ms to minimize.
[2023-03-22 14:03:58] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 0 ms to minimize.
[2023-03-22 14:03:58] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-22 14:03:58] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2023-03-22 14:03:59] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 0 ms to minimize.
[2023-03-22 14:03:59] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2023-03-22 14:03:59] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2023-03-22 14:04:00] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 1 ms to minimize.
[2023-03-22 14:04:00] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 0 ms to minimize.
[2023-03-22 14:04:00] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 15 ms to minimize.
[2023-03-22 14:04:01] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 1 ms to minimize.
[2023-03-22 14:04:01] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2023-03-22 14:04:01] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2023-03-22 14:04:02] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 18 ms to minimize.
[2023-03-22 14:04:02] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 0 ms to minimize.
[2023-03-22 14:04:02] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-22 14:04:03] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 2 ms to minimize.
[2023-03-22 14:04:03] [INFO ] Deduced a trap composed of 10 places in 417 ms of which 1 ms to minimize.
[2023-03-22 14:04:03] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2023-03-22 14:04:04] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 2 ms to minimize.
[2023-03-22 14:04:04] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 0 ms to minimize.
[2023-03-22 14:04:04] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2023-03-22 14:04:05] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 1 ms to minimize.
[2023-03-22 14:04:05] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2023-03-22 14:04:05] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-22 14:04:05] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 0 ms to minimize.
[2023-03-22 14:04:06] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 1 ms to minimize.
[2023-03-22 14:04:06] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 0 ms to minimize.
[2023-03-22 14:04:06] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2023-03-22 14:04:07] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 1 ms to minimize.
[2023-03-22 14:04:07] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 0 ms to minimize.
[2023-03-22 14:04:07] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2023-03-22 14:04:08] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2023-03-22 14:04:08] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 0 ms to minimize.
[2023-03-22 14:04:08] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-22 14:04:08] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 12871 ms
[2023-03-22 14:04:09] [INFO ] Deduced a trap composed of 24 places in 354 ms of which 1 ms to minimize.
[2023-03-22 14:04:09] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 1 ms to minimize.
[2023-03-22 14:04:10] [INFO ] Deduced a trap composed of 6 places in 378 ms of which 1 ms to minimize.
[2023-03-22 14:04:10] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 1 ms to minimize.
[2023-03-22 14:04:11] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 0 ms to minimize.
[2023-03-22 14:04:11] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2023-03-22 14:04:11] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 0 ms to minimize.
[2023-03-22 14:04:12] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 1 ms to minimize.
[2023-03-22 14:04:12] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2023-03-22 14:04:12] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-22 14:04:13] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2023-03-22 14:04:13] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 0 ms to minimize.
[2023-03-22 14:04:13] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2023-03-22 14:04:13] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 0 ms to minimize.
[2023-03-22 14:04:14] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 1 ms to minimize.
[2023-03-22 14:04:14] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 1 ms to minimize.
[2023-03-22 14:04:14] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2023-03-22 14:04:15] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 0 ms to minimize.
[2023-03-22 14:04:15] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 0 ms to minimize.
[2023-03-22 14:04:15] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2023-03-22 14:04:16] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 1 ms to minimize.
[2023-03-22 14:04:16] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2023-03-22 14:04:16] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-22 14:04:17] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2023-03-22 14:04:17] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 13 ms to minimize.
[2023-03-22 14:04:17] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2023-03-22 14:04:17] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 0 ms to minimize.
[2023-03-22 14:04:18] [INFO ] Deduced a trap composed of 15 places in 328 ms of which 26 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-22 14:04:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:04:18] [INFO ] After 25223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 119 ms.
Support contains 119 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 1112/1112 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1152 transition count 1110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1150 transition count 1110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 1150 transition count 1108
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1148 transition count 1108
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 1113 transition count 1073
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 1113 transition count 1073
Applied a total of 84 rules in 186 ms. Remains 1113 /1152 variables (removed 39) and now considering 1073/1112 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 1113/1152 places, 1073/1112 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 108065 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108065 steps, saw 65274 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1073 rows 1113 cols
[2023-03-22 14:04:21] [INFO ] Computed 361 place invariants in 11 ms
[2023-03-22 14:04:22] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:04:22] [INFO ] [Nat]Absence check using 355 positive place invariants in 89 ms returned sat
[2023-03-22 14:04:22] [INFO ] [Nat]Absence check using 355 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 14:04:23] [INFO ] After 1309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:04:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:04:24] [INFO ] After 1092ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:04:25] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2023-03-22 14:04:25] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 0 ms to minimize.
[2023-03-22 14:04:25] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-22 14:04:26] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 0 ms to minimize.
[2023-03-22 14:04:26] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 0 ms to minimize.
[2023-03-22 14:04:26] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-22 14:04:27] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2023-03-22 14:04:27] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2023-03-22 14:04:27] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 1 ms to minimize.
[2023-03-22 14:04:28] [INFO ] Deduced a trap composed of 6 places in 388 ms of which 1 ms to minimize.
[2023-03-22 14:04:28] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-22 14:04:28] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2023-03-22 14:04:28] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-22 14:04:29] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 0 ms to minimize.
[2023-03-22 14:04:29] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2023-03-22 14:04:29] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-22 14:04:29] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 0 ms to minimize.
[2023-03-22 14:04:29] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-22 14:04:30] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 0 ms to minimize.
[2023-03-22 14:04:30] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2023-03-22 14:04:30] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-22 14:04:30] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-22 14:04:31] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2023-03-22 14:04:31] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2023-03-22 14:04:31] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 1 ms to minimize.
[2023-03-22 14:04:31] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2023-03-22 14:04:31] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-22 14:04:32] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2023-03-22 14:04:32] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2023-03-22 14:04:32] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-22 14:04:32] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2023-03-22 14:04:32] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2023-03-22 14:04:33] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-22 14:04:33] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-22 14:04:33] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8394 ms
[2023-03-22 14:04:33] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 0 ms to minimize.
[2023-03-22 14:04:34] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-22 14:04:34] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2023-03-22 14:04:34] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-22 14:04:34] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2023-03-22 14:04:35] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 0 ms to minimize.
[2023-03-22 14:04:35] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2023-03-22 14:04:35] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2023-03-22 14:04:36] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2023-03-22 14:04:36] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-22 14:04:36] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 0 ms to minimize.
[2023-03-22 14:04:36] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-22 14:04:36] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 1 ms to minimize.
[2023-03-22 14:04:37] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-22 14:04:37] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 0 ms to minimize.
[2023-03-22 14:04:37] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-22 14:04:38] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 0 ms to minimize.
[2023-03-22 14:04:38] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-22 14:04:38] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2023-03-22 14:04:38] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2023-03-22 14:04:38] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2023-03-22 14:04:39] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 0 ms to minimize.
[2023-03-22 14:04:39] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-22 14:04:39] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2023-03-22 14:04:39] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 14 ms to minimize.
[2023-03-22 14:04:40] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2023-03-22 14:04:40] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 1 ms to minimize.
[2023-03-22 14:04:40] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 0 ms to minimize.
[2023-03-22 14:04:40] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7071 ms
[2023-03-22 14:04:41] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 0 ms to minimize.
[2023-03-22 14:04:41] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-22 14:04:41] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-22 14:04:41] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-22 14:04:42] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-22 14:04:42] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2023-03-22 14:04:42] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-22 14:04:42] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-22 14:04:42] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-22 14:04:43] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 0 ms to minimize.
[2023-03-22 14:04:43] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-22 14:04:43] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-22 14:04:43] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2023-03-22 14:04:43] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-22 14:04:44] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-22 14:04:44] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-22 14:04:44] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-22 14:04:44] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2023-03-22 14:04:44] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 1 ms to minimize.
[2023-03-22 14:04:45] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-22 14:04:45] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-22 14:04:45] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 1 ms to minimize.
[2023-03-22 14:04:45] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-22 14:04:45] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-22 14:04:46] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2023-03-22 14:04:46] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5227 ms
[2023-03-22 14:04:46] [INFO ] After 22378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 878 ms.
[2023-03-22 14:04:47] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 144 ms.
Support contains 119 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 1073/1073 transitions.
Applied a total of 0 rules in 26 ms. Remains 1113 /1113 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1113/1113 places, 1073/1073 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 1073/1073 transitions.
Applied a total of 0 rules in 22 ms. Remains 1113 /1113 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
[2023-03-22 14:04:47] [INFO ] Invariant cache hit.
[2023-03-22 14:04:48] [INFO ] Implicit Places using invariants in 851 ms returned [1099]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 866 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1112/1113 places, 1073/1073 transitions.
Applied a total of 0 rules in 27 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 917 ms. Remains : 1112/1113 places, 1073/1073 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 110148 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110148 steps, saw 65823 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1073 rows 1112 cols
[2023-03-22 14:04:51] [INFO ] Computed 360 place invariants in 6 ms
[2023-03-22 14:04:51] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:04:52] [INFO ] [Nat]Absence check using 354 positive place invariants in 184 ms returned sat
[2023-03-22 14:04:52] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-22 14:04:53] [INFO ] After 1336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:04:54] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 0 ms to minimize.
[2023-03-22 14:04:54] [INFO ] Deduced a trap composed of 5 places in 819 ms of which 16 ms to minimize.
[2023-03-22 14:04:56] [INFO ] Deduced a trap composed of 7 places in 944 ms of which 0 ms to minimize.
[2023-03-22 14:04:56] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-22 14:04:56] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 1 ms to minimize.
[2023-03-22 14:04:56] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2023-03-22 14:04:57] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 1 ms to minimize.
[2023-03-22 14:04:57] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-22 14:04:57] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-22 14:04:57] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-22 14:04:58] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-22 14:04:58] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2023-03-22 14:04:58] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 1 ms to minimize.
[2023-03-22 14:04:59] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 0 ms to minimize.
[2023-03-22 14:05:00] [INFO ] Deduced a trap composed of 7 places in 971 ms of which 0 ms to minimize.
[2023-03-22 14:05:01] [INFO ] Deduced a trap composed of 9 places in 1508 ms of which 0 ms to minimize.
[2023-03-22 14:05:01] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 0 ms to minimize.
[2023-03-22 14:05:02] [INFO ] Deduced a trap composed of 7 places in 393 ms of which 1 ms to minimize.
[2023-03-22 14:05:02] [INFO ] Deduced a trap composed of 10 places in 539 ms of which 0 ms to minimize.
[2023-03-22 14:05:03] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-22 14:05:03] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 1 ms to minimize.
[2023-03-22 14:05:04] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 0 ms to minimize.
[2023-03-22 14:05:04] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-22 14:05:04] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2023-03-22 14:05:04] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-22 14:05:04] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2023-03-22 14:05:05] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-22 14:05:05] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-22 14:05:05] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2023-03-22 14:05:06] [INFO ] Deduced a trap composed of 6 places in 354 ms of which 0 ms to minimize.
[2023-03-22 14:05:06] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2023-03-22 14:05:06] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-22 14:05:06] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2023-03-22 14:05:06] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-22 14:05:06] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2023-03-22 14:05:07] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-22 14:05:07] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-22 14:05:07] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2023-03-22 14:05:07] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 1 ms to minimize.
[2023-03-22 14:05:08] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 1 ms to minimize.
[2023-03-22 14:05:08] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 14 ms to minimize.
[2023-03-22 14:05:08] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 12 ms to minimize.
[2023-03-22 14:05:09] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2023-03-22 14:05:09] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2023-03-22 14:05:09] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2023-03-22 14:05:09] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-22 14:05:09] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 15904 ms
[2023-03-22 14:05:10] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2023-03-22 14:05:10] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2023-03-22 14:05:10] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2023-03-22 14:05:10] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 0 ms to minimize.
[2023-03-22 14:05:11] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2023-03-22 14:05:11] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-22 14:05:11] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 0 ms to minimize.
[2023-03-22 14:05:12] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 0 ms to minimize.
[2023-03-22 14:05:12] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 1 ms to minimize.
[2023-03-22 14:05:12] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 0 ms to minimize.
[2023-03-22 14:05:12] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2023-03-22 14:05:13] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-22 14:05:13] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 1 ms to minimize.
[2023-03-22 14:05:13] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-22 14:05:14] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 2 ms to minimize.
[2023-03-22 14:05:14] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-22 14:05:14] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 0 ms to minimize.
[2023-03-22 14:05:15] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 1 ms to minimize.
[2023-03-22 14:05:15] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2023-03-22 14:05:15] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 0 ms to minimize.
[2023-03-22 14:05:15] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-22 14:05:16] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 0 ms to minimize.
[2023-03-22 14:05:16] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-22 14:05:16] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-22 14:05:16] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2023-03-22 14:05:16] [INFO ] Deduced a trap composed of 23 places in 189 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-22 14:05:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:05:16] [INFO ] After 25132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 99 ms.
Support contains 119 out of 1112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1112/1112 places, 1073/1073 transitions.
Applied a total of 0 rules in 28 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1112/1112 places, 1073/1073 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1112/1112 places, 1073/1073 transitions.
Applied a total of 0 rules in 26 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
[2023-03-22 14:05:17] [INFO ] Invariant cache hit.
[2023-03-22 14:05:17] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-22 14:05:17] [INFO ] Invariant cache hit.
[2023-03-22 14:05:19] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 2599 ms to find 0 implicit places.
[2023-03-22 14:05:19] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-22 14:05:19] [INFO ] Invariant cache hit.
[2023-03-22 14:05:20] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3549 ms. Remains : 1112/1112 places, 1073/1073 transitions.
Applied a total of 0 rules in 22 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-22 14:05:20] [INFO ] Invariant cache hit.
[2023-03-22 14:05:20] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:05:21] [INFO ] [Nat]Absence check using 354 positive place invariants in 51 ms returned sat
[2023-03-22 14:05:21] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 14 ms returned sat
[2023-03-22 14:05:22] [INFO ] After 1128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:05:22] [INFO ] Deduced a trap composed of 9 places in 343 ms of which 4 ms to minimize.
[2023-03-22 14:05:23] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 0 ms to minimize.
[2023-03-22 14:05:23] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-22 14:05:23] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-22 14:05:23] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-22 14:05:24] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 4 ms to minimize.
[2023-03-22 14:05:24] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 0 ms to minimize.
[2023-03-22 14:05:24] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
[2023-03-22 14:05:24] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-22 14:05:25] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 26 ms to minimize.
[2023-03-22 14:05:25] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 8 ms to minimize.
[2023-03-22 14:05:25] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 14 ms to minimize.
[2023-03-22 14:05:25] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 31 ms to minimize.
[2023-03-22 14:05:26] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2023-03-22 14:05:26] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-22 14:05:26] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-22 14:05:26] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-22 14:05:26] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-03-22 14:05:27] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2023-03-22 14:05:27] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2023-03-22 14:05:27] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-22 14:05:27] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-22 14:05:28] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-22 14:05:28] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2023-03-22 14:05:28] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2023-03-22 14:05:28] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2023-03-22 14:05:28] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-22 14:05:28] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2023-03-22 14:05:29] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-22 14:05:29] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-22 14:05:29] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-22 14:05:29] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 1 ms to minimize.
[2023-03-22 14:05:30] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2023-03-22 14:05:30] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-22 14:05:30] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8042 ms
[2023-03-22 14:05:31] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 0 ms to minimize.
[2023-03-22 14:05:31] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-22 14:05:31] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 0 ms to minimize.
[2023-03-22 14:05:31] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-22 14:05:32] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 1 ms to minimize.
[2023-03-22 14:05:32] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-22 14:05:32] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 0 ms to minimize.
[2023-03-22 14:05:32] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-22 14:05:33] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 0 ms to minimize.
[2023-03-22 14:05:33] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 1 ms to minimize.
[2023-03-22 14:05:33] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-22 14:05:33] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2023-03-22 14:05:34] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2023-03-22 14:05:34] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 0 ms to minimize.
[2023-03-22 14:05:34] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
[2023-03-22 14:05:35] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2023-03-22 14:05:35] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2023-03-22 14:05:35] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2023-03-22 14:05:35] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2023-03-22 14:05:35] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5061 ms
[2023-03-22 14:05:36] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-22 14:05:36] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2023-03-22 14:05:36] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2023-03-22 14:05:37] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-22 14:05:37] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-22 14:05:37] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-22 14:05:37] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2023-03-22 14:05:38] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 0 ms to minimize.
[2023-03-22 14:05:38] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-22 14:05:38] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-22 14:05:38] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-22 14:05:38] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-22 14:05:39] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-22 14:05:39] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2023-03-22 14:05:39] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-22 14:05:39] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-22 14:05:39] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-22 14:05:39] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2023-03-22 14:05:40] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-22 14:05:40] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2023-03-22 14:05:40] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 0 ms to minimize.
[2023-03-22 14:05:40] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2023-03-22 14:05:41] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-22 14:05:41] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2023-03-22 14:05:41] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-22 14:05:41] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-22 14:05:41] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-22 14:05:41] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-22 14:05:42] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-22 14:05:42] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-22 14:05:42] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2023-03-22 14:05:42] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 1 ms to minimize.
[2023-03-22 14:05:42] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2023-03-22 14:05:43] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 13 ms to minimize.
[2023-03-22 14:05:43] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2023-03-22 14:05:43] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-22 14:05:43] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2023-03-22 14:05:43] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 7384 ms
[2023-03-22 14:05:43] [INFO ] After 22557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 892 ms.
[2023-03-22 14:05:44] [INFO ] After 23742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:05:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-22 14:05:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1112 places, 1073 transitions and 5046 arcs took 14 ms.
[2023-03-22 14:05:45] [INFO ] Flatten gal took : 185 ms
Total runtime 142610 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: ShieldIIPs_PT_040B
(NrP: 1112 NrTr: 1073 NrArc: 5046)

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

net check time: 0m 0.000sec

init dd package: 0m 2.848sec


before gc: list nodes free: 220395

after gc: idd nodes used:176754, unused:63823246; list nodes free:263445668

before gc: list nodes free: 1078977

after gc: idd nodes used:242928, unused:63757072; list nodes free:267347012

before gc: list nodes free: 1737959

after gc: idd nodes used:298995, unused:63701005; list nodes free:269200340

before gc: list nodes free: 3734533

after gc: idd nodes used:363238, unused:63636762; list nodes free:268917837

before gc: list nodes free: 2694801

after gc: idd nodes used:353653, unused:63646347; list nodes free:268960749

before gc: list nodes free: 1583530

after gc: idd nodes used:406208, unused:63593792; list nodes free:275006166

before gc: list nodes free: 4717120

after gc: idd nodes used:429466, unused:63570534; list nodes free:274922449

before gc: list nodes free: 6650066

after gc: idd nodes used:511825, unused:63488175; list nodes free:274557426

before gc: list nodes free: 7645187

after gc: idd nodes used:507410, unused:63492590; list nodes free:274580262
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6385512 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095460 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.005sec

53988 99379 103590 123943 151983 191072 199364 219226 213293 226381 283087 285277 285506 298524 302849 336852 376100 361155 352337 363627 357832 357752 357430 353463 402852 408418 431254 446056 461190 497046 456210 483604 518691 537209 495353 494853 514617

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="ShieldIIPs-PT-040B"
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 ShieldIIPs-PT-040B, 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 r394-oct2-167903717500143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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