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-167903716700143.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 ShieldIIPs-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-167903716700143
=====================================================================

--------------------
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 1679428087978

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=ShieldIIPs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:48:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 19:48:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:48:10] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-21 19:48:10] [INFO ] Transformed 2403 places.
[2023-03-21 19:48:10] [INFO ] Transformed 2363 transitions.
[2023-03-21 19:48:10] [INFO ] Found NUPN structural information;
[2023-03-21 19:48:10] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 325 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 715 ms. (steps per millisecond=13 ) properties (out of 16) seen :8
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-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 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2023-03-21 19:48:11] [INFO ] Computed 361 place invariants in 25 ms
[2023-03-21 19:48:12] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 19:48:13] [INFO ] [Nat]Absence check using 361 positive place invariants in 181 ms returned sat
[2023-03-21 19:48:20] [INFO ] After 6017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 19:48:22] [INFO ] Deduced a trap composed of 27 places in 967 ms of which 7 ms to minimize.
[2023-03-21 19:48:23] [INFO ] Deduced a trap composed of 15 places in 830 ms of which 3 ms to minimize.
[2023-03-21 19:48:24] [INFO ] Deduced a trap composed of 24 places in 585 ms of which 2 ms to minimize.
[2023-03-21 19:48:25] [INFO ] Deduced a trap composed of 19 places in 1001 ms of which 2 ms to minimize.
[2023-03-21 19:48:26] [INFO ] Deduced a trap composed of 18 places in 808 ms of which 14 ms to minimize.
[2023-03-21 19:48:26] [INFO ] Deduced a trap composed of 12 places in 768 ms of which 2 ms to minimize.
[2023-03-21 19:48:27] [INFO ] Deduced a trap composed of 13 places in 583 ms of which 1 ms to minimize.
[2023-03-21 19:48:28] [INFO ] Deduced a trap composed of 21 places in 638 ms of which 1 ms to minimize.
[2023-03-21 19:48:29] [INFO ] Deduced a trap composed of 37 places in 675 ms of which 1 ms to minimize.
[2023-03-21 19:48:29] [INFO ] Deduced a trap composed of 19 places in 600 ms of which 2 ms to minimize.
[2023-03-21 19:48:32] [INFO ] Deduced a trap composed of 19 places in 866 ms of which 3 ms to minimize.
[2023-03-21 19:48:33] [INFO ] Deduced a trap composed of 20 places in 699 ms of which 2 ms to minimize.
[2023-03-21 19:48:34] [INFO ] Deduced a trap composed of 19 places in 862 ms of which 2 ms to minimize.
[2023-03-21 19:48:36] [INFO ] Deduced a trap composed of 26 places in 802 ms of which 1 ms to minimize.
[2023-03-21 19:48:37] [INFO ] Deduced a trap composed of 34 places in 923 ms of which 1 ms to minimize.
[2023-03-21 19:48:39] [INFO ] Deduced a trap composed of 10 places in 1398 ms of which 3 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-21 19:48:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:48:39] [INFO ] After 26417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 845 ms.
Support contains 178 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2403 transition count 2194
Reduce places removed 169 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 178 rules applied. Total rules applied 347 place count 2234 transition count 2185
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 356 place count 2225 transition count 2185
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 193 Pre rules applied. Total rules applied 356 place count 2225 transition count 1992
Deduced a syphon composed of 193 places in 5 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 3 with 386 rules applied. Total rules applied 742 place count 2032 transition count 1992
Discarding 244 places :
Symmetric choice reduction at 3 with 244 rule applications. Total rules 986 place count 1788 transition count 1748
Iterating global reduction 3 with 244 rules applied. Total rules applied 1230 place count 1788 transition count 1748
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 1230 place count 1788 transition count 1671
Deduced a syphon composed of 77 places in 9 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 1384 place count 1711 transition count 1671
Performed 532 Post agglomeration using F-continuation condition.Transition count delta: 532
Deduced a syphon composed of 532 places in 19 ms
Reduce places removed 532 places and 0 transitions.
Iterating global reduction 3 with 1064 rules applied. Total rules applied 2448 place count 1179 transition count 1139
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 3 with 237 rules applied. Total rules applied 2685 place count 1179 transition count 1139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2686 place count 1178 transition count 1138
Applied a total of 2686 rules in 729 ms. Remains 1178 /2403 variables (removed 1225) and now considering 1138/2363 (removed 1225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 730 ms. Remains : 1178/2403 places, 1138/2363 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 8) seen :5
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
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1138 rows 1178 cols
[2023-03-21 19:48:41] [INFO ] Computed 361 place invariants in 25 ms
[2023-03-21 19:48:41] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:48:41] [INFO ] [Nat]Absence check using 350 positive place invariants in 85 ms returned sat
[2023-03-21 19:48:41] [INFO ] [Nat]Absence check using 350 positive and 11 generalized place invariants in 3 ms returned sat
[2023-03-21 19:48:43] [INFO ] After 1308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:48:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:48:44] [INFO ] After 678ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 19:48:44] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 0 ms to minimize.
[2023-03-21 19:48:44] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2023-03-21 19:48:45] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 1 ms to minimize.
[2023-03-21 19:48:45] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 1 ms to minimize.
[2023-03-21 19:48:45] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-21 19:48:46] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 14 ms to minimize.
[2023-03-21 19:48:46] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 0 ms to minimize.
[2023-03-21 19:48:46] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 1 ms to minimize.
[2023-03-21 19:48:47] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 1 ms to minimize.
[2023-03-21 19:48:47] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2023-03-21 19:48:47] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 0 ms to minimize.
[2023-03-21 19:48:47] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-21 19:48:48] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 1 ms to minimize.
[2023-03-21 19:48:48] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2023-03-21 19:48:48] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 2 ms to minimize.
[2023-03-21 19:48:49] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 5 ms to minimize.
[2023-03-21 19:48:49] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2023-03-21 19:48:49] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 15 ms to minimize.
[2023-03-21 19:48:49] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-21 19:48:50] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 0 ms to minimize.
[2023-03-21 19:48:50] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 0 ms to minimize.
[2023-03-21 19:48:50] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2023-03-21 19:48:51] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 1 ms to minimize.
[2023-03-21 19:48:51] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 11 ms to minimize.
[2023-03-21 19:48:51] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2023-03-21 19:48:51] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 1 ms to minimize.
[2023-03-21 19:48:52] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2023-03-21 19:48:52] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 1 ms to minimize.
[2023-03-21 19:48:52] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 0 ms to minimize.
[2023-03-21 19:48:52] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 0 ms to minimize.
[2023-03-21 19:48:53] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2023-03-21 19:48:53] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2023-03-21 19:48:53] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2023-03-21 19:48:53] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2023-03-21 19:48:54] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-21 19:48:54] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2023-03-21 19:48:54] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 1 ms to minimize.
[2023-03-21 19:48:54] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2023-03-21 19:48:54] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-21 19:48:55] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-21 19:48:55] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 7 ms to minimize.
[2023-03-21 19:48:55] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 1 ms to minimize.
[2023-03-21 19:48:56] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 1 ms to minimize.
[2023-03-21 19:48:56] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-21 19:48:56] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2023-03-21 19:48:56] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2023-03-21 19:48:56] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2023-03-21 19:48:57] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 14 ms to minimize.
[2023-03-21 19:48:57] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 18 ms to minimize.
[2023-03-21 19:48:57] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2023-03-21 19:48:58] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 14 ms to minimize.
[2023-03-21 19:48:58] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 34 ms to minimize.
[2023-03-21 19:48:58] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 2 ms to minimize.
[2023-03-21 19:48:58] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2023-03-21 19:48:58] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2023-03-21 19:48:59] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2023-03-21 19:48:59] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 15065 ms
[2023-03-21 19:48:59] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 0 ms to minimize.
[2023-03-21 19:48:59] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2023-03-21 19:49:00] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2023-03-21 19:49:00] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 1 ms to minimize.
[2023-03-21 19:49:00] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2023-03-21 19:49:00] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 0 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 1 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-21 19:49:02] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-21 19:49:02] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2023-03-21 19:49:02] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 0 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 1 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 0 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-03-21 19:49:05] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2023-03-21 19:49:05] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 0 ms to minimize.
[2023-03-21 19:49:05] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-21 19:49:05] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2023-03-21 19:49:05] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6373 ms
[2023-03-21 19:49:06] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 0 ms to minimize.
[2023-03-21 19:49:06] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 28 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-21 19:49:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:49:06] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 123 ms.
Support contains 119 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 1138/1138 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1178 transition count 1134
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1174 transition count 1134
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 8 place count 1174 transition count 1124
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 1164 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1163 transition count 1123
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1163 transition count 1123
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 130 place count 1113 transition count 1073
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 144 place count 1113 transition count 1073
Applied a total of 144 rules in 274 ms. Remains 1113 /1178 variables (removed 65) and now considering 1073/1138 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 1113/1178 places, 1073/1138 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 98024 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98024 steps, saw 61201 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1073 rows 1113 cols
[2023-03-21 19:49:10] [INFO ] Computed 361 place invariants in 50 ms
[2023-03-21 19:49:10] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:49:11] [INFO ] [Nat]Absence check using 355 positive place invariants in 114 ms returned sat
[2023-03-21 19:49:11] [INFO ] [Nat]Absence check using 355 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-21 19:49:12] [INFO ] After 1194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:49:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:49:13] [INFO ] After 727ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 19:49:13] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2023-03-21 19:49:13] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 0 ms to minimize.
[2023-03-21 19:49:14] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2023-03-21 19:49:14] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2023-03-21 19:49:14] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 0 ms to minimize.
[2023-03-21 19:49:14] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-21 19:49:15] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2023-03-21 19:49:15] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2023-03-21 19:49:15] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 0 ms to minimize.
[2023-03-21 19:49:16] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-21 19:49:16] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 0 ms to minimize.
[2023-03-21 19:49:16] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 0 ms to minimize.
[2023-03-21 19:49:16] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 1 ms to minimize.
[2023-03-21 19:49:17] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-21 19:49:17] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 0 ms to minimize.
[2023-03-21 19:49:17] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 1 ms to minimize.
[2023-03-21 19:49:18] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 2 ms to minimize.
[2023-03-21 19:49:18] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2023-03-21 19:49:18] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 0 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 0 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-21 19:49:20] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 0 ms to minimize.
[2023-03-21 19:49:20] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-21 19:49:20] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-21 19:49:20] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 0 ms to minimize.
[2023-03-21 19:49:21] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2023-03-21 19:49:21] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 0 ms to minimize.
[2023-03-21 19:49:21] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 0 ms to minimize.
[2023-03-21 19:49:21] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2023-03-21 19:49:21] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 0 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 0 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 1 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9634 ms
[2023-03-21 19:49:23] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 0 ms to minimize.
[2023-03-21 19:49:23] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-21 19:49:23] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-21 19:49:24] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2023-03-21 19:49:24] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 1 ms to minimize.
[2023-03-21 19:49:24] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 1 ms to minimize.
[2023-03-21 19:49:24] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 0 ms to minimize.
[2023-03-21 19:49:25] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2023-03-21 19:49:25] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2023-03-21 19:49:25] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2023-03-21 19:49:26] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2023-03-21 19:49:26] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2023-03-21 19:49:26] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2023-03-21 19:49:27] [INFO ] Deduced a trap composed of 10 places in 311 ms of which 1 ms to minimize.
[2023-03-21 19:49:27] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-21 19:49:27] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 0 ms to minimize.
[2023-03-21 19:49:28] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 1 ms to minimize.
[2023-03-21 19:49:28] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-21 19:49:28] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-21 19:49:28] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2023-03-21 19:49:29] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 1 ms to minimize.
[2023-03-21 19:49:29] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 0 ms to minimize.
[2023-03-21 19:49:29] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:49:29] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6374 ms
[2023-03-21 19:49:30] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2023-03-21 19:49:30] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 0 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-21 19:49:33] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 0 ms to minimize.
[2023-03-21 19:49:33] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 0 ms to minimize.
[2023-03-21 19:49:33] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-21 19:49:34] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-21 19:49:34] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-21 19:49:34] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2023-03-21 19:49:34] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-21 19:49:34] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2023-03-21 19:49:35] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-21 19:49:35] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-21 19:49:35] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-21 19:49:36] [INFO ] Deduced a trap composed of 4 places in 922 ms of which 16 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-21 19:49:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:49:36] [INFO ] After 25936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 132 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 29 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 29 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 26 ms. Remains 1113 /1113 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
[2023-03-21 19:49:37] [INFO ] Invariant cache hit.
[2023-03-21 19:49:37] [INFO ] Implicit Places using invariants in 699 ms returned [1099]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 702 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 26 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 754 ms. Remains : 1112/1113 places, 1073/1073 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 110900 steps, run timeout after 3011 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110900 steps, saw 63966 distinct states, run finished after 3011 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1073 rows 1112 cols
[2023-03-21 19:49:41] [INFO ] Computed 360 place invariants in 28 ms
[2023-03-21 19:49:41] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:49:41] [INFO ] [Nat]Absence check using 354 positive place invariants in 95 ms returned sat
[2023-03-21 19:49:41] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-21 19:49:43] [INFO ] After 1423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 1 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 0 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-21 19:49:45] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2023-03-21 19:49:45] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-21 19:49:45] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 1 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 0 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 2 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 10 places in 280 ms of which 1 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2023-03-21 19:49:53] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2023-03-21 19:49:53] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 1 ms to minimize.
[2023-03-21 19:49:53] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2023-03-21 19:49:53] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 1 ms to minimize.
[2023-03-21 19:49:54] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-21 19:49:54] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-21 19:49:54] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 11129 ms
[2023-03-21 19:49:54] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2023-03-21 19:49:55] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2023-03-21 19:49:55] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-21 19:49:55] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 0 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 0 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 1 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 1 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 0 ms to minimize.
[2023-03-21 19:49:59] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 0 ms to minimize.
[2023-03-21 19:49:59] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2023-03-21 19:49:59] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:49:59] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5236 ms
[2023-03-21 19:50:00] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2023-03-21 19:50:00] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-21 19:50:01] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2023-03-21 19:50:01] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-21 19:50:01] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 13 ms to minimize.
[2023-03-21 19:50:01] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-21 19:50:01] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-21 19:50:02] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 1 ms to minimize.
[2023-03-21 19:50:02] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-21 19:50:02] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-21 19:50:02] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 14 ms to minimize.
[2023-03-21 19:50:02] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 22 ms to minimize.
[2023-03-21 19:50:03] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 20 ms to minimize.
[2023-03-21 19:50:03] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 15 ms to minimize.
[2023-03-21 19:50:03] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2023-03-21 19:50:03] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2023-03-21 19:50:04] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2023-03-21 19:50:04] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:50:04] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-21 19:50:04] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-21 19:50:04] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2023-03-21 19:50:05] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5564 ms
[2023-03-21 19:50:05] [INFO ] After 24203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 500 ms.
[2023-03-21 19:50:06] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 184 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 27 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 27 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 27 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
[2023-03-21 19:50:06] [INFO ] Invariant cache hit.
[2023-03-21 19:50:07] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-21 19:50:07] [INFO ] Invariant cache hit.
[2023-03-21 19:50:09] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2419 ms to find 0 implicit places.
[2023-03-21 19:50:09] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-21 19:50:09] [INFO ] Invariant cache hit.
[2023-03-21 19:50:09] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3227 ms. Remains : 1112/1112 places, 1073/1073 transitions.
Applied a total of 0 rules in 40 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-21 19:50:09] [INFO ] Invariant cache hit.
[2023-03-21 19:50:10] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:50:10] [INFO ] [Nat]Absence check using 354 positive place invariants in 70 ms returned sat
[2023-03-21 19:50:10] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-21 19:50:11] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:50:12] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2023-03-21 19:50:12] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 0 ms to minimize.
[2023-03-21 19:50:12] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-21 19:50:12] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2023-03-21 19:50:13] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-21 19:50:13] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2023-03-21 19:50:13] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 0 ms to minimize.
[2023-03-21 19:50:14] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 0 ms to minimize.
[2023-03-21 19:50:14] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 1 ms to minimize.
[2023-03-21 19:50:14] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 1 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 0 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 1 ms to minimize.
[2023-03-21 19:50:16] [INFO ] Deduced a trap composed of 7 places in 300 ms of which 0 ms to minimize.
[2023-03-21 19:50:16] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2023-03-21 19:50:16] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 0 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 0 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 0 ms to minimize.
[2023-03-21 19:50:18] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 1 ms to minimize.
[2023-03-21 19:50:18] [INFO ] Deduced a trap composed of 11 places in 374 ms of which 1 ms to minimize.
[2023-03-21 19:50:19] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2023-03-21 19:50:19] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-21 19:50:19] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-03-21 19:50:19] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 1 ms to minimize.
[2023-03-21 19:50:20] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 0 ms to minimize.
[2023-03-21 19:50:20] [INFO ] Deduced a trap composed of 9 places in 369 ms of which 0 ms to minimize.
[2023-03-21 19:50:20] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2023-03-21 19:50:20] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 0 ms to minimize.
[2023-03-21 19:50:21] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 9341 ms
[2023-03-21 19:50:21] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 1 ms to minimize.
[2023-03-21 19:50:21] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 0 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 1 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
[2023-03-21 19:50:23] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 0 ms to minimize.
[2023-03-21 19:50:23] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2023-03-21 19:50:23] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-21 19:50:23] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 0 ms to minimize.
[2023-03-21 19:50:24] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 3 ms to minimize.
[2023-03-21 19:50:24] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 0 ms to minimize.
[2023-03-21 19:50:25] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-21 19:50:25] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2023-03-21 19:50:25] [INFO ] Deduced a trap composed of 14 places in 349 ms of which 0 ms to minimize.
[2023-03-21 19:50:26] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 1 ms to minimize.
[2023-03-21 19:50:26] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 1 ms to minimize.
[2023-03-21 19:50:26] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 0 ms to minimize.
[2023-03-21 19:50:27] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 0 ms to minimize.
[2023-03-21 19:50:27] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-21 19:50:27] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-21 19:50:27] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2023-03-21 19:50:28] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 1 ms to minimize.
[2023-03-21 19:50:28] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 0 ms to minimize.
[2023-03-21 19:50:28] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2023-03-21 19:50:29] [INFO ] Deduced a trap composed of 9 places in 424 ms of which 0 ms to minimize.
[2023-03-21 19:50:29] [INFO ] Deduced a trap composed of 13 places in 749 ms of which 0 ms to minimize.
[2023-03-21 19:50:31] [INFO ] Deduced a trap composed of 16 places in 1108 ms of which 0 ms to minimize.
[2023-03-21 19:50:31] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-21 19:50:31] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 0 ms to minimize.
[2023-03-21 19:50:32] [INFO ] Deduced a trap composed of 15 places in 817 ms of which 1 ms to minimize.
[2023-03-21 19:50:32] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 0 ms to minimize.
[2023-03-21 19:50:32] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 11644 ms
[2023-03-21 19:50:34] [INFO ] Deduced a trap composed of 8 places in 1613 ms of which 1 ms to minimize.
[2023-03-21 19:50:35] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 0 ms to minimize.
[2023-03-21 19:50:35] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2023-03-21 19:50:35] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-21 19:50:36] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-21 19:50:36] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-21 19:50:36] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
[2023-03-21 19:50:36] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 1 ms to minimize.
[2023-03-21 19:50:37] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 0 ms to minimize.
[2023-03-21 19:50:37] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-21 19:50:37] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 0 ms to minimize.
[2023-03-21 19:50:37] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-21 19:50:38] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 0 ms to minimize.
[2023-03-21 19:50:38] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 1 ms to minimize.
[2023-03-21 19:50:38] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2023-03-21 19:50:39] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 0 ms to minimize.
[2023-03-21 19:50:39] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2023-03-21 19:50:39] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:50:39] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2023-03-21 19:50:40] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-21 19:50:40] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-21 19:50:40] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2023-03-21 19:50:40] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-21 19:50:41] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-21 19:50:41] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2023-03-21 19:50:41] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-21 19:50:41] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-21 19:50:41] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2023-03-21 19:50:42] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8726 ms
[2023-03-21 19:50:42] [INFO ] After 31614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 789 ms.
[2023-03-21 19:50:42] [INFO ] After 32764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 19:50:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2023-03-21 19:50:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1112 places, 1073 transitions and 5046 arcs took 19 ms.
[2023-03-21 19:50:43] [INFO ] Flatten gal took : 134 ms
Total runtime 153125 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/1597/inv_0_ --invariant=/tmp/1597/inv_1_ --invariant=/tmp/1597/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12362644 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095936 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
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="ShieldIIPs-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 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 r393-oct2-167903716700143"
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 ;