fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r393-oct2-167903717100511
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldPPPs-PT-050B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5126.911 3600000.00 14074609.00 55.50 TFTFFFTF?TTTTTFT normal

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-167903717100511.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679456654216

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:44:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 03:44:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:44:16] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-22 03:44:17] [INFO ] Transformed 3403 places.
[2023-03-22 03:44:17] [INFO ] Transformed 3153 transitions.
[2023-03-22 03:44:17] [INFO ] Found NUPN structural information;
[2023-03-22 03:44:17] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 388 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 529 ms. (steps per millisecond=18 ) properties (out of 16) seen :6
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-22 03:44:18] [INFO ] Computed 551 place invariants in 31 ms
[2023-03-22 03:44:19] [INFO ] After 1425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 03:44:21] [INFO ] [Nat]Absence check using 551 positive place invariants in 360 ms returned sat
[2023-03-22 03:44:27] [INFO ] After 5098ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 03:44:29] [INFO ] Deduced a trap composed of 26 places in 1392 ms of which 21 ms to minimize.
[2023-03-22 03:44:31] [INFO ] Deduced a trap composed of 22 places in 1747 ms of which 3 ms to minimize.
[2023-03-22 03:44:35] [INFO ] Deduced a trap composed of 11 places in 4709 ms of which 10 ms to minimize.
[2023-03-22 03:44:37] [INFO ] Deduced a trap composed of 14 places in 1058 ms of which 23 ms to minimize.
[2023-03-22 03:44:38] [INFO ] Deduced a trap composed of 20 places in 1146 ms of which 15 ms to minimize.
[2023-03-22 03:44:39] [INFO ] Deduced a trap composed of 22 places in 1159 ms of which 2 ms to minimize.
[2023-03-22 03:44:41] [INFO ] Deduced a trap composed of 35 places in 1132 ms of which 27 ms to minimize.
[2023-03-22 03:44:42] [INFO ] Deduced a trap composed of 30 places in 1024 ms of which 2 ms to minimize.
[2023-03-22 03:44:43] [INFO ] Deduced a trap composed of 28 places in 935 ms of which 2 ms to minimize.
[2023-03-22 03:44:44] [INFO ] Deduced a trap composed of 18 places in 1069 ms of which 3 ms to minimize.
[2023-03-22 03:44:45] [INFO ] Deduced a trap composed of 25 places in 1037 ms of which 27 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:44:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:44:45] [INFO ] After 25945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 1463 ms.
Support contains 124 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 3403 transition count 2831
Reduce places removed 322 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 328 rules applied. Total rules applied 650 place count 3081 transition count 2825
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 656 place count 3075 transition count 2825
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 656 place count 3075 transition count 2578
Deduced a syphon composed of 247 places in 7 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 1150 place count 2828 transition count 2578
Discarding 333 places :
Symmetric choice reduction at 3 with 333 rule applications. Total rules 1483 place count 2495 transition count 2245
Iterating global reduction 3 with 333 rules applied. Total rules applied 1816 place count 2495 transition count 2245
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 1816 place count 2495 transition count 2119
Deduced a syphon composed of 126 places in 18 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 2068 place count 2369 transition count 2119
Performed 688 Post agglomeration using F-continuation condition.Transition count delta: 688
Deduced a syphon composed of 688 places in 6 ms
Reduce places removed 688 places and 0 transitions.
Iterating global reduction 3 with 1376 rules applied. Total rules applied 3444 place count 1681 transition count 1431
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 413 times.
Drop transitions removed 413 transitions
Iterating global reduction 3 with 413 rules applied. Total rules applied 3857 place count 1681 transition count 1431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3858 place count 1680 transition count 1430
Applied a total of 3858 rules in 1302 ms. Remains 1680 /3403 variables (removed 1723) and now considering 1430/3153 (removed 1723) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1302 ms. Remains : 1680/3403 places, 1430/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 10) seen :7
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1430 rows 1680 cols
[2023-03-22 03:44:49] [INFO ] Computed 551 place invariants in 40 ms
[2023-03-22 03:44:49] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 03:44:49] [INFO ] [Nat]Absence check using 531 positive place invariants in 110 ms returned sat
[2023-03-22 03:44:49] [INFO ] [Nat]Absence check using 531 positive and 20 generalized place invariants in 40 ms returned sat
[2023-03-22 03:44:50] [INFO ] After 1123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 03:44:52] [INFO ] Deduced a trap composed of 14 places in 1254 ms of which 2 ms to minimize.
[2023-03-22 03:44:53] [INFO ] Deduced a trap composed of 6 places in 835 ms of which 1 ms to minimize.
[2023-03-22 03:44:53] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 1 ms to minimize.
[2023-03-22 03:44:54] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 0 ms to minimize.
[2023-03-22 03:44:54] [INFO ] Deduced a trap composed of 8 places in 323 ms of which 1 ms to minimize.
[2023-03-22 03:44:54] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 1 ms to minimize.
[2023-03-22 03:45:02] [INFO ] Deduced a trap composed of 6 places in 7780 ms of which 4 ms to minimize.
[2023-03-22 03:45:03] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 0 ms to minimize.
[2023-03-22 03:45:03] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-22 03:45:03] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 1 ms to minimize.
[2023-03-22 03:45:04] [INFO ] Deduced a trap composed of 5 places in 476 ms of which 0 ms to minimize.
[2023-03-22 03:45:04] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 1 ms to minimize.
[2023-03-22 03:45:05] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 0 ms to minimize.
[2023-03-22 03:45:05] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2023-03-22 03:45:06] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2023-03-22 03:45:06] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2023-03-22 03:45:07] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 1 ms to minimize.
[2023-03-22 03:45:07] [INFO ] Deduced a trap composed of 8 places in 326 ms of which 1 ms to minimize.
[2023-03-22 03:45:07] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 0 ms to minimize.
[2023-03-22 03:45:08] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-22 03:45:08] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2023-03-22 03:45:08] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 0 ms to minimize.
[2023-03-22 03:45:09] [INFO ] Deduced a trap composed of 6 places in 400 ms of which 1 ms to minimize.
[2023-03-22 03:45:09] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 0 ms to minimize.
[2023-03-22 03:45:10] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-22 03:45:10] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 2 ms to minimize.
[2023-03-22 03:45:11] [INFO ] Deduced a trap composed of 9 places in 426 ms of which 0 ms to minimize.
[2023-03-22 03:45:11] [INFO ] Deduced a trap composed of 11 places in 366 ms of which 16 ms to minimize.
[2023-03-22 03:45:11] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 0 ms to minimize.
[2023-03-22 03:45:14] [INFO ] Deduced a trap composed of 24 places in 2501 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:45:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:45:14] [INFO ] After 25114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 95 ms.
Support contains 84 out of 1680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1680/1680 places, 1430/1430 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1680 transition count 1423
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1673 transition count 1423
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 1673 transition count 1416
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 1666 transition count 1416
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 84 place count 1638 transition count 1388
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 1638 transition count 1388
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 1635 transition count 1385
Applied a total of 93 rules in 532 ms. Remains 1635 /1680 variables (removed 45) and now considering 1385/1430 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 1635/1680 places, 1385/1430 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) 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 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 146079 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 146079 steps, saw 140721 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :2
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1385 rows 1635 cols
[2023-03-22 03:45:18] [INFO ] Computed 551 place invariants in 48 ms
[2023-03-22 03:45:18] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:45:19] [INFO ] [Nat]Absence check using 527 positive place invariants in 104 ms returned sat
[2023-03-22 03:45:19] [INFO ] [Nat]Absence check using 527 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-22 03:45:20] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:45:20] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2023-03-22 03:45:20] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 13 ms to minimize.
[2023-03-22 03:45:21] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-22 03:45:21] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2023-03-22 03:45:22] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 3 ms to minimize.
[2023-03-22 03:45:22] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2023-03-22 03:45:22] [INFO ] Deduced a trap composed of 6 places in 364 ms of which 2 ms to minimize.
[2023-03-22 03:45:23] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 2 ms to minimize.
[2023-03-22 03:45:23] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 0 ms to minimize.
[2023-03-22 03:45:25] [INFO ] Deduced a trap composed of 6 places in 1532 ms of which 1 ms to minimize.
[2023-03-22 03:45:25] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 1 ms to minimize.
[2023-03-22 03:45:25] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-22 03:45:26] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-22 03:45:26] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2023-03-22 03:45:26] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 20 ms to minimize.
[2023-03-22 03:45:27] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2023-03-22 03:45:27] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 0 ms to minimize.
[2023-03-22 03:45:27] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 1 ms to minimize.
[2023-03-22 03:45:28] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-22 03:45:28] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-22 03:45:28] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2023-03-22 03:45:29] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2023-03-22 03:45:29] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2023-03-22 03:45:30] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2023-03-22 03:45:30] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2023-03-22 03:45:30] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 0 ms to minimize.
[2023-03-22 03:45:30] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 4 ms to minimize.
[2023-03-22 03:45:31] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 3 ms to minimize.
[2023-03-22 03:45:31] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-22 03:45:32] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 0 ms to minimize.
[2023-03-22 03:45:32] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-22 03:45:32] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 1 ms to minimize.
[2023-03-22 03:45:32] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-22 03:45:32] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 12644 ms
[2023-03-22 03:45:33] [INFO ] After 13738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-22 03:45:33] [INFO ] After 14340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 35 out of 1635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1635/1635 places, 1385/1385 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1635 transition count 1380
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1630 transition count 1380
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 1630 transition count 1374
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 1624 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1623 transition count 1373
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 1623 transition count 1373
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 72 place count 1599 transition count 1349
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 1599 transition count 1349
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 1592 transition count 1342
Applied a total of 89 rules in 302 ms. Remains 1592 /1635 variables (removed 43) and now considering 1342/1385 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 1592/1635 places, 1342/1385 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 164854 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164854 steps, saw 148474 distinct states, run finished after 3003 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1342 rows 1592 cols
[2023-03-22 03:45:36] [INFO ] Computed 551 place invariants in 19 ms
[2023-03-22 03:45:37] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:45:37] [INFO ] [Nat]Absence check using 525 positive place invariants in 95 ms returned sat
[2023-03-22 03:45:37] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-22 03:45:38] [INFO ] After 807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:45:38] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2023-03-22 03:45:39] [INFO ] Deduced a trap composed of 6 places in 406 ms of which 1 ms to minimize.
[2023-03-22 03:45:39] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-22 03:45:39] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-22 03:45:40] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 1 ms to minimize.
[2023-03-22 03:45:41] [INFO ] Deduced a trap composed of 4 places in 1021 ms of which 1 ms to minimize.
[2023-03-22 03:45:41] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2023-03-22 03:45:42] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 0 ms to minimize.
[2023-03-22 03:45:42] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2023-03-22 03:45:42] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 1 ms to minimize.
[2023-03-22 03:45:43] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2023-03-22 03:45:43] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2023-03-22 03:45:43] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 1 ms to minimize.
[2023-03-22 03:45:44] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-22 03:45:44] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-22 03:45:44] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-22 03:45:45] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2023-03-22 03:45:45] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 2 ms to minimize.
[2023-03-22 03:45:46] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-22 03:45:46] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 2 ms to minimize.
[2023-03-22 03:45:46] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-22 03:45:47] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 0 ms to minimize.
[2023-03-22 03:45:47] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 1 ms to minimize.
[2023-03-22 03:45:47] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2023-03-22 03:45:48] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 1 ms to minimize.
[2023-03-22 03:45:48] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2023-03-22 03:45:49] [INFO ] Deduced a trap composed of 6 places in 431 ms of which 1 ms to minimize.
[2023-03-22 03:45:49] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2023-03-22 03:45:49] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 0 ms to minimize.
[2023-03-22 03:45:50] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2023-03-22 03:45:50] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 0 ms to minimize.
[2023-03-22 03:45:50] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 1 ms to minimize.
[2023-03-22 03:45:51] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 0 ms to minimize.
[2023-03-22 03:45:51] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 0 ms to minimize.
[2023-03-22 03:45:51] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 2 ms to minimize.
[2023-03-22 03:45:52] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 1 ms to minimize.
[2023-03-22 03:45:52] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2023-03-22 03:45:53] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 0 ms to minimize.
[2023-03-22 03:45:53] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-22 03:45:54] [INFO ] Deduced a trap composed of 9 places in 623 ms of which 1 ms to minimize.
[2023-03-22 03:45:54] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2023-03-22 03:45:54] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-22 03:45:55] [INFO ] Deduced a trap composed of 6 places in 445 ms of which 1 ms to minimize.
[2023-03-22 03:45:55] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2023-03-22 03:45:56] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-22 03:45:56] [INFO ] Deduced a trap composed of 6 places in 420 ms of which 0 ms to minimize.
[2023-03-22 03:45:57] [INFO ] Deduced a trap composed of 10 places in 469 ms of which 1 ms to minimize.
[2023-03-22 03:45:57] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-22 03:45:58] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 0 ms to minimize.
[2023-03-22 03:45:58] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-22 03:45:58] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-22 03:45:59] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2023-03-22 03:45:59] [INFO ] Deduced a trap composed of 10 places in 465 ms of which 1 ms to minimize.
[2023-03-22 03:45:59] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2023-03-22 03:46:00] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-22 03:46:00] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 0 ms to minimize.
[2023-03-22 03:46:01] [INFO ] Deduced a trap composed of 8 places in 525 ms of which 0 ms to minimize.
[2023-03-22 03:46:01] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 0 ms to minimize.
[2023-03-22 03:46:01] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 1 ms to minimize.
[2023-03-22 03:46:02] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:46:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:46:02] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 17 ms.
Support contains 35 out of 1592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1592/1592 places, 1342/1342 transitions.
Applied a total of 0 rules in 61 ms. Remains 1592 /1592 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1592/1592 places, 1342/1342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1592/1592 places, 1342/1342 transitions.
Applied a total of 0 rules in 54 ms. Remains 1592 /1592 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
[2023-03-22 03:46:02] [INFO ] Invariant cache hit.
[2023-03-22 03:46:03] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2023-03-22 03:46:03] [INFO ] Invariant cache hit.
[2023-03-22 03:46:06] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 3891 ms to find 0 implicit places.
[2023-03-22 03:46:06] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-22 03:46:06] [INFO ] Invariant cache hit.
[2023-03-22 03:46:07] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5120 ms. Remains : 1592/1592 places, 1342/1342 transitions.
Applied a total of 0 rules in 85 ms. Remains 1592 /1592 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 03:46:07] [INFO ] Invariant cache hit.
[2023-03-22 03:46:07] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:46:08] [INFO ] [Nat]Absence check using 525 positive place invariants in 132 ms returned sat
[2023-03-22 03:46:08] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-22 03:46:09] [INFO ] After 891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:46:09] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2023-03-22 03:46:09] [INFO ] Deduced a trap composed of 8 places in 410 ms of which 1 ms to minimize.
[2023-03-22 03:46:10] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 1 ms to minimize.
[2023-03-22 03:46:10] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-22 03:46:11] [INFO ] Deduced a trap composed of 6 places in 388 ms of which 1 ms to minimize.
[2023-03-22 03:46:11] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2023-03-22 03:46:11] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 1 ms to minimize.
[2023-03-22 03:46:12] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-22 03:46:12] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-22 03:46:12] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-22 03:46:13] [INFO ] Deduced a trap composed of 9 places in 357 ms of which 1 ms to minimize.
[2023-03-22 03:46:13] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 0 ms to minimize.
[2023-03-22 03:46:13] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
[2023-03-22 03:46:14] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-22 03:46:14] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 0 ms to minimize.
[2023-03-22 03:46:14] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 0 ms to minimize.
[2023-03-22 03:46:15] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2023-03-22 03:46:15] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2023-03-22 03:46:15] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2023-03-22 03:46:15] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-22 03:46:16] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2023-03-22 03:46:16] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2023-03-22 03:46:16] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2023-03-22 03:46:16] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2023-03-22 03:46:17] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2023-03-22 03:46:17] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 1 ms to minimize.
[2023-03-22 03:46:17] [INFO ] Deduced a trap composed of 8 places in 327 ms of which 1 ms to minimize.
[2023-03-22 03:46:18] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-22 03:46:18] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2023-03-22 03:46:18] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2023-03-22 03:46:19] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 0 ms to minimize.
[2023-03-22 03:46:19] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
[2023-03-22 03:46:19] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-22 03:46:19] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2023-03-22 03:46:20] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2023-03-22 03:46:20] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 11176 ms
[2023-03-22 03:46:20] [INFO ] After 12213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-22 03:46:20] [INFO ] After 12823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 03:46:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 22 ms.
[2023-03-22 03:46:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1592 places, 1342 transitions and 5870 arcs took 8 ms.
[2023-03-22 03:46:20] [INFO ] Flatten gal took : 163 ms
Total runtime 124315 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/1045/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11014832 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095352 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-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 ShieldPPPs-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-167903717100511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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