Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800174.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:21 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 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 1.3M 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 ShieldRVs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679303003011

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:03:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 09:03:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:03:25] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2023-03-20 09:03:25] [INFO ] Transformed 4003 places.
[2023-03-20 09:03:25] [INFO ] Transformed 4503 transitions.
[2023-03-20 09:03:25] [INFO ] Found NUPN structural information;
[2023-03-20 09:03:25] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 683 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 11) seen :8
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 4503 rows 4003 cols
[2023-03-20 09:03:26] [INFO ] Computed 401 place invariants in 100 ms
[2023-03-20 09:03:28] [INFO ] After 1625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 09:03:29] [INFO ] [Nat]Absence check using 401 positive place invariants in 333 ms returned sat
[2023-03-20 09:03:41] [INFO ] After 11253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 09:03:43] [INFO ] Deduced a trap composed of 23 places in 1871 ms of which 8 ms to minimize.
[2023-03-20 09:03:46] [INFO ] Deduced a trap composed of 21 places in 2884 ms of which 5 ms to minimize.
[2023-03-20 09:03:48] [INFO ] Deduced a trap composed of 32 places in 1852 ms of which 4 ms to minimize.
[2023-03-20 09:03:50] [INFO ] Deduced a trap composed of 23 places in 1739 ms of which 17 ms to minimize.
[2023-03-20 09:03:53] [INFO ] Deduced a trap composed of 33 places in 2782 ms of which 6 ms to minimize.
[2023-03-20 09:03:56] [INFO ] Deduced a trap composed of 49 places in 3214 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 09:03:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:03:56] [INFO ] After 27958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1180 ms.
Support contains 26 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 4003 transition count 4109
Reduce places removed 394 places and 0 transitions.
Iterating post reduction 1 with 394 rules applied. Total rules applied 788 place count 3609 transition count 4109
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 788 place count 3609 transition count 3612
Deduced a syphon composed of 497 places in 15 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1782 place count 3112 transition count 3612
Discarding 694 places :
Symmetric choice reduction at 2 with 694 rule applications. Total rules 2476 place count 2418 transition count 2918
Iterating global reduction 2 with 694 rules applied. Total rules applied 3170 place count 2418 transition count 2918
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 290 Pre rules applied. Total rules applied 3170 place count 2418 transition count 2628
Deduced a syphon composed of 290 places in 32 ms
Reduce places removed 290 places and 0 transitions.
Iterating global reduction 2 with 580 rules applied. Total rules applied 3750 place count 2128 transition count 2628
Performed 692 Post agglomeration using F-continuation condition.Transition count delta: 692
Deduced a syphon composed of 692 places in 7 ms
Reduce places removed 692 places and 0 transitions.
Iterating global reduction 2 with 1384 rules applied. Total rules applied 5134 place count 1436 transition count 1936
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 5335 place count 1436 transition count 1936
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5336 place count 1435 transition count 1935
Applied a total of 5336 rules in 2540 ms. Remains 1435 /4003 variables (removed 2568) and now considering 1935/4503 (removed 2568) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2545 ms. Remains : 1435/4003 places, 1935/4503 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1935 rows 1435 cols
[2023-03-20 09:04:00] [INFO ] Computed 401 place invariants in 32 ms
[2023-03-20 09:04:01] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:04:01] [INFO ] [Nat]Absence check using 401 positive place invariants in 91 ms returned sat
[2023-03-20 09:04:02] [INFO ] After 1062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:04:03] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 2 ms to minimize.
[2023-03-20 09:04:03] [INFO ] Deduced a trap composed of 15 places in 320 ms of which 1 ms to minimize.
[2023-03-20 09:04:04] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-20 09:04:04] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 1 ms to minimize.
[2023-03-20 09:04:04] [INFO ] Deduced a trap composed of 18 places in 362 ms of which 1 ms to minimize.
[2023-03-20 09:04:05] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 1 ms to minimize.
[2023-03-20 09:04:05] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 1 ms to minimize.
[2023-03-20 09:04:06] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 1 ms to minimize.
[2023-03-20 09:04:06] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 1 ms to minimize.
[2023-03-20 09:04:06] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 1 ms to minimize.
[2023-03-20 09:04:07] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 1 ms to minimize.
[2023-03-20 09:04:07] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 1 ms to minimize.
[2023-03-20 09:04:07] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 1 ms to minimize.
[2023-03-20 09:04:08] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2023-03-20 09:04:08] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-20 09:04:12] [INFO ] Deduced a trap composed of 8 places in 3375 ms of which 27 ms to minimize.
[2023-03-20 09:04:12] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 1 ms to minimize.
[2023-03-20 09:04:12] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 1 ms to minimize.
[2023-03-20 09:04:13] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 1 ms to minimize.
[2023-03-20 09:04:13] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 1 ms to minimize.
[2023-03-20 09:04:13] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 1 ms to minimize.
[2023-03-20 09:04:14] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 1 ms to minimize.
[2023-03-20 09:04:14] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2023-03-20 09:04:14] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 1 ms to minimize.
[2023-03-20 09:04:15] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-20 09:04:15] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-20 09:04:15] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-20 09:04:16] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 1 ms to minimize.
[2023-03-20 09:04:16] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2023-03-20 09:04:16] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 0 ms to minimize.
[2023-03-20 09:04:17] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 1 ms to minimize.
[2023-03-20 09:04:17] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2023-03-20 09:04:17] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 1 ms to minimize.
[2023-03-20 09:04:18] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 2 ms to minimize.
[2023-03-20 09:04:18] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 0 ms to minimize.
[2023-03-20 09:04:18] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2023-03-20 09:04:19] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2023-03-20 09:04:19] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-20 09:04:19] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2023-03-20 09:04:19] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2023-03-20 09:04:20] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2023-03-20 09:04:20] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2023-03-20 09:04:20] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 0 ms to minimize.
[2023-03-20 09:04:21] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 0 ms to minimize.
[2023-03-20 09:04:21] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2023-03-20 09:04:21] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 3 ms to minimize.
[2023-03-20 09:04:21] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2023-03-20 09:04:21] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 0 ms to minimize.
[2023-03-20 09:04:22] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2023-03-20 09:04:22] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2023-03-20 09:04:22] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2023-03-20 09:04:22] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-20 09:04:23] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-20 09:04:23] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2023-03-20 09:04:23] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2023-03-20 09:04:23] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 0 ms to minimize.
[2023-03-20 09:04:23] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 21020 ms
[2023-03-20 09:04:24] [INFO ] After 22521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-03-20 09:04:24] [INFO ] After 23239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 159 ms.
Support contains 25 out of 1435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1435/1435 places, 1935/1935 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1434 transition count 1934
Applied a total of 2 rules in 105 ms. Remains 1434 /1435 variables (removed 1) and now considering 1934/1935 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1434/1435 places, 1934/1935 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69574 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69574 steps, saw 48465 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1934 rows 1434 cols
[2023-03-20 09:04:28] [INFO ] Computed 401 place invariants in 5 ms
[2023-03-20 09:04:28] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:04:28] [INFO ] [Nat]Absence check using 401 positive place invariants in 81 ms returned sat
[2023-03-20 09:04:32] [INFO ] After 3283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:04:32] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 2 ms to minimize.
[2023-03-20 09:04:33] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 3 ms to minimize.
[2023-03-20 09:04:33] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 1 ms to minimize.
[2023-03-20 09:04:34] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 0 ms to minimize.
[2023-03-20 09:04:34] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 2 ms to minimize.
[2023-03-20 09:04:34] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 2 ms to minimize.
[2023-03-20 09:04:35] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 0 ms to minimize.
[2023-03-20 09:04:35] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 2 ms to minimize.
[2023-03-20 09:04:35] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 1 ms to minimize.
[2023-03-20 09:04:36] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 0 ms to minimize.
[2023-03-20 09:04:36] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 1 ms to minimize.
[2023-03-20 09:04:36] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 2 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 0 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-20 09:04:38] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-20 09:04:38] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 1 ms to minimize.
[2023-03-20 09:04:43] [INFO ] Deduced a trap composed of 13 places in 5177 ms of which 29 ms to minimize.
[2023-03-20 09:04:44] [INFO ] Deduced a trap composed of 8 places in 284 ms of which 2 ms to minimize.
[2023-03-20 09:04:44] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 0 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 12 places in 352 ms of which 1 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 0 ms to minimize.
[2023-03-20 09:04:46] [INFO ] Deduced a trap composed of 16 places in 357 ms of which 1 ms to minimize.
[2023-03-20 09:04:46] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-20 09:04:46] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2023-03-20 09:04:47] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2023-03-20 09:04:47] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 1 ms to minimize.
[2023-03-20 09:04:48] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 1 ms to minimize.
[2023-03-20 09:04:48] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 1 ms to minimize.
[2023-03-20 09:04:48] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 1 ms to minimize.
[2023-03-20 09:04:49] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2023-03-20 09:04:49] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 1 ms to minimize.
[2023-03-20 09:04:49] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 1 ms to minimize.
[2023-03-20 09:04:50] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 1 ms to minimize.
[2023-03-20 09:04:50] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 1 ms to minimize.
[2023-03-20 09:04:50] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 1 ms to minimize.
[2023-03-20 09:04:51] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 1 ms to minimize.
[2023-03-20 09:04:51] [INFO ] Deduced a trap composed of 16 places in 297 ms of which 1 ms to minimize.
[2023-03-20 09:04:51] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 1 ms to minimize.
[2023-03-20 09:04:52] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 1 ms to minimize.
[2023-03-20 09:04:52] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 1 ms to minimize.
[2023-03-20 09:04:52] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 0 ms to minimize.
[2023-03-20 09:04:53] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 1 ms to minimize.
[2023-03-20 09:04:53] [INFO ] Deduced a trap composed of 16 places in 214 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-20 09:04:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:04:53] [INFO ] After 25161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 173 ms.
Support contains 25 out of 1434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 94 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 1434/1434 places, 1934/1934 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 86 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
[2023-03-20 09:04:54] [INFO ] Invariant cache hit.
[2023-03-20 09:04:54] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-20 09:04:54] [INFO ] Invariant cache hit.
[2023-03-20 09:04:57] [INFO ] Implicit Places using invariants and state equation in 2354 ms returned []
Implicit Place search using SMT with State Equation took 3353 ms to find 0 implicit places.
[2023-03-20 09:04:57] [INFO ] Redundant transitions in 501 ms returned []
[2023-03-20 09:04:57] [INFO ] Invariant cache hit.
[2023-03-20 09:04:59] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5532 ms. Remains : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 93 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 09:04:59] [INFO ] Invariant cache hit.
[2023-03-20 09:04:59] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:05:00] [INFO ] [Nat]Absence check using 401 positive place invariants in 75 ms returned sat
[2023-03-20 09:05:01] [INFO ] After 1064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:05:13] [INFO ] Deduced a trap composed of 11 places in 12163 ms of which 26 ms to minimize.
[2023-03-20 09:05:14] [INFO ] Deduced a trap composed of 10 places in 510 ms of which 1 ms to minimize.
[2023-03-20 09:05:15] [INFO ] Deduced a trap composed of 6 places in 427 ms of which 1 ms to minimize.
[2023-03-20 09:05:17] [INFO ] Deduced a trap composed of 11 places in 2063 ms of which 26 ms to minimize.
[2023-03-20 09:05:17] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 0 ms to minimize.
[2023-03-20 09:05:18] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 0 ms to minimize.
[2023-03-20 09:05:18] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 1 ms to minimize.
[2023-03-20 09:05:18] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 0 ms to minimize.
[2023-03-20 09:05:19] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 1 ms to minimize.
[2023-03-20 09:05:19] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 1 ms to minimize.
[2023-03-20 09:05:20] [INFO ] Deduced a trap composed of 12 places in 408 ms of which 1 ms to minimize.
[2023-03-20 09:05:20] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 0 ms to minimize.
[2023-03-20 09:05:21] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 1 ms to minimize.
[2023-03-20 09:05:21] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 0 ms to minimize.
[2023-03-20 09:05:21] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-20 09:05:28] [INFO ] Deduced a trap composed of 15 places in 6450 ms of which 1 ms to minimize.
[2023-03-20 09:05:28] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 1 ms to minimize.
[2023-03-20 09:05:29] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 1 ms to minimize.
[2023-03-20 09:05:29] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 1 ms to minimize.
[2023-03-20 09:05:29] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2023-03-20 09:05:30] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 1 ms to minimize.
[2023-03-20 09:05:30] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 1 ms to minimize.
[2023-03-20 09:05:31] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 1 ms to minimize.
[2023-03-20 09:05:31] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2023-03-20 09:05:31] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-20 09:05:32] [INFO ] Deduced a trap composed of 8 places in 341 ms of which 1 ms to minimize.
[2023-03-20 09:05:32] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 1 ms to minimize.
[2023-03-20 09:05:33] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 1 ms to minimize.
[2023-03-20 09:05:33] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 0 ms to minimize.
[2023-03-20 09:05:33] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-20 09:05:34] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2023-03-20 09:05:34] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-20 09:05:34] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 1 ms to minimize.
[2023-03-20 09:05:35] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 14 ms to minimize.
[2023-03-20 09:05:35] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 0 ms to minimize.
[2023-03-20 09:05:35] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 0 ms to minimize.
[2023-03-20 09:05:36] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2023-03-20 09:05:36] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2023-03-20 09:05:36] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 1 ms to minimize.
[2023-03-20 09:05:37] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2023-03-20 09:05:37] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 1 ms to minimize.
[2023-03-20 09:05:37] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 1 ms to minimize.
[2023-03-20 09:05:37] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 0 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 0 ms to minimize.
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
[2023-03-20 09:05:40] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2023-03-20 09:05:40] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 1 ms to minimize.
[2023-03-20 09:05:40] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2023-03-20 09:05:40] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-20 09:05:41] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2023-03-20 09:05:41] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2023-03-20 09:05:41] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2023-03-20 09:05:42] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 0 ms to minimize.
[2023-03-20 09:05:42] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 1 ms to minimize.
[2023-03-20 09:05:42] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 1 ms to minimize.
[2023-03-20 09:05:42] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2023-03-20 09:05:43] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2023-03-20 09:05:43] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2023-03-20 09:05:43] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2023-03-20 09:05:43] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2023-03-20 09:05:44] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 0 ms to minimize.
[2023-03-20 09:05:44] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 0 ms to minimize.
[2023-03-20 09:05:44] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2023-03-20 09:05:44] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2023-03-20 09:05:45] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2023-03-20 09:05:45] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 1 ms to minimize.
[2023-03-20 09:05:45] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2023-03-20 09:05:45] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2023-03-20 09:05:45] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2023-03-20 09:05:47] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2023-03-20 09:05:47] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2023-03-20 09:05:47] [INFO ] Trap strengthening (SAT) tested/added 81/80 trap constraints in 45643 ms
[2023-03-20 09:05:47] [INFO ] After 47222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 311 ms.
[2023-03-20 09:05:47] [INFO ] After 47885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 09:05:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-20 09:05:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1434 places, 1934 transitions and 9538 arcs took 18 ms.
[2023-03-20 09:05:48] [INFO ] Flatten gal took : 234 ms
Total runtime 143327 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 --invariant=/tmp/1084/inv_0_ --invariant=/tmp/1084/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11264812 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097456 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 ReachabilityCardinality -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="ShieldRVs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldRVs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977800174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100B.tgz
mv ShieldRVs-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;