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.r389-oct2-167903713200126.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 itstools
Input is ShieldIIPs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713200126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679175468584

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-18 21:37:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:37:51] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-18 21:37:51] [INFO ] Transformed 1803 places.
[2023-03-18 21:37:51] [INFO ] Transformed 1773 transitions.
[2023-03-18 21:37:51] [INFO ] Found NUPN structural information;
[2023-03-18 21:37:51] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:37:52] [INFO ] Flatten gal took : 208 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 12) seen :8
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-18 21:37:52] [INFO ] Flatten gal took : 125 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
[2023-03-18 21:37:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality945850532685476589.gal : 47 ms
[2023-03-18 21:37:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4930348874438391196.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality945850532685476589.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4930348874438391196.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
// Phase 1: matrix 1773 rows 1803 cols
[2023-03-18 21:37:52] [INFO ] Computed 271 place invariants in 25 ms
Loading property file /tmp/ReachabilityCardinality4930348874438391196.prop.
[2023-03-18 21:37:53] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:37:53] [INFO ] [Nat]Absence check using 271 positive place invariants in 77 ms returned sat
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :36 after 212
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :212 after 484
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :484 after 18173
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :18173 after 1.45699e+08
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :1.45699e+08 after 5.81902e+13
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :5.81902e+13 after 1.21008e+30
[2023-03-18 21:37:55] [INFO ] After 1660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:37:58] [INFO ] Deduced a trap composed of 18 places in 2179 ms of which 33 ms to minimize.
[2023-03-18 21:38:00] [INFO ] Deduced a trap composed of 18 places in 1442 ms of which 2 ms to minimize.
[2023-03-18 21:38:01] [INFO ] Deduced a trap composed of 27 places in 944 ms of which 3 ms to minimize.
[2023-03-18 21:38:01] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 2 ms to minimize.
[2023-03-18 21:38:02] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 1 ms to minimize.
[2023-03-18 21:38:02] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:38:03] [INFO ] Deduced a trap composed of 18 places in 370 ms of which 1 ms to minimize.
[2023-03-18 21:38:03] [INFO ] Deduced a trap composed of 34 places in 454 ms of which 3 ms to minimize.
[2023-03-18 21:38:04] [INFO ] Deduced a trap composed of 20 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:38:04] [INFO ] Deduced a trap composed of 23 places in 385 ms of which 2 ms to minimize.
[2023-03-18 21:38:05] [INFO ] Deduced a trap composed of 30 places in 372 ms of which 1 ms to minimize.
[2023-03-18 21:38:05] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 1 ms to minimize.
[2023-03-18 21:38:06] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 1 ms to minimize.
[2023-03-18 21:38:06] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 1 ms to minimize.
[2023-03-18 21:38:07] [INFO ] Deduced a trap composed of 34 places in 432 ms of which 1 ms to minimize.
[2023-03-18 21:38:07] [INFO ] Deduced a trap composed of 22 places in 388 ms of which 1 ms to minimize.
[2023-03-18 21:38:08] [INFO ] Deduced a trap composed of 41 places in 396 ms of which 1 ms to minimize.
[2023-03-18 21:38:08] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 2 ms to minimize.
[2023-03-18 21:38:09] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 1 ms to minimize.
[2023-03-18 21:38:09] [INFO ] Deduced a trap composed of 41 places in 463 ms of which 1 ms to minimize.
[2023-03-18 21:38:10] [INFO ] Deduced a trap composed of 26 places in 374 ms of which 1 ms to minimize.
[2023-03-18 21:38:10] [INFO ] Deduced a trap composed of 35 places in 354 ms of which 3 ms to minimize.
[2023-03-18 21:38:11] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:38:11] [INFO ] Deduced a trap composed of 37 places in 335 ms of which 1 ms to minimize.
[2023-03-18 21:38:11] [INFO ] Deduced a trap composed of 48 places in 362 ms of which 0 ms to minimize.
[2023-03-18 21:38:12] [INFO ] Deduced a trap composed of 37 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:38:12] [INFO ] Deduced a trap composed of 40 places in 376 ms of which 2 ms to minimize.
[2023-03-18 21:38:13] [INFO ] Deduced a trap composed of 40 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:38:13] [INFO ] Deduced a trap composed of 53 places in 445 ms of which 1 ms to minimize.
[2023-03-18 21:38:14] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 1 ms to minimize.
[2023-03-18 21:38:14] [INFO ] Deduced a trap composed of 20 places in 450 ms of which 1 ms to minimize.
[2023-03-18 21:38:15] [INFO ] Deduced a trap composed of 44 places in 445 ms of which 0 ms to minimize.
[2023-03-18 21:38:15] [INFO ] Deduced a trap composed of 35 places in 363 ms of which 1 ms to minimize.
[2023-03-18 21:38:16] [INFO ] Deduced a trap composed of 32 places in 496 ms of which 4 ms to minimize.
[2023-03-18 21:38:16] [INFO ] Deduced a trap composed of 36 places in 396 ms of which 1 ms to minimize.
[2023-03-18 21:38:17] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 1 ms to minimize.
[2023-03-18 21:38:17] [INFO ] Deduced a trap composed of 34 places in 420 ms of which 0 ms to minimize.
[2023-03-18 21:38:18] [INFO ] Deduced a trap composed of 60 places in 298 ms of which 1 ms to minimize.
[2023-03-18 21:38:18] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 1 ms to minimize.
[2023-03-18 21:38:18] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 22148 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:38:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:38:18] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 170 ms.
Support contains 51 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1803 transition count 1633
Reduce places removed 140 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 145 rules applied. Total rules applied 285 place count 1663 transition count 1628
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 290 place count 1658 transition count 1628
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 290 place count 1658 transition count 1478
Deduced a syphon composed of 150 places in 8 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 590 place count 1508 transition count 1478
Discarding 207 places :
Symmetric choice reduction at 3 with 207 rule applications. Total rules 797 place count 1301 transition count 1271
Iterating global reduction 3 with 207 rules applied. Total rules applied 1004 place count 1301 transition count 1271
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 1004 place count 1301 transition count 1186
Deduced a syphon composed of 85 places in 3 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 1174 place count 1216 transition count 1186
Performed 415 Post agglomeration using F-continuation condition.Transition count delta: 415
Deduced a syphon composed of 415 places in 3 ms
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 3 with 830 rules applied. Total rules applied 2004 place count 801 transition count 771
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 189 times.
Drop transitions removed 189 transitions
Iterating global reduction 3 with 189 rules applied. Total rules applied 2193 place count 801 transition count 771
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2194 place count 800 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2195 place count 799 transition count 770
Applied a total of 2195 rules in 517 ms. Remains 799 /1803 variables (removed 1004) and now considering 770/1773 (removed 1003) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 518 ms. Remains : 799/1803 places, 770/1773 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 770 rows 799 cols
[2023-03-18 21:38:19] [INFO ] Computed 270 place invariants in 27 ms
[2023-03-18 21:38:19] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:38:19] [INFO ] [Nat]Absence check using 264 positive place invariants in 70 ms returned sat
[2023-03-18 21:38:19] [INFO ] [Nat]Absence check using 264 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-18 21:38:20] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:38:20] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 3 ms to minimize.
[2023-03-18 21:38:21] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-18 21:38:21] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2023-03-18 21:38:21] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-18 21:38:21] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 1 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-18 21:38:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2306 ms
[2023-03-18 21:38:23] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 15 ms to minimize.
[2023-03-18 21:38:23] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2023-03-18 21:38:23] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-18 21:38:24] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2023-03-18 21:38:24] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 21 ms to minimize.
[2023-03-18 21:38:24] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-18 21:38:24] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 1 ms to minimize.
[2023-03-18 21:38:25] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:38:25] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2023-03-18 21:38:25] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-18 21:38:25] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-18 21:38:25] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2023-03-18 21:38:25] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2901 ms
[2023-03-18 21:38:25] [INFO ] After 6134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-18 21:38:26] [INFO ] After 6496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 33 out of 799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 799/799 places, 770/770 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 799 transition count 768
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 797 transition count 768
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 797 transition count 765
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 794 transition count 765
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 783 transition count 754
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 783 transition count 754
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 781 transition count 752
Applied a total of 41 rules in 264 ms. Remains 781 /799 variables (removed 18) and now considering 752/770 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 781/799 places, 752/770 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 752 rows 781 cols
[2023-03-18 21:38:26] [INFO ] Computed 270 place invariants in 12 ms
[2023-03-18 21:38:26] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:38:26] [INFO ] [Nat]Absence check using 268 positive place invariants in 31 ms returned sat
[2023-03-18 21:38:26] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 21:38:27] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:38:27] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2023-03-18 21:38:27] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2023-03-18 21:38:28] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-18 21:38:28] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 15 ms to minimize.
[2023-03-18 21:38:28] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-18 21:38:28] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-18 21:38:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 746 ms
[2023-03-18 21:38:28] [INFO ] After 1490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-18 21:38:28] [INFO ] After 1659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 752/752 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 781 transition count 751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 780 transition count 751
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 780 transition count 750
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 779 transition count 750
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 34 place count 764 transition count 735
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 764 transition count 735
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 758 transition count 729
Applied a total of 46 rules in 313 ms. Remains 758 /781 variables (removed 23) and now considering 729/752 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 758/781 places, 729/752 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 5388 steps, run visited all 1 properties in 64 ms. (steps per millisecond=84 )
Probabilistic random walk after 5388 steps, saw 5124 distinct states, run finished after 65 ms. (steps per millisecond=82 ) properties seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 37382 ms.

BK_STOP 1679175509422

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPs-PT-030B, 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 r389-oct2-167903713200126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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