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-167903716700159.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-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 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.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 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 846K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679429026942

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-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:03:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 20:03:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:03:50] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-21 20:03:50] [INFO ] Transformed 3003 places.
[2023-03-21 20:03:50] [INFO ] Transformed 2953 transitions.
[2023-03-21 20:03:50] [INFO ] Found NUPN structural information;
[2023-03-21 20:03:50] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 16) seen :8
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2953 rows 3003 cols
[2023-03-21 20:03:51] [INFO ] Computed 451 place invariants in 56 ms
[2023-03-21 20:03:54] [INFO ] [Real]Absence check using 451 positive place invariants in 528 ms returned sat
[2023-03-21 20:03:54] [INFO ] After 2481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 20:03:56] [INFO ] [Nat]Absence check using 451 positive place invariants in 556 ms returned sat
[2023-03-21 20:04:07] [INFO ] After 10369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 20:04:09] [INFO ] Deduced a trap composed of 29 places in 1728 ms of which 13 ms to minimize.
[2023-03-21 20:04:10] [INFO ] Deduced a trap composed of 20 places in 1105 ms of which 18 ms to minimize.
[2023-03-21 20:04:11] [INFO ] Deduced a trap composed of 20 places in 895 ms of which 3 ms to minimize.
[2023-03-21 20:04:12] [INFO ] Deduced a trap composed of 29 places in 977 ms of which 19 ms to minimize.
[2023-03-21 20:04:13] [INFO ] Deduced a trap composed of 15 places in 1226 ms of which 4 ms to minimize.
[2023-03-21 20:04:15] [INFO ] Deduced a trap composed of 24 places in 1265 ms of which 2 ms to minimize.
[2023-03-21 20:04:16] [INFO ] Deduced a trap composed of 26 places in 1094 ms of which 2 ms to minimize.
[2023-03-21 20:04:17] [INFO ] Deduced a trap composed of 20 places in 1211 ms of which 2 ms to minimize.
[2023-03-21 20:04:19] [INFO ] Deduced a trap composed of 37 places in 1009 ms of which 2 ms to minimize.
[2023-03-21 20:04:20] [INFO ] Deduced a trap composed of 31 places in 999 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-21 20:04:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:04:20] [INFO ] After 25986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1426 ms.
Support contains 220 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 3003 transition count 2732
Reduce places removed 221 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 228 rules applied. Total rules applied 449 place count 2782 transition count 2725
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 456 place count 2775 transition count 2725
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 456 place count 2775 transition count 2491
Deduced a syphon composed of 234 places in 9 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 924 place count 2541 transition count 2491
Discarding 311 places :
Symmetric choice reduction at 3 with 311 rule applications. Total rules 1235 place count 2230 transition count 2180
Iterating global reduction 3 with 311 rules applied. Total rules applied 1546 place count 2230 transition count 2180
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 1546 place count 2230 transition count 2080
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1746 place count 2130 transition count 2080
Performed 691 Post agglomeration using F-continuation condition.Transition count delta: 691
Deduced a syphon composed of 691 places in 4 ms
Reduce places removed 691 places and 0 transitions.
Iterating global reduction 3 with 1382 rules applied. Total rules applied 3128 place count 1439 transition count 1389
Partial Free-agglomeration rule applied 285 times.
Drop transitions removed 285 transitions
Iterating global reduction 3 with 285 rules applied. Total rules applied 3413 place count 1439 transition count 1389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3414 place count 1438 transition count 1388
Applied a total of 3414 rules in 1372 ms. Remains 1438 /3003 variables (removed 1565) and now considering 1388/2953 (removed 1565) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1372 ms. Remains : 1438/3003 places, 1388/2953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 8) seen :3
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-02 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1388 rows 1438 cols
[2023-03-21 20:04:23] [INFO ] Computed 451 place invariants in 19 ms
[2023-03-21 20:04:24] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 20:04:24] [INFO ] [Nat]Absence check using 441 positive place invariants in 120 ms returned sat
[2023-03-21 20:04:24] [INFO ] [Nat]Absence check using 441 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-21 20:04:26] [INFO ] After 1549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 20:04:27] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2023-03-21 20:04:27] [INFO ] Deduced a trap composed of 10 places in 381 ms of which 0 ms to minimize.
[2023-03-21 20:04:27] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2023-03-21 20:04:28] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 21 ms to minimize.
[2023-03-21 20:04:28] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2023-03-21 20:04:29] [INFO ] Deduced a trap composed of 5 places in 456 ms of which 0 ms to minimize.
[2023-03-21 20:04:29] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 0 ms to minimize.
[2023-03-21 20:04:30] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-21 20:04:30] [INFO ] Deduced a trap composed of 4 places in 470 ms of which 0 ms to minimize.
[2023-03-21 20:04:30] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2023-03-21 20:04:31] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 0 ms to minimize.
[2023-03-21 20:04:31] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 13 ms to minimize.
[2023-03-21 20:04:31] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 1 ms to minimize.
[2023-03-21 20:04:32] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-21 20:04:32] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 0 ms to minimize.
[2023-03-21 20:04:32] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 0 ms to minimize.
[2023-03-21 20:04:33] [INFO ] Deduced a trap composed of 8 places in 406 ms of which 26 ms to minimize.
[2023-03-21 20:04:33] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 1 ms to minimize.
[2023-03-21 20:04:34] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 1 ms to minimize.
[2023-03-21 20:04:34] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2023-03-21 20:04:34] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2023-03-21 20:04:35] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 0 ms to minimize.
[2023-03-21 20:04:35] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-21 20:04:36] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 0 ms to minimize.
[2023-03-21 20:04:36] [INFO ] Deduced a trap composed of 6 places in 397 ms of which 1 ms to minimize.
[2023-03-21 20:04:37] [INFO ] Deduced a trap composed of 6 places in 456 ms of which 0 ms to minimize.
[2023-03-21 20:04:37] [INFO ] Deduced a trap composed of 7 places in 511 ms of which 1 ms to minimize.
[2023-03-21 20:04:38] [INFO ] Deduced a trap composed of 7 places in 504 ms of which 1 ms to minimize.
[2023-03-21 20:04:38] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-21 20:04:39] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 2 ms to minimize.
[2023-03-21 20:04:39] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-21 20:04:39] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2023-03-21 20:04:40] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-21 20:04:40] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2023-03-21 20:04:40] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 0 ms to minimize.
[2023-03-21 20:04:41] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2023-03-21 20:04:41] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 0 ms to minimize.
[2023-03-21 20:04:41] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2023-03-21 20:04:42] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 1 ms to minimize.
[2023-03-21 20:04:42] [INFO ] Deduced a trap composed of 24 places in 389 ms of which 1 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Deduced a trap composed of 8 places in 320 ms of which 13 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 1 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 1 ms to minimize.
[2023-03-21 20:04:44] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 0 ms to minimize.
[2023-03-21 20:04:44] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 0 ms to minimize.
[2023-03-21 20:04:44] [INFO ] Deduced a trap composed of 23 places in 354 ms of which 1 ms to minimize.
[2023-03-21 20:04:45] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 5 ms to minimize.
[2023-03-21 20:04:45] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 1 ms to minimize.
[2023-03-21 20:04:46] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-21 20:04:46] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 19630 ms
[2023-03-21 20:04:47] [INFO ] Deduced a trap composed of 9 places in 425 ms of which 1 ms to minimize.
[2023-03-21 20:04:47] [INFO ] Deduced a trap composed of 10 places in 395 ms of which 0 ms to minimize.
[2023-03-21 20:04:47] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 2 ms to minimize.
[2023-03-21 20:04:48] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 0 ms to minimize.
[2023-03-21 20:04:48] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 0 ms to minimize.
[2023-03-21 20:04:49] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 7 ms to minimize.
[2023-03-21 20:04:49] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 0 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 20:04:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:04:49] [INFO ] After 25300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 245 ms.
Support contains 144 out of 1438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1438/1438 places, 1388/1388 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1438 transition count 1382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1432 transition count 1382
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 12 place count 1432 transition count 1368
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 40 place count 1418 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 1417 transition count 1367
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 1417 transition count 1367
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 132 place count 1372 transition count 1322
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 159 place count 1372 transition count 1322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 1371 transition count 1321
Applied a total of 160 rules in 608 ms. Remains 1371 /1438 variables (removed 67) and now considering 1321/1388 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 608 ms. Remains : 1371/1438 places, 1321/1388 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 78563 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{2=1}
Probabilistic random walk after 78563 steps, saw 74488 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :1
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 1321 rows 1371 cols
[2023-03-21 20:04:54] [INFO ] Computed 451 place invariants in 21 ms
[2023-03-21 20:04:54] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:04:54] [INFO ] [Nat]Absence check using 434 positive place invariants in 83 ms returned sat
[2023-03-21 20:04:54] [INFO ] [Nat]Absence check using 434 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-21 20:04:56] [INFO ] After 1566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:04:57] [INFO ] Deduced a trap composed of 5 places in 720 ms of which 1 ms to minimize.
[2023-03-21 20:04:58] [INFO ] Deduced a trap composed of 4 places in 720 ms of which 10 ms to minimize.
[2023-03-21 20:04:58] [INFO ] Deduced a trap composed of 6 places in 465 ms of which 2 ms to minimize.
[2023-03-21 20:04:59] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 1 ms to minimize.
[2023-03-21 20:04:59] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 1 ms to minimize.
[2023-03-21 20:05:00] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2023-03-21 20:05:00] [INFO ] Deduced a trap composed of 8 places in 378 ms of which 1 ms to minimize.
[2023-03-21 20:05:01] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 0 ms to minimize.
[2023-03-21 20:05:01] [INFO ] Deduced a trap composed of 3 places in 591 ms of which 1 ms to minimize.
[2023-03-21 20:05:02] [INFO ] Deduced a trap composed of 9 places in 442 ms of which 1 ms to minimize.
[2023-03-21 20:05:02] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 1 ms to minimize.
[2023-03-21 20:05:03] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 1 ms to minimize.
[2023-03-21 20:05:03] [INFO ] Deduced a trap composed of 7 places in 343 ms of which 1 ms to minimize.
[2023-03-21 20:05:04] [INFO ] Deduced a trap composed of 19 places in 460 ms of which 1 ms to minimize.
[2023-03-21 20:05:04] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 0 ms to minimize.
[2023-03-21 20:05:04] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2023-03-21 20:05:05] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 0 ms to minimize.
[2023-03-21 20:05:05] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 0 ms to minimize.
[2023-03-21 20:05:06] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 0 ms to minimize.
[2023-03-21 20:05:06] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2023-03-21 20:05:06] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 0 ms to minimize.
[2023-03-21 20:05:07] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-21 20:05:07] [INFO ] Deduced a trap composed of 12 places in 367 ms of which 1 ms to minimize.
[2023-03-21 20:05:08] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 1 ms to minimize.
[2023-03-21 20:05:08] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 1 ms to minimize.
[2023-03-21 20:05:08] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2023-03-21 20:05:09] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2023-03-21 20:05:09] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2023-03-21 20:05:09] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 1 ms to minimize.
[2023-03-21 20:05:10] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 1 ms to minimize.
[2023-03-21 20:05:10] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 0 ms to minimize.
[2023-03-21 20:05:10] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 0 ms to minimize.
[2023-03-21 20:05:11] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2023-03-21 20:05:11] [INFO ] Deduced a trap composed of 3 places in 407 ms of which 0 ms to minimize.
[2023-03-21 20:05:12] [INFO ] Deduced a trap composed of 8 places in 319 ms of which 0 ms to minimize.
[2023-03-21 20:05:12] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2023-03-21 20:05:12] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2023-03-21 20:05:13] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-21 20:05:13] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 1 ms to minimize.
[2023-03-21 20:05:14] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2023-03-21 20:05:14] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-21 20:05:14] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 1 ms to minimize.
[2023-03-21 20:05:15] [INFO ] Deduced a trap composed of 9 places in 354 ms of which 1 ms to minimize.
[2023-03-21 20:05:15] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 0 ms to minimize.
[2023-03-21 20:05:16] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2023-03-21 20:05:16] [INFO ] Deduced a trap composed of 10 places in 607 ms of which 1 ms to minimize.
[2023-03-21 20:05:17] [INFO ] Deduced a trap composed of 10 places in 421 ms of which 1 ms to minimize.
[2023-03-21 20:05:17] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 1 ms to minimize.
[2023-03-21 20:05:18] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 0 ms to minimize.
[2023-03-21 20:05:18] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 1 ms to minimize.
[2023-03-21 20:05:18] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 22076 ms
[2023-03-21 20:05:19] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 1 ms to minimize.
[2023-03-21 20:05:20] [INFO ] Deduced a trap composed of 5 places in 1605 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-21 20:05:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:05:20] [INFO ] After 26575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 194 ms.
Support contains 134 out of 1371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1371/1371 places, 1321/1321 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 1371 transition count 1318
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1368 transition count 1318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 1366 transition count 1316
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 1366 transition count 1316
Applied a total of 13 rules in 166 ms. Remains 1366 /1371 variables (removed 5) and now considering 1316/1321 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1366/1371 places, 1316/1321 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67235 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67235 steps, saw 64203 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1316 rows 1366 cols
[2023-03-21 20:05:25] [INFO ] Computed 451 place invariants in 42 ms
[2023-03-21 20:05:25] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:05:25] [INFO ] [Nat]Absence check using 435 positive place invariants in 100 ms returned sat
[2023-03-21 20:05:25] [INFO ] [Nat]Absence check using 435 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-21 20:05:27] [INFO ] After 1174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:05:27] [INFO ] Deduced a trap composed of 6 places in 536 ms of which 2 ms to minimize.
[2023-03-21 20:05:28] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 1 ms to minimize.
[2023-03-21 20:05:28] [INFO ] Deduced a trap composed of 3 places in 421 ms of which 1 ms to minimize.
[2023-03-21 20:05:29] [INFO ] Deduced a trap composed of 8 places in 351 ms of which 0 ms to minimize.
[2023-03-21 20:05:29] [INFO ] Deduced a trap composed of 4 places in 565 ms of which 1 ms to minimize.
[2023-03-21 20:05:30] [INFO ] Deduced a trap composed of 5 places in 952 ms of which 1 ms to minimize.
[2023-03-21 20:05:31] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 1 ms to minimize.
[2023-03-21 20:05:32] [INFO ] Deduced a trap composed of 7 places in 901 ms of which 1 ms to minimize.
[2023-03-21 20:05:32] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 2 ms to minimize.
[2023-03-21 20:05:32] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2023-03-21 20:05:33] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 1 ms to minimize.
[2023-03-21 20:05:34] [INFO ] Deduced a trap composed of 3 places in 546 ms of which 1 ms to minimize.
[2023-03-21 20:05:34] [INFO ] Deduced a trap composed of 3 places in 397 ms of which 1 ms to minimize.
[2023-03-21 20:05:35] [INFO ] Deduced a trap composed of 3 places in 371 ms of which 1 ms to minimize.
[2023-03-21 20:05:35] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2023-03-21 20:05:35] [INFO ] Deduced a trap composed of 9 places in 470 ms of which 1 ms to minimize.
[2023-03-21 20:05:36] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 0 ms to minimize.
[2023-03-21 20:05:36] [INFO ] Deduced a trap composed of 8 places in 340 ms of which 1 ms to minimize.
[2023-03-21 20:05:37] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2023-03-21 20:05:38] [INFO ] Deduced a trap composed of 6 places in 709 ms of which 1 ms to minimize.
[2023-03-21 20:05:39] [INFO ] Deduced a trap composed of 6 places in 1292 ms of which 1 ms to minimize.
[2023-03-21 20:05:39] [INFO ] Deduced a trap composed of 9 places in 494 ms of which 1 ms to minimize.
[2023-03-21 20:05:40] [INFO ] Deduced a trap composed of 8 places in 347 ms of which 1 ms to minimize.
[2023-03-21 20:05:41] [INFO ] Deduced a trap composed of 12 places in 1014 ms of which 3 ms to minimize.
[2023-03-21 20:05:41] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2023-03-21 20:05:42] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2023-03-21 20:05:42] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 0 ms to minimize.
[2023-03-21 20:05:43] [INFO ] Deduced a trap composed of 6 places in 395 ms of which 1 ms to minimize.
[2023-03-21 20:05:43] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2023-03-21 20:05:44] [INFO ] Deduced a trap composed of 10 places in 509 ms of which 1 ms to minimize.
[2023-03-21 20:05:44] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 1 ms to minimize.
[2023-03-21 20:05:44] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 0 ms to minimize.
[2023-03-21 20:05:45] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 1 ms to minimize.
[2023-03-21 20:05:45] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2023-03-21 20:05:45] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 1 ms to minimize.
[2023-03-21 20:05:46] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2023-03-21 20:05:46] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2023-03-21 20:05:46] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 0 ms to minimize.
[2023-03-21 20:05:47] [INFO ] Deduced a trap composed of 17 places in 409 ms of which 0 ms to minimize.
[2023-03-21 20:05:47] [INFO ] Deduced a trap composed of 15 places in 365 ms of which 1 ms to minimize.
[2023-03-21 20:05:47] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 0 ms to minimize.
[2023-03-21 20:05:48] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-21 20:05:48] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 21203 ms
[2023-03-21 20:05:48] [INFO ] Deduced a trap composed of 7 places in 357 ms of which 1 ms to minimize.
[2023-03-21 20:05:49] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 1 ms to minimize.
[2023-03-21 20:05:49] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2023-03-21 20:05:50] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 1 ms to minimize.
[2023-03-21 20:05:50] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-03-21 20:05:50] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1824 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:05:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:05:50] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 123 ms.
Support contains 134 out of 1366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 53 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1366/1366 places, 1316/1316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 37 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
[2023-03-21 20:05:50] [INFO ] Invariant cache hit.
[2023-03-21 20:05:51] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2023-03-21 20:05:51] [INFO ] Invariant cache hit.
[2023-03-21 20:05:54] [INFO ] Implicit Places using invariants and state equation in 2582 ms returned []
Implicit Place search using SMT with State Equation took 3763 ms to find 0 implicit places.
[2023-03-21 20:05:54] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-21 20:05:54] [INFO ] Invariant cache hit.
[2023-03-21 20:05:55] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4770 ms. Remains : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 34 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-21 20:05:55] [INFO ] Invariant cache hit.
[2023-03-21 20:05:55] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:05:56] [INFO ] [Nat]Absence check using 435 positive place invariants in 145 ms returned sat
[2023-03-21 20:05:56] [INFO ] [Nat]Absence check using 435 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-21 20:05:57] [INFO ] After 1288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:05:58] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
[2023-03-21 20:05:58] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 1 ms to minimize.
[2023-03-21 20:05:58] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-21 20:05:59] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2023-03-21 20:05:59] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 1 ms to minimize.
[2023-03-21 20:06:00] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 1 ms to minimize.
[2023-03-21 20:06:00] [INFO ] Deduced a trap composed of 5 places in 406 ms of which 1 ms to minimize.
[2023-03-21 20:06:00] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 0 ms to minimize.
[2023-03-21 20:06:01] [INFO ] Deduced a trap composed of 6 places in 347 ms of which 1 ms to minimize.
[2023-03-21 20:06:01] [INFO ] Deduced a trap composed of 8 places in 488 ms of which 2 ms to minimize.
[2023-03-21 20:06:02] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 1 ms to minimize.
[2023-03-21 20:06:02] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-21 20:06:03] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2023-03-21 20:06:03] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 1 ms to minimize.
[2023-03-21 20:06:03] [INFO ] Deduced a trap composed of 10 places in 401 ms of which 1 ms to minimize.
[2023-03-21 20:06:04] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 1 ms to minimize.
[2023-03-21 20:06:04] [INFO ] Deduced a trap composed of 6 places in 442 ms of which 1 ms to minimize.
[2023-03-21 20:06:05] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 2 ms to minimize.
[2023-03-21 20:06:05] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-21 20:06:06] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2023-03-21 20:06:06] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2023-03-21 20:06:06] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 0 ms to minimize.
[2023-03-21 20:06:07] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2023-03-21 20:06:07] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 0 ms to minimize.
[2023-03-21 20:06:08] [INFO ] Deduced a trap composed of 10 places in 294 ms of which 1 ms to minimize.
[2023-03-21 20:06:08] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 1 ms to minimize.
[2023-03-21 20:06:09] [INFO ] Deduced a trap composed of 12 places in 607 ms of which 5 ms to minimize.
[2023-03-21 20:06:09] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2023-03-21 20:06:10] [INFO ] Deduced a trap composed of 8 places in 379 ms of which 1 ms to minimize.
[2023-03-21 20:06:10] [INFO ] Deduced a trap composed of 3 places in 469 ms of which 1 ms to minimize.
[2023-03-21 20:06:11] [INFO ] Deduced a trap composed of 16 places in 421 ms of which 1 ms to minimize.
[2023-03-21 20:06:11] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 1 ms to minimize.
[2023-03-21 20:06:11] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2023-03-21 20:06:12] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 1 ms to minimize.
[2023-03-21 20:06:12] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 2 ms to minimize.
[2023-03-21 20:06:13] [INFO ] Deduced a trap composed of 11 places in 513 ms of which 0 ms to minimize.
[2023-03-21 20:06:13] [INFO ] Deduced a trap composed of 16 places in 499 ms of which 0 ms to minimize.
[2023-03-21 20:06:14] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2023-03-21 20:06:14] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 0 ms to minimize.
[2023-03-21 20:06:15] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 1 ms to minimize.
[2023-03-21 20:06:15] [INFO ] Deduced a trap composed of 17 places in 849 ms of which 1 ms to minimize.
[2023-03-21 20:06:16] [INFO ] Deduced a trap composed of 8 places in 315 ms of which 1 ms to minimize.
[2023-03-21 20:06:16] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2023-03-21 20:06:17] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 1 ms to minimize.
[2023-03-21 20:06:17] [INFO ] Deduced a trap composed of 5 places in 432 ms of which 1 ms to minimize.
[2023-03-21 20:06:18] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2023-03-21 20:06:18] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-21 20:06:18] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 20614 ms
[2023-03-21 20:06:18] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2023-03-21 20:06:19] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 1 ms to minimize.
[2023-03-21 20:06:19] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 0 ms to minimize.
[2023-03-21 20:06:20] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 0 ms to minimize.
[2023-03-21 20:06:21] [INFO ] Deduced a trap composed of 7 places in 1064 ms of which 1 ms to minimize.
[2023-03-21 20:06:21] [INFO ] Deduced a trap composed of 5 places in 461 ms of which 1 ms to minimize.
[2023-03-21 20:06:22] [INFO ] Deduced a trap composed of 5 places in 519 ms of which 20 ms to minimize.
[2023-03-21 20:06:22] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2023-03-21 20:06:23] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 39 ms to minimize.
[2023-03-21 20:06:23] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 1 ms to minimize.
[2023-03-21 20:06:24] [INFO ] Deduced a trap composed of 8 places in 417 ms of which 1 ms to minimize.
[2023-03-21 20:06:24] [INFO ] Deduced a trap composed of 7 places in 352 ms of which 0 ms to minimize.
[2023-03-21 20:06:25] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 1 ms to minimize.
[2023-03-21 20:06:25] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2023-03-21 20:06:25] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 0 ms to minimize.
[2023-03-21 20:06:26] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2023-03-21 20:06:27] [INFO ] Deduced a trap composed of 14 places in 1490 ms of which 1 ms to minimize.
[2023-03-21 20:06:28] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 1 ms to minimize.
[2023-03-21 20:06:28] [INFO ] Deduced a trap composed of 12 places in 460 ms of which 0 ms to minimize.
[2023-03-21 20:06:28] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2023-03-21 20:06:29] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 1 ms to minimize.
[2023-03-21 20:06:29] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2023-03-21 20:06:29] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2023-03-21 20:06:30] [INFO ] Deduced a trap composed of 5 places in 406 ms of which 0 ms to minimize.
[2023-03-21 20:06:30] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2023-03-21 20:06:31] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 1 ms to minimize.
[2023-03-21 20:06:31] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 12658 ms
[2023-03-21 20:06:31] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2023-03-21 20:06:32] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-21 20:06:33] [INFO ] Deduced a trap composed of 4 places in 1121 ms of which 1 ms to minimize.
[2023-03-21 20:06:33] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2023-03-21 20:06:34] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 1 ms to minimize.
[2023-03-21 20:06:34] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-21 20:06:34] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-21 20:06:35] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 1 ms to minimize.
[2023-03-21 20:06:35] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-03-21 20:06:35] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-21 20:06:36] [INFO ] Deduced a trap composed of 17 places in 750 ms of which 1 ms to minimize.
[2023-03-21 20:06:36] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 0 ms to minimize.
[2023-03-21 20:06:37] [INFO ] Deduced a trap composed of 8 places in 499 ms of which 0 ms to minimize.
[2023-03-21 20:06:37] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-21 20:06:38] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 2 ms to minimize.
[2023-03-21 20:06:38] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2023-03-21 20:06:39] [INFO ] Deduced a trap composed of 17 places in 1119 ms of which 25 ms to minimize.
[2023-03-21 20:06:40] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 1 ms to minimize.
[2023-03-21 20:06:40] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 2 ms to minimize.
[2023-03-21 20:06:40] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 1 ms to minimize.
[2023-03-21 20:06:41] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 1 ms to minimize.
[2023-03-21 20:06:41] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2023-03-21 20:06:41] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 0 ms to minimize.
[2023-03-21 20:06:42] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 1 ms to minimize.
[2023-03-21 20:06:42] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 10783 ms
[2023-03-21 20:06:42] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2023-03-21 20:06:43] [INFO ] Deduced a trap composed of 5 places in 820 ms of which 27 ms to minimize.
[2023-03-21 20:06:43] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2023-03-21 20:06:44] [INFO ] Deduced a trap composed of 7 places in 414 ms of which 1 ms to minimize.
[2023-03-21 20:06:45] [INFO ] Deduced a trap composed of 4 places in 1239 ms of which 1 ms to minimize.
[2023-03-21 20:06:46] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 13 ms to minimize.
[2023-03-21 20:06:46] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2023-03-21 20:06:46] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 0 ms to minimize.
[2023-03-21 20:06:47] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 0 ms to minimize.
[2023-03-21 20:06:47] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 1 ms to minimize.
[2023-03-21 20:06:47] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2023-03-21 20:06:48] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 1 ms to minimize.
[2023-03-21 20:06:48] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 1 ms to minimize.
[2023-03-21 20:06:48] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2023-03-21 20:06:49] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 10 ms to minimize.
[2023-03-21 20:06:49] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 1 ms to minimize.
[2023-03-21 20:06:49] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 1 ms to minimize.
[2023-03-21 20:06:49] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 0 ms to minimize.
[2023-03-21 20:06:50] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2023-03-21 20:06:50] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 0 ms to minimize.
[2023-03-21 20:06:50] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-21 20:06:51] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2023-03-21 20:06:51] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 0 ms to minimize.
[2023-03-21 20:06:51] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2023-03-21 20:06:52] [INFO ] Deduced a trap composed of 14 places in 394 ms of which 0 ms to minimize.
[2023-03-21 20:06:52] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 1 ms to minimize.
[2023-03-21 20:06:53] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 0 ms to minimize.
[2023-03-21 20:06:53] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-21 20:06:54] [INFO ] Deduced a trap composed of 10 places in 457 ms of which 1 ms to minimize.
[2023-03-21 20:06:54] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 0 ms to minimize.
[2023-03-21 20:06:54] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 0 ms to minimize.
[2023-03-21 20:06:55] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 1 ms to minimize.
[2023-03-21 20:06:55] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2023-03-21 20:06:55] [INFO ] Deduced a trap composed of 8 places in 376 ms of which 1 ms to minimize.
[2023-03-21 20:06:56] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 1 ms to minimize.
[2023-03-21 20:06:56] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 0 ms to minimize.
[2023-03-21 20:06:57] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 0 ms to minimize.
[2023-03-21 20:06:57] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 14720 ms
[2023-03-21 20:06:57] [INFO ] After 60706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 726 ms.
[2023-03-21 20:06:57] [INFO ] After 62017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-21 20:06:57] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 31 ms.
[2023-03-21 20:06:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1366 places, 1316 transitions and 5993 arcs took 7 ms.
[2023-03-21 20:06:58] [INFO ] Flatten gal took : 194 ms
Total runtime 188580 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/1428/inv_0_ --invariant=/tmp/1428/inv_1_ --invariant=/tmp/1428/inv_2_ --invariant=/tmp/1428/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 14973068 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097924 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="ShieldIIPs-PT-050B"
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-050B, 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-167903716700159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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