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.r393-oct2-167903717100495.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 ltsminxred
Input is ShieldPPPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 708K 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 ShieldPPPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679454770177

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:12:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 03:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:12:53] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2023-03-22 03:12:53] [INFO ] Transformed 2723 places.
[2023-03-22 03:12:53] [INFO ] Transformed 2523 transitions.
[2023-03-22 03:12:53] [INFO ] Found NUPN structural information;
[2023-03-22 03:12:53] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 457 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 559 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-22 03:12:54] [INFO ] Computed 441 place invariants in 32 ms
[2023-03-22 03:12:55] [INFO ] After 1196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 03:12:56] [INFO ] [Nat]Absence check using 441 positive place invariants in 218 ms returned sat
[2023-03-22 03:13:08] [INFO ] After 10797ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-22 03:13:09] [INFO ] Deduced a trap composed of 25 places in 741 ms of which 6 ms to minimize.
[2023-03-22 03:13:10] [INFO ] Deduced a trap composed of 26 places in 753 ms of which 2 ms to minimize.
[2023-03-22 03:13:10] [INFO ] Deduced a trap composed of 35 places in 629 ms of which 12 ms to minimize.
[2023-03-22 03:13:11] [INFO ] Deduced a trap composed of 25 places in 817 ms of which 15 ms to minimize.
[2023-03-22 03:13:12] [INFO ] Deduced a trap composed of 27 places in 662 ms of which 1 ms to minimize.
[2023-03-22 03:13:13] [INFO ] Deduced a trap composed of 26 places in 615 ms of which 2 ms to minimize.
[2023-03-22 03:13:14] [INFO ] Deduced a trap composed of 37 places in 719 ms of which 15 ms to minimize.
[2023-03-22 03:13:15] [INFO ] Deduced a trap composed of 45 places in 745 ms of which 1 ms to minimize.
[2023-03-22 03:13:15] [INFO ] Deduced a trap composed of 39 places in 580 ms of which 2 ms to minimize.
[2023-03-22 03:13:16] [INFO ] Deduced a trap composed of 32 places in 574 ms of which 7 ms to minimize.
[2023-03-22 03:13:17] [INFO ] Deduced a trap composed of 30 places in 744 ms of which 2 ms to minimize.
[2023-03-22 03:13:18] [INFO ] Deduced a trap composed of 41 places in 592 ms of which 1 ms to minimize.
[2023-03-22 03:13:18] [INFO ] Deduced a trap composed of 45 places in 582 ms of which 1 ms to minimize.
[2023-03-22 03:13:19] [INFO ] Deduced a trap composed of 32 places in 623 ms of which 2 ms to minimize.
[2023-03-22 03:13:20] [INFO ] Deduced a trap composed of 18 places in 610 ms of which 1 ms to minimize.
[2023-03-22 03:13:21] [INFO ] Deduced a trap composed of 25 places in 750 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 03:13:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:13:21] [INFO ] After 25425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 813 ms.
Support contains 184 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 2723 transition count 2288
Reduce places removed 235 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 251 rules applied. Total rules applied 486 place count 2488 transition count 2272
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 502 place count 2472 transition count 2272
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 502 place count 2472 transition count 2076
Deduced a syphon composed of 196 places in 5 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 894 place count 2276 transition count 2076
Discarding 242 places :
Symmetric choice reduction at 3 with 242 rule applications. Total rules 1136 place count 2034 transition count 1834
Iterating global reduction 3 with 242 rules applied. Total rules applied 1378 place count 2034 transition count 1834
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 1378 place count 2034 transition count 1751
Deduced a syphon composed of 83 places in 17 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 1544 place count 1951 transition count 1751
Performed 532 Post agglomeration using F-continuation condition.Transition count delta: 532
Deduced a syphon composed of 532 places in 3 ms
Reduce places removed 532 places and 0 transitions.
Iterating global reduction 3 with 1064 rules applied. Total rules applied 2608 place count 1419 transition count 1219
Partial Free-agglomeration rule applied 309 times.
Drop transitions removed 309 transitions
Iterating global reduction 3 with 309 rules applied. Total rules applied 2917 place count 1419 transition count 1219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2918 place count 1418 transition count 1218
Applied a total of 2918 rules in 884 ms. Remains 1418 /2723 variables (removed 1305) and now considering 1218/2523 (removed 1305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 885 ms. Remains : 1418/2723 places, 1218/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 9) seen :5
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1218 rows 1418 cols
[2023-03-22 03:13:23] [INFO ] Computed 441 place invariants in 48 ms
[2023-03-22 03:13:23] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 03:13:23] [INFO ] [Nat]Absence check using 426 positive place invariants in 99 ms returned sat
[2023-03-22 03:13:23] [INFO ] [Nat]Absence check using 426 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 03:13:25] [INFO ] After 1224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 1 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 1 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-22 03:13:27] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 1 ms to minimize.
[2023-03-22 03:13:27] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 0 ms to minimize.
[2023-03-22 03:13:28] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-22 03:13:28] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-22 03:13:28] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2023-03-22 03:13:28] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2023-03-22 03:13:29] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2023-03-22 03:13:29] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2023-03-22 03:13:29] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2023-03-22 03:13:29] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-22 03:13:29] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-22 03:13:30] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2023-03-22 03:13:30] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-22 03:13:30] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 14 ms to minimize.
[2023-03-22 03:13:31] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-22 03:13:31] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-22 03:13:31] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-22 03:13:31] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2023-03-22 03:13:32] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2023-03-22 03:13:32] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 14 ms to minimize.
[2023-03-22 03:13:32] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-03-22 03:13:32] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2023-03-22 03:13:33] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-22 03:13:33] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-22 03:13:33] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-22 03:13:33] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-22 03:13:33] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2023-03-22 03:13:34] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-22 03:13:34] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2023-03-22 03:13:34] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-22 03:13:34] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2023-03-22 03:13:34] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-22 03:13:35] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-22 03:13:35] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-22 03:13:35] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-22 03:13:35] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 19 ms to minimize.
[2023-03-22 03:13:35] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2023-03-22 03:13:35] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 10295 ms
[2023-03-22 03:13:36] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-22 03:13:36] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-22 03:13:36] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 0 ms to minimize.
[2023-03-22 03:13:37] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-22 03:13:37] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-22 03:13:37] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-22 03:13:37] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2023-03-22 03:13:38] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-22 03:13:38] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 4 ms to minimize.
[2023-03-22 03:13:38] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-22 03:13:38] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 14 ms to minimize.
[2023-03-22 03:13:38] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 2 ms to minimize.
[2023-03-22 03:13:39] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 2 ms to minimize.
[2023-03-22 03:13:39] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-22 03:13:39] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2023-03-22 03:13:39] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2023-03-22 03:13:40] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2023-03-22 03:13:40] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2023-03-22 03:13:40] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-22 03:13:40] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-22 03:13:40] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 0 ms to minimize.
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 0 ms to minimize.
[2023-03-22 03:13:41] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5302 ms
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 0 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 0 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 1 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 1 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-22 03:13:45] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2023-03-22 03:13:45] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 0 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 25 places in 412 ms of which 2 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 1 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 0 ms to minimize.
[2023-03-22 03:13:47] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 1 ms to minimize.
[2023-03-22 03:13:47] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 0 ms to minimize.
[2023-03-22 03:13:47] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 0 ms to minimize.
[2023-03-22 03:13:48] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2023-03-22 03:13:48] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 0 ms to minimize.
[2023-03-22 03:13:48] [INFO ] Deduced a trap composed of 4 places in 141 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 03:13:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:13:48] [INFO ] After 25160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 63 ms.
Support contains 96 out of 1418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1418/1418 places, 1218/1218 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1418 transition count 1206
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 1406 transition count 1205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 1405 transition count 1205
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 26 place count 1405 transition count 1192
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 52 place count 1392 transition count 1192
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 1389 transition count 1189
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 1389 transition count 1189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 1389 transition count 1188
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 1388 transition count 1188
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 176 place count 1330 transition count 1130
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 195 place count 1330 transition count 1130
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 200 place count 1325 transition count 1125
Applied a total of 200 rules in 311 ms. Remains 1325 /1418 variables (removed 93) and now considering 1125/1218 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 1325/1418 places, 1125/1218 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1125 rows 1325 cols
[2023-03-22 03:13:49] [INFO ] Computed 441 place invariants in 17 ms
[2023-03-22 03:13:49] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:13:50] [INFO ] [Nat]Absence check using 418 positive place invariants in 84 ms returned sat
[2023-03-22 03:13:50] [INFO ] [Nat]Absence check using 418 positive and 23 generalized place invariants in 8 ms returned sat
[2023-03-22 03:13:51] [INFO ] After 1378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:13:52] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-22 03:13:52] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-22 03:13:53] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2023-03-22 03:13:53] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2023-03-22 03:13:53] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2023-03-22 03:13:54] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 0 ms to minimize.
[2023-03-22 03:13:54] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-22 03:13:54] [INFO ] Deduced a trap composed of 11 places in 400 ms of which 1 ms to minimize.
[2023-03-22 03:13:54] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-22 03:13:55] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-22 03:13:55] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 0 ms to minimize.
[2023-03-22 03:13:55] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:13:56] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-22 03:13:56] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2023-03-22 03:13:56] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2023-03-22 03:13:56] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-22 03:13:57] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-22 03:13:57] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2023-03-22 03:13:57] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-22 03:13:58] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
[2023-03-22 03:13:58] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 0 ms to minimize.
[2023-03-22 03:13:58] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2023-03-22 03:13:58] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 0 ms to minimize.
[2023-03-22 03:13:59] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-22 03:13:59] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-22 03:13:59] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-22 03:13:59] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2023-03-22 03:13:59] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7575 ms
[2023-03-22 03:14:00] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2023-03-22 03:14:00] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-22 03:14:00] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2023-03-22 03:14:01] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
[2023-03-22 03:14:01] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:14:01] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 0 ms to minimize.
[2023-03-22 03:14:02] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 0 ms to minimize.
[2023-03-22 03:14:02] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 0 ms to minimize.
[2023-03-22 03:14:02] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2023-03-22 03:14:03] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 1 ms to minimize.
[2023-03-22 03:14:03] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2023-03-22 03:14:03] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 8 ms to minimize.
[2023-03-22 03:14:04] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 0 ms to minimize.
[2023-03-22 03:14:04] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 1 ms to minimize.
[2023-03-22 03:14:04] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2023-03-22 03:14:04] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 0 ms to minimize.
[2023-03-22 03:14:05] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2023-03-22 03:14:05] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2023-03-22 03:14:05] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-22 03:14:05] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2023-03-22 03:14:06] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2023-03-22 03:14:06] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2023-03-22 03:14:06] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2023-03-22 03:14:07] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2023-03-22 03:14:07] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-22 03:14:07] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2023-03-22 03:14:07] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:14:07] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2023-03-22 03:14:08] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2023-03-22 03:14:08] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 0 ms to minimize.
[2023-03-22 03:14:08] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-22 03:14:08] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 0 ms to minimize.
[2023-03-22 03:14:09] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-22 03:14:09] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-22 03:14:09] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 2 ms to minimize.
[2023-03-22 03:14:09] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-22 03:14:10] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2023-03-22 03:14:10] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2023-03-22 03:14:10] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-22 03:14:10] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-22 03:14:10] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2023-03-22 03:14:11] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-22 03:14:11] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-22 03:14:11] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-22 03:14:11] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-22 03:14:12] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-22 03:14:12] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-22 03:14:12] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-22 03:14:12] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2023-03-22 03:14:12] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 0 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 1 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 33 places in 151 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 03:14:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:14:14] [INFO ] After 25140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 48 ms.
Support contains 77 out of 1325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1325/1325 places, 1125/1125 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1325 transition count 1124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1324 transition count 1124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1324 transition count 1122
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1322 transition count 1122
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 1307 transition count 1107
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 1307 transition count 1107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 1306 transition count 1106
Applied a total of 40 rules in 216 ms. Remains 1306 /1325 variables (removed 19) and now considering 1106/1125 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 1306/1325 places, 1106/1125 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 128525 steps, run timeout after 3011 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128525 steps, saw 122254 distinct states, run finished after 3013 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1106 rows 1306 cols
[2023-03-22 03:14:18] [INFO ] Computed 441 place invariants in 8 ms
[2023-03-22 03:14:18] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:14:19] [INFO ] [Nat]Absence check using 420 positive place invariants in 227 ms returned sat
[2023-03-22 03:14:19] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 3 ms returned sat
[2023-03-22 03:14:21] [INFO ] After 2045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:14:21] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-22 03:14:22] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2023-03-22 03:14:22] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-22 03:14:22] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
[2023-03-22 03:14:22] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2023-03-22 03:14:23] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-22 03:14:23] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2023-03-22 03:14:23] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2023-03-22 03:14:24] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2023-03-22 03:14:24] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:14:24] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-22 03:14:24] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-22 03:14:25] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2023-03-22 03:14:25] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-22 03:14:25] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-22 03:14:25] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2023-03-22 03:14:25] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2023-03-22 03:14:26] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-22 03:14:26] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2023-03-22 03:14:26] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-22 03:14:27] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-22 03:14:27] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-22 03:14:27] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-22 03:14:27] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2023-03-22 03:14:27] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2023-03-22 03:14:28] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2023-03-22 03:14:28] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-22 03:14:28] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-22 03:14:28] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2023-03-22 03:14:28] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2023-03-22 03:14:29] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 0 ms to minimize.
[2023-03-22 03:14:29] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-22 03:14:29] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2023-03-22 03:14:29] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 8194 ms
[2023-03-22 03:14:30] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2023-03-22 03:14:30] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-22 03:14:30] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2023-03-22 03:14:30] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2023-03-22 03:14:31] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2023-03-22 03:14:31] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-22 03:14:31] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-22 03:14:31] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 26 ms to minimize.
[2023-03-22 03:14:32] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-22 03:14:32] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-22 03:14:32] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-22 03:14:32] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-22 03:14:32] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 31 ms to minimize.
[2023-03-22 03:14:33] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-22 03:14:33] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-22 03:14:33] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2023-03-22 03:14:33] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2023-03-22 03:14:34] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2023-03-22 03:14:34] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2023-03-22 03:14:34] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2023-03-22 03:14:34] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2023-03-22 03:14:34] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 0 ms to minimize.
[2023-03-22 03:14:35] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 1 ms to minimize.
[2023-03-22 03:14:35] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 1 ms to minimize.
[2023-03-22 03:14:35] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 14 ms to minimize.
[2023-03-22 03:14:35] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5810 ms
[2023-03-22 03:14:35] [INFO ] After 16690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 990 ms.
[2023-03-22 03:14:36] [INFO ] After 18164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 65 ms.
Support contains 77 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 62 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 42 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-22 03:14:37] [INFO ] Invariant cache hit.
[2023-03-22 03:14:37] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-03-22 03:14:37] [INFO ] Invariant cache hit.
[2023-03-22 03:14:39] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
[2023-03-22 03:14:39] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-22 03:14:39] [INFO ] Invariant cache hit.
[2023-03-22 03:14:40] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3512 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 38 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 03:14:40] [INFO ] Invariant cache hit.
[2023-03-22 03:14:40] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:14:41] [INFO ] [Nat]Absence check using 420 positive place invariants in 133 ms returned sat
[2023-03-22 03:14:41] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-22 03:14:42] [INFO ] After 1452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:14:43] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2023-03-22 03:14:44] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
[2023-03-22 03:14:44] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 21 ms to minimize.
[2023-03-22 03:14:44] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 21 ms to minimize.
[2023-03-22 03:14:44] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-22 03:14:45] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 8 ms to minimize.
[2023-03-22 03:14:45] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2023-03-22 03:14:45] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 14 ms to minimize.
[2023-03-22 03:14:45] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:14:46] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2023-03-22 03:14:46] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-22 03:14:46] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-22 03:14:46] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-22 03:14:47] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 0 ms to minimize.
[2023-03-22 03:14:47] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2023-03-22 03:14:47] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-22 03:14:48] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-22 03:14:48] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-22 03:14:48] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-22 03:14:49] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 0 ms to minimize.
[2023-03-22 03:14:49] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-22 03:14:49] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2023-03-22 03:14:49] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 3 ms to minimize.
[2023-03-22 03:14:50] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 0 ms to minimize.
[2023-03-22 03:14:50] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-22 03:14:50] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2023-03-22 03:14:50] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-22 03:14:50] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-22 03:14:51] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-22 03:14:51] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2023-03-22 03:14:51] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-22 03:14:51] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-22 03:14:51] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-22 03:14:52] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-22 03:14:52] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 0 ms to minimize.
[2023-03-22 03:14:52] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 9391 ms
[2023-03-22 03:14:53] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 0 ms to minimize.
[2023-03-22 03:14:53] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 0 ms to minimize.
[2023-03-22 03:14:53] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2023-03-22 03:14:54] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2023-03-22 03:14:54] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-22 03:14:54] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-22 03:14:55] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 1 ms to minimize.
[2023-03-22 03:14:55] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2023-03-22 03:14:55] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-22 03:14:55] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-22 03:14:56] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 0 ms to minimize.
[2023-03-22 03:14:56] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 1 ms to minimize.
[2023-03-22 03:14:56] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2023-03-22 03:14:56] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-22 03:14:57] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2023-03-22 03:14:57] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-22 03:14:57] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-22 03:14:57] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-22 03:14:58] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 0 ms to minimize.
[2023-03-22 03:14:58] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2023-03-22 03:14:58] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2023-03-22 03:14:58] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2023-03-22 03:14:59] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-22 03:14:59] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-22 03:14:59] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2023-03-22 03:14:59] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-22 03:14:59] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2023-03-22 03:15:00] [INFO ] Deduced a trap composed of 8 places in 315 ms of which 1 ms to minimize.
[2023-03-22 03:15:00] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-22 03:15:00] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-22 03:15:01] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2023-03-22 03:15:01] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-22 03:15:01] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-22 03:15:01] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 0 ms to minimize.
[2023-03-22 03:15:02] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2023-03-22 03:15:02] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2023-03-22 03:15:02] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2023-03-22 03:15:02] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 0 ms to minimize.
[2023-03-22 03:15:02] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 0 ms to minimize.
[2023-03-22 03:15:03] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2023-03-22 03:15:03] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 10280 ms
[2023-03-22 03:15:03] [INFO ] After 22180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2216 ms.
[2023-03-22 03:15:05] [INFO ] After 24784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 03:15:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-22 03:15:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1306 places, 1106 transitions and 4838 arcs took 7 ms.
[2023-03-22 03:15:05] [INFO ] Flatten gal took : 125 ms
Total runtime 132920 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/1508/inv_0_ --invariant=/tmp/1508/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10620792 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095816 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
mcc2023

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="ShieldPPPs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPs-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 r393-oct2-167903717100495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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