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-167903713100110.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-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713100110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 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 332K 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-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679171908855

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-020B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-18 20:38:31] [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 20:38:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:38:31] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-18 20:38:31] [INFO ] Transformed 1203 places.
[2023-03-18 20:38:31] [INFO ] Transformed 1183 transitions.
[2023-03-18 20:38:31] [INFO ] Found NUPN structural information;
[2023-03-18 20:38:31] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:38:31] [INFO ] Flatten gal took : 154 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 15) seen :10
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
[2023-03-18 20:38:31] [INFO ] Flatten gal took : 116 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
[2023-03-18 20:38:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17811862071707506766.gal : 44 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
[2023-03-18 20:38:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality255665664823645955.prop : 1 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/ReachabilityCardinality17811862071707506766.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality255665664823645955.prop' '--nowitness' '--gen-order' 'FOLLOW'
Running SMT prover for 5 properties.
// Phase 1: matrix 1183 rows 1203 cols

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 ...328
[2023-03-18 20:38:32] [INFO ] Computed 181 place invariants in 31 ms
Loading property file /tmp/ReachabilityCardinality255665664823645955.prop.
[2023-03-18 20:38:32] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :36 after 374
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :374 after 486
Reachability property ShieldIIPs-PT-020B-ReachabilityCardinality-02 is true.
SDD proceeding with computation,14 properties remain. new max is 128
[2023-03-18 20:38:32] [INFO ] [Nat]Absence check using 181 positive place invariants in 48 ms returned sat
SDD size :486 after 18163
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :18163 after 320941
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :320941 after 3.30589e+10
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :3.30589e+10 after 3.24702e+16
[2023-03-18 20:38:33] [INFO ] After 941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:38:34] [INFO ] Deduced a trap composed of 32 places in 472 ms of which 7 ms to minimize.
[2023-03-18 20:38:35] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 2 ms to minimize.
[2023-03-18 20:38:35] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 2 ms to minimize.
[2023-03-18 20:38:35] [INFO ] Deduced a trap composed of 16 places in 332 ms of which 2 ms to minimize.
[2023-03-18 20:38:36] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 1 ms to minimize.
[2023-03-18 20:38:36] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 1 ms to minimize.
[2023-03-18 20:38:36] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 2 ms to minimize.
[2023-03-18 20:38:37] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:38:37] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2023-03-18 20:38:37] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2023-03-18 20:38:38] [INFO ] Deduced a trap composed of 29 places in 336 ms of which 1 ms to minimize.
[2023-03-18 20:38:38] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 6 ms to minimize.
[2023-03-18 20:38:38] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 1 ms to minimize.
[2023-03-18 20:38:39] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 1 ms to minimize.
[2023-03-18 20:38:39] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 1 ms to minimize.
[2023-03-18 20:38:39] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 0 ms to minimize.
[2023-03-18 20:38:40] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 1 ms to minimize.
[2023-03-18 20:38:40] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 1 ms to minimize.
[2023-03-18 20:38:40] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 1 ms to minimize.
[2023-03-18 20:38:40] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:38:41] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 0 ms to minimize.
[2023-03-18 20:38:41] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:38:41] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 1 ms to minimize.
[2023-03-18 20:38:42] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 1 ms to minimize.
[2023-03-18 20:38:42] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 0 ms to minimize.
[2023-03-18 20:38:42] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 1 ms to minimize.
[2023-03-18 20:38:42] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 1 ms to minimize.
[2023-03-18 20:38:43] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 0 ms to minimize.
[2023-03-18 20:38:43] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 1 ms to minimize.
[2023-03-18 20:38:43] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2023-03-18 20:38:43] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 1 ms to minimize.
[2023-03-18 20:38:44] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 5 ms to minimize.
[2023-03-18 20:38:44] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 15 ms to minimize.
[2023-03-18 20:38:44] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 2 ms to minimize.
[2023-03-18 20:38:45] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 1 ms to minimize.
[2023-03-18 20:38:45] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 0 ms to minimize.
[2023-03-18 20:38:45] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 0 ms to minimize.
[2023-03-18 20:38:45] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 1 ms to minimize.
[2023-03-18 20:38:46] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 1 ms to minimize.
[2023-03-18 20:38:46] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2023-03-18 20:38:49] [INFO ] Deduced a trap composed of 30 places in 2908 ms of which 22 ms to minimize.
[2023-03-18 20:38:50] [INFO ] Deduced a trap composed of 26 places in 1592 ms of which 1 ms to minimize.
[2023-03-18 20:38:51] [INFO ] Deduced a trap composed of 25 places in 545 ms of which 3 ms to minimize.
[2023-03-18 20:38:51] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 0 ms to minimize.
[2023-03-18 20:38:52] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 1 ms to minimize.
[2023-03-18 20:38:52] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 0 ms to minimize.
[2023-03-18 20:38:52] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 1 ms to minimize.
[2023-03-18 20:38:52] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2023-03-18 20:38:53] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 0 ms to minimize.
[2023-03-18 20:38:53] [INFO ] Deduced a trap composed of 26 places in 542 ms of which 1 ms to minimize.
[2023-03-18 20:38:54] [INFO ] Deduced a trap composed of 41 places in 477 ms of which 26 ms to minimize.
[2023-03-18 20:38:54] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2023-03-18 20:38:55] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 0 ms to minimize.
[2023-03-18 20:38:55] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 1 ms to minimize.
[2023-03-18 20:38:55] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 1 ms to minimize.
[2023-03-18 20:38:55] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 12 ms to minimize.
[2023-03-18 20:38:56] [INFO ] Deduced a trap composed of 46 places in 288 ms of which 1 ms to minimize.
[2023-03-18 20:38:57] [INFO ] Deduced a trap composed of 19 places in 520 ms of which 1 ms to minimize.
[2023-03-18 20:38:57] [INFO ] Deduced a trap composed of 15 places in 524 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-18 20:38:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:38:57] [INFO ] After 25225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 137 ms.
Support contains 38 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 1203 transition count 1091
Reduce places removed 92 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 95 rules applied. Total rules applied 187 place count 1111 transition count 1088
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 190 place count 1108 transition count 1088
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 190 place count 1108 transition count 989
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 388 place count 1009 transition count 989
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 517 place count 880 transition count 860
Iterating global reduction 3 with 129 rules applied. Total rules applied 646 place count 880 transition count 860
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 646 place count 880 transition count 810
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 746 place count 830 transition count 810
Performed 285 Post agglomeration using F-continuation condition.Transition count delta: 285
Deduced a syphon composed of 285 places in 2 ms
Reduce places removed 285 places and 0 transitions.
Iterating global reduction 3 with 570 rules applied. Total rules applied 1316 place count 545 transition count 525
Partial Free-agglomeration rule applied 133 times.
Drop transitions removed 133 transitions
Iterating global reduction 3 with 133 rules applied. Total rules applied 1449 place count 545 transition count 525
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1450 place count 544 transition count 524
Applied a total of 1450 rules in 329 ms. Remains 544 /1203 variables (removed 659) and now considering 524/1183 (removed 659) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 544/1203 places, 524/1183 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) 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 3) seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 524 rows 544 cols
[2023-03-18 20:38:58] [INFO ] Computed 181 place invariants in 11 ms
[2023-03-18 20:38:58] [INFO ] [Real]Absence check using 178 positive place invariants in 21 ms returned sat
[2023-03-18 20:38:58] [INFO ] [Real]Absence check using 178 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-18 20:38:58] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:38:58] [INFO ] [Nat]Absence check using 178 positive place invariants in 22 ms returned sat
[2023-03-18 20:38:58] [INFO ] [Nat]Absence check using 178 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:38:59] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:38:59] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 0 ms to minimize.
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 38 ms to minimize.
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-18 20:39:01] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 ms to minimize.
[2023-03-18 20:39:01] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-18 20:39:01] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2023-03-18 20:39:01] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-18 20:39:01] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-18 20:39:02] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2023-03-18 20:39:02] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-18 20:39:02] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2023-03-18 20:39:02] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-18 20:39:02] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-18 20:39:02] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-18 20:39:02] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-18 20:39:02] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-18 20:39:03] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-18 20:39:03] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 0 ms to minimize.
[2023-03-18 20:39:03] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-18 20:39:03] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2023-03-18 20:39:03] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 0 ms to minimize.
[2023-03-18 20:39:03] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2023-03-18 20:39:03] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-18 20:39:04] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-18 20:39:04] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2023-03-18 20:39:04] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-18 20:39:04] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4862 ms
[2023-03-18 20:39:04] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-18 20:39:04] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2023-03-18 20:39:04] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-18 20:39:04] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-18 20:39:05] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2023-03-18 20:39:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 771 ms
[2023-03-18 20:39:05] [INFO ] After 6327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-18 20:39:05] [INFO ] After 6528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 8 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 524/524 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 544 transition count 521
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 541 transition count 521
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 541 transition count 516
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 536 transition count 516
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 43 rules applied. Total rules applied 59 place count 514 transition count 495
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 514 transition count 495
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 508 transition count 489
Applied a total of 70 rules in 75 ms. Remains 508 /544 variables (removed 36) and now considering 489/524 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 508/544 places, 489/524 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 293334 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{1=1}
Probabilistic random walk after 293334 steps, saw 167311 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 489 rows 508 cols
[2023-03-18 20:39:08] [INFO ] Computed 180 place invariants in 27 ms
[2023-03-18 20:39:08] [INFO ] [Real]Absence check using 179 positive place invariants in 28 ms returned sat
[2023-03-18 20:39:08] [INFO ] [Real]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:39:09] [INFO ] After 993ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:39:09] [INFO ] [Nat]Absence check using 179 positive place invariants in 37 ms returned sat
[2023-03-18 20:39:09] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:39:10] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:39:10] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-18 20:39:10] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-18 20:39:10] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-18 20:39:10] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-18 20:39:11] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 0 ms to minimize.
[2023-03-18 20:39:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1010 ms
[2023-03-18 20:39:11] [INFO ] After 1515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 20:39:11] [INFO ] After 1705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 489/489 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 508 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 507 transition count 488
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 504 transition count 485
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 502 transition count 483
Applied a total of 10 rules in 41 ms. Remains 502 /508 variables (removed 6) and now considering 483/489 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 502/508 places, 483/489 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 352785 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352785 steps, saw 193706 distinct states, run finished after 3002 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 483 rows 502 cols
[2023-03-18 20:39:14] [INFO ] Computed 180 place invariants in 12 ms
[2023-03-18 20:39:14] [INFO ] [Real]Absence check using 179 positive place invariants in 75 ms returned sat
[2023-03-18 20:39:14] [INFO ] [Real]Absence check using 179 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 20:39:14] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:39:15] [INFO ] [Nat]Absence check using 179 positive place invariants in 58 ms returned sat
[2023-03-18 20:39:15] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:39:15] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:39:15] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2023-03-18 20:39:15] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-18 20:39:15] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-18 20:39:15] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-18 20:39:15] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2023-03-18 20:39:15] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-18 20:39:15] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-18 20:39:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-18 20:39:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 683 ms
[2023-03-18 20:39:16] [INFO ] After 1027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-18 20:39:16] [INFO ] After 1253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 26 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 502/502 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 18 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2023-03-18 20:39:16] [INFO ] Invariant cache hit.
[2023-03-18 20:39:16] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-18 20:39:16] [INFO ] Invariant cache hit.
[2023-03-18 20:39:17] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2023-03-18 20:39:17] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-18 20:39:17] [INFO ] Invariant cache hit.
[2023-03-18 20:39:17] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1367 ms. Remains : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 20:39:17] [INFO ] Invariant cache hit.
[2023-03-18 20:39:17] [INFO ] [Real]Absence check using 179 positive place invariants in 19 ms returned sat
[2023-03-18 20:39:17] [INFO ] [Real]Absence check using 179 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 20:39:17] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:39:17] [INFO ] [Nat]Absence check using 179 positive place invariants in 46 ms returned sat
[2023-03-18 20:39:17] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:39:18] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:39:18] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2023-03-18 20:39:18] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-18 20:39:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2023-03-18 20:39:18] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-18 20:39:18] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2023-03-18 20:39:18] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2023-03-18 20:39:19] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2023-03-18 20:39:19] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-18 20:39:19] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2023-03-18 20:39:19] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-18 20:39:19] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-18 20:39:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1185 ms
[2023-03-18 20:39:19] [INFO ] After 1471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-18 20:39:19] [INFO ] After 1673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-18 20:39:19] [INFO ] Flatten gal took : 69 ms
[2023-03-18 20:39:19] [INFO ] Flatten gal took : 30 ms
[2023-03-18 20:39:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14529014299304717347.gal : 4 ms
[2023-03-18 20:39:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13762368821416797639.prop : 0 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/ReachabilityCardinality14529014299304717347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13762368821416797639.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...330
Loading property file /tmp/ReachabilityCardinality13762368821416797639.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 75
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 168
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :168 after 1919
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1919 after 2826
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2826 after 13258
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :13258 after 215735
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :215735 after 4.11358e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.11358e+06 after 1.28198e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.28198e+08 after 1.46373e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.46373e+10 after 2.6509e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.6509e+10 after 5.55427e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :5.55427e+11 after 5.51197e+13
Detected timeout of ITS tools.
[2023-03-18 20:39:34] [INFO ] Flatten gal took : 29 ms
[2023-03-18 20:39:34] [INFO ] Applying decomposition
[2023-03-18 20:39:34] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11614270354796068968.txt' '-o' '/tmp/graph11614270354796068968.bin' '-w' '/tmp/graph11614270354796068968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11614270354796068968.bin' '-l' '-1' '-v' '-w' '/tmp/graph11614270354796068968.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:39:34] [INFO ] Decomposing Gal with order
[2023-03-18 20:39:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:39:35] [INFO ] Removed a total of 382 redundant transitions.
[2023-03-18 20:39:35] [INFO ] Flatten gal took : 109 ms
[2023-03-18 20:39:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 507 labels/synchronizations in 35 ms.
[2023-03-18 20:39:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10982203322105488740.gal : 16 ms
[2023-03-18 20:39:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4904748252954336051.prop : 1 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/ReachabilityCardinality10982203322105488740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4904748252954336051.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality4904748252954336051.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :756 after 1.58142e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.58142e+06 after 1.38681e+22
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10891489907075148015
[2023-03-18 20:39:50] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10891489907075148015
Running compilation step : cd /tmp/ltsmin10891489907075148015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 923 ms.
Running link step : cd /tmp/ltsmin10891489907075148015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin10891489907075148015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPsPT020BReachabilityCardinality12==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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)
[2023-03-18 20:40:05] [INFO ] Flatten gal took : 62 ms
[2023-03-18 20:40:05] [INFO ] Applying decomposition
[2023-03-18 20:40:05] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11023407680107592508.txt' '-o' '/tmp/graph11023407680107592508.bin' '-w' '/tmp/graph11023407680107592508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11023407680107592508.bin' '-l' '-1' '-v' '-w' '/tmp/graph11023407680107592508.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:40:05] [INFO ] Decomposing Gal with order
[2023-03-18 20:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:40:05] [INFO ] Removed a total of 460 redundant transitions.
[2023-03-18 20:40:05] [INFO ] Flatten gal took : 86 ms
[2023-03-18 20:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-18 20:40:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13373032856438598834.gal : 19 ms
[2023-03-18 20:40:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14270756600172925840.prop : 0 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/ReachabilityCardinality13373032856438598834.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14270756600172925840.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality14270756600172925840.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 2267
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2267 after 2.63369e+17
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.63369e+17 after 2.45589e+36
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.0077e+55 after 3.06958e+56
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.06958e+56 after 7.27961e+56
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 21:10:09] [INFO ] Flatten gal took : 536 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9257915701707450371
[2023-03-18 21:10:09] [INFO ] Computing symmetric may disable matrix : 483 transitions.
[2023-03-18 21:10:09] [INFO ] Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:09] [INFO ] Computing symmetric may enable matrix : 483 transitions.
[2023-03-18 21:10:09] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:09] [INFO ] Applying decomposition
[2023-03-18 21:10:10] [INFO ] Flatten gal took : 287 ms
[2023-03-18 21:10:10] [INFO ] Computing Do-Not-Accords matrix : 483 transitions.
[2023-03-18 21:10:10] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:10] [INFO ] Built C files in 941ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9257915701707450371
Running compilation step : cd /tmp/ltsmin9257915701707450371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15652883066813021845.txt' '-o' '/tmp/graph15652883066813021845.bin' '-w' '/tmp/graph15652883066813021845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15652883066813021845.bin' '-l' '-1' '-v' '-w' '/tmp/graph15652883066813021845.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:10:11] [INFO ] Decomposing Gal with order
[2023-03-18 21:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 1471 ms.
Running link step : cd /tmp/ltsmin9257915701707450371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin9257915701707450371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT020BReachabilityCardinality12==true'
[2023-03-18 21:10:12] [INFO ] Removed a total of 381 redundant transitions.
[2023-03-18 21:10:12] [INFO ] Flatten gal took : 283 ms
[2023-03-18 21:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 168 ms.
[2023-03-18 21:10:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11422117507313366062.gal : 48 ms
[2023-03-18 21:10:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8048267652951980425.prop : 1 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/ReachabilityCardinality11422117507313366062.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8048267652951980425.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality8048267652951980425.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 131526
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :820584 after 7.57285e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.57285e+08 after 7.92042e+32
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: Initializing POR dependencies: labels 484, guards 483
pins2lts-mc-linux64( 0/ 8), 3.479: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 3.506: "ShieldIIPsPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 3.506: "ShieldIIPsPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 3.506: "ShieldIIPsPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.506: There are 484 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.506: State length is 502, there are 483 groups
pins2lts-mc-linux64( 0/ 8), 3.506: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.506: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.506: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 3.506: Visible groups: 0 / 483, labels: 1 / 484
pins2lts-mc-linux64( 0/ 8), 3.506: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 3.506: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 3.506: "ShieldIIPsPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 3.501: "ShieldIIPsPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 3.502: "ShieldIIPsPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 3.502: "ShieldIIPsPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 3.502: "ShieldIIPsPT020BReachabilityCardinality12==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.528: ~8 levels ~960 states ~3264 transitions
pins2lts-mc-linux64( 0/ 8), 3.546: ~9 levels ~1920 states ~6840 transitions
pins2lts-mc-linux64( 0/ 8), 3.586: ~12 levels ~3840 states ~14528 transitions
pins2lts-mc-linux64( 0/ 8), 3.720: ~13 levels ~7680 states ~32752 transitions
pins2lts-mc-linux64( 0/ 8), 4.105: ~14 levels ~15360 states ~74208 transitions
pins2lts-mc-linux64( 0/ 8), 4.801: ~16 levels ~30720 states ~160128 transitions
pins2lts-mc-linux64( 0/ 8), 6.177: ~18 levels ~61440 states ~323792 transitions
pins2lts-mc-linux64( 0/ 8), 8.925: ~19 levels ~122880 states ~701472 transitions
pins2lts-mc-linux64( 4/ 8), 13.991: ~11 levels ~245760 states ~1575320 transitions
pins2lts-mc-linux64( 7/ 8), 23.599: ~13 levels ~491520 states ~3344712 transitions
pins2lts-mc-linux64( 4/ 8), 43.809: ~13 levels ~983040 states ~6944200 transitions
pins2lts-mc-linux64( 7/ 8), 83.449: ~15 levels ~1966080 states ~14855280 transitions
pins2lts-mc-linux64( 7/ 8), 166.751: ~16 levels ~3932160 states ~30369152 transitions
pins2lts-mc-linux64( 7/ 8), 329.595: ~18 levels ~7864320 states ~60368016 transitions
pins2lts-mc-linux64( 7/ 8), 695.293: ~19 levels ~15728640 states ~130720568 transitions
pins2lts-mc-linux64( 3/ 8), 1101.717: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1101.768:
pins2lts-mc-linux64( 0/ 8), 1101.768: mean standard work distribution: 5.0% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1101.768:
pins2lts-mc-linux64( 0/ 8), 1101.768: Explored 22675524 states 197763324 transitions, fanout: 8.721
pins2lts-mc-linux64( 0/ 8), 1101.768: Total exploration time 1098.260 sec (1098.220 sec minimum, 1098.234 sec on average)
pins2lts-mc-linux64( 0/ 8), 1101.768: States per second: 20647, Transitions per second: 180070
pins2lts-mc-linux64( 0/ 8), 1101.768: Ignoring proviso: 13491196
pins2lts-mc-linux64( 0/ 8), 1101.768:
pins2lts-mc-linux64( 0/ 8), 1101.768: Queue width: 8B, total height: 19480876, memory: 148.63MB
pins2lts-mc-linux64( 0/ 8), 1101.768: Tree memory: 577.6MB, 14.4 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1101.768: Tree fill ratio (roots/leafs): 31.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1101.768: Stored 487 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1101.768: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1101.768: Est. total memory use: 726.3MB (~1172.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9257915701707450371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT020BReachabilityCardinality12==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9257915701707450371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT020BReachabilityCardinality12==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 3044648 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16202816 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-020B"
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-020B, 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-167903713100110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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