Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 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.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 625K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679167225089

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=ShieldRVs-PT-050B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-18 19:20:27] [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 19:20:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:20:27] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2023-03-18 19:20:27] [INFO ] Transformed 2003 places.
[2023-03-18 19:20:27] [INFO ] Transformed 2253 transitions.
[2023-03-18 19:20:27] [INFO ] Found NUPN structural information;
[2023-03-18 19:20:27] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 885 ms. (steps per millisecond=11 ) properties (out of 14) seen :7
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
[2023-03-18 19:20:29] [INFO ] Flatten gal took : 380 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2023-03-18 19:20:29] [INFO ] Computed 201 place invariants in 38 ms
[2023-03-18 19:20:29] [INFO ] Flatten gal took : 250 ms
[2023-03-18 19:20:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3055663853122508050.gal : 126 ms
[2023-03-18 19:20:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2838132034892804674.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/ReachabilityCardinality3055663853122508050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2838132034892804674.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 ...328
Loading property file /tmp/ReachabilityCardinality2838132034892804674.prop.
[2023-03-18 19:20:30] [INFO ] After 1296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 19:20:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 166 ms returned sat
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 136
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :136 after 203907
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :203907 after 5.73354e+13
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :5.73354e+13 after 8.81666e+30
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :8.81666e+30 after 7.72152e+65
[2023-03-18 19:20:34] [INFO ] After 2989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 19:20:35] [INFO ] Deduced a trap composed of 25 places in 838 ms of which 14 ms to minimize.
[2023-03-18 19:20:36] [INFO ] Deduced a trap composed of 19 places in 815 ms of which 2 ms to minimize.
[2023-03-18 19:20:37] [INFO ] Deduced a trap composed of 27 places in 1080 ms of which 1 ms to minimize.
[2023-03-18 19:20:38] [INFO ] Deduced a trap composed of 20 places in 794 ms of which 3 ms to minimize.
[2023-03-18 19:20:39] [INFO ] Deduced a trap composed of 22 places in 649 ms of which 2 ms to minimize.
[2023-03-18 19:20:48] [INFO ] Deduced a trap composed of 20 places in 8977 ms of which 2 ms to minimize.
[2023-03-18 19:20:49] [INFO ] Deduced a trap composed of 33 places in 740 ms of which 2 ms to minimize.
[2023-03-18 19:20:50] [INFO ] Deduced a trap composed of 37 places in 683 ms of which 2 ms to minimize.
[2023-03-18 19:20:51] [INFO ] Deduced a trap composed of 27 places in 750 ms of which 2 ms to minimize.
[2023-03-18 19:20:51] [INFO ] Deduced a trap composed of 26 places in 656 ms of which 1 ms to minimize.
[2023-03-18 19:20:52] [INFO ] Deduced a trap composed of 24 places in 653 ms of which 1 ms to minimize.
[2023-03-18 19:20:53] [INFO ] Deduced a trap composed of 22 places in 656 ms of which 2 ms to minimize.
[2023-03-18 19:20:54] [INFO ] Deduced a trap composed of 23 places in 647 ms of which 2 ms to minimize.
[2023-03-18 19:20:54] [INFO ] Deduced a trap composed of 26 places in 672 ms of which 1 ms to minimize.
[2023-03-18 19:20:55] [INFO ] Deduced a trap composed of 24 places in 632 ms of which 2 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 19:20:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:20:55] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 545 ms.
Support contains 82 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 2003 transition count 2075
Reduce places removed 178 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 188 rules applied. Total rules applied 366 place count 1825 transition count 2065
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 376 place count 1815 transition count 2065
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 376 place count 1815 transition count 1817
Deduced a syphon composed of 248 places in 20 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 872 place count 1567 transition count 1817
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 1187 place count 1252 transition count 1502
Iterating global reduction 3 with 315 rules applied. Total rules applied 1502 place count 1252 transition count 1502
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 1502 place count 1252 transition count 1378
Deduced a syphon composed of 124 places in 6 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 1750 place count 1128 transition count 1378
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 2 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2426 place count 790 transition count 1040
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 3 with 88 rules applied. Total rules applied 2514 place count 790 transition count 1040
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2515 place count 789 transition count 1039
Applied a total of 2515 rules in 569 ms. Remains 789 /2003 variables (removed 1214) and now considering 1039/2253 (removed 1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 789/2003 places, 1039/2253 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1039 rows 789 cols
[2023-03-18 19:20:57] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-18 19:20:57] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 19:20:57] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-18 19:20:58] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4674 ms
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 689 ms
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 11 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2023-03-18 19:21:05] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-18 19:21:05] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-18 19:21:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 803 ms
[2023-03-18 19:21:05] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:21:05] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:21:05] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 4 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 5 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2544 ms
[2023-03-18 19:21:07] [INFO ] After 10039ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 288 ms.
[2023-03-18 19:21:08] [INFO ] After 10556ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 31 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1039/1039 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 789 transition count 1034
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 784 transition count 1034
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 784 transition count 1025
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 28 place count 775 transition count 1025
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 98 place count 740 transition count 990
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 111 place count 740 transition count 990
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 734 transition count 984
Applied a total of 117 rules in 141 ms. Remains 734 /789 variables (removed 55) and now considering 984/1039 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 734/789 places, 984/1039 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) 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 5) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 984 rows 734 cols
[2023-03-18 19:21:09] [INFO ] Computed 201 place invariants in 22 ms
[2023-03-18 19:21:09] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 19:21:09] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:21:09] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 3 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3484 ms
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 383 ms
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 804 ms
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1185 ms
[2023-03-18 19:21:15] [INFO ] After 6519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 322 ms.
[2023-03-18 19:21:16] [INFO ] After 7021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 169 ms.
Support contains 28 out of 734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 734/734 places, 984/984 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 730 transition count 980
Applied a total of 8 rules in 64 ms. Remains 730 /734 variables (removed 4) and now considering 980/984 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 730/734 places, 980/984 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 980 rows 730 cols
[2023-03-18 19:21:16] [INFO ] Computed 201 place invariants in 17 ms
[2023-03-18 19:21:17] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 19:21:17] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:21:17] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 19:21:17] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2896 ms
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1369 ms
[2023-03-18 19:21:22] [INFO ] After 5457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-18 19:21:22] [INFO ] After 5826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 130 ms.
Support contains 24 out of 730 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 730/730 places, 980/980 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 726 transition count 976
Applied a total of 8 rules in 50 ms. Remains 726 /730 variables (removed 4) and now considering 976/980 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 726/730 places, 976/980 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 215959 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{0=1}
Probabilistic random walk after 215959 steps, saw 86935 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 976 rows 726 cols
[2023-03-18 19:21:26] [INFO ] Computed 201 place invariants in 14 ms
[2023-03-18 19:21:26] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:21:27] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:21:27] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-18 19:21:27] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:21:27] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:21:27] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1750 ms
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2534 ms
[2023-03-18 19:21:31] [INFO ] After 4768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-18 19:21:32] [INFO ] After 5038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 14 out of 726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 976/976 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 726 transition count 975
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 725 transition count 975
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 18 place count 717 transition count 967
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 717 transition count 967
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 716 transition count 966
Applied a total of 20 rules in 112 ms. Remains 716 /726 variables (removed 10) and now considering 966/976 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 716/726 places, 966/976 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 123 ms. (steps per millisecond=81 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 201972 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201972 steps, saw 143333 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 966 rows 716 cols
[2023-03-18 19:21:35] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-18 19:21:35] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:21:35] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:21:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:21:36] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 798 ms
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4142 ms
[2023-03-18 19:21:41] [INFO ] After 5393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-18 19:21:41] [INFO ] After 5657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 38 ms.
Support contains 14 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 966/966 transitions.
Applied a total of 0 rules in 38 ms. Remains 716 /716 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 716/716 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 966/966 transitions.
Applied a total of 0 rules in 34 ms. Remains 716 /716 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-03-18 19:21:41] [INFO ] Invariant cache hit.
[2023-03-18 19:21:41] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-18 19:21:41] [INFO ] Invariant cache hit.
[2023-03-18 19:21:42] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2023-03-18 19:21:42] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-18 19:21:42] [INFO ] Invariant cache hit.
[2023-03-18 19:21:43] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1858 ms. Remains : 716/716 places, 966/966 transitions.
Applied a total of 0 rules in 22 ms. Remains 716 /716 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 19:21:43] [INFO ] Invariant cache hit.
[2023-03-18 19:21:43] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-18 19:21:43] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:21:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:21:43] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:21:43] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-18 19:21:46] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2210 ms
[2023-03-18 19:21:46] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-18 19:21:46] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-18 19:21:46] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:21:46] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:21:46] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-18 19:21:46] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2023-03-18 19:21:48] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-18 19:21:48] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2023-03-18 19:21:48] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2023-03-18 19:21:48] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-18 19:21:48] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:21:48] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2023-03-18 19:21:49] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-18 19:21:49] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2023-03-18 19:21:49] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:21:49] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-18 19:21:49] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-03-18 19:21:49] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 3 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2023-03-18 19:21:51] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:21:51] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:21:51] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2023-03-18 19:21:51] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2023-03-18 19:21:51] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:21:51] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 5626 ms
[2023-03-18 19:21:51] [INFO ] After 8252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-18 19:21:51] [INFO ] After 8543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-18 19:21:51] [INFO ] Flatten gal took : 79 ms
[2023-03-18 19:21:52] [INFO ] Flatten gal took : 64 ms
[2023-03-18 19:21:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10630778518107752689.gal : 16 ms
[2023-03-18 19:21:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4416007438849271550.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/ReachabilityCardinality10630778518107752689.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4416007438849271550.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 ...329
Loading property file /tmp/ReachabilityCardinality4416007438849271550.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 57
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :57 after 513
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1026 after 16614
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :16614 after 17034
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :17034 after 28706
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :28706 after 54693
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :54693 after 1.34599e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.34599e+06 after 6.83284e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6.83284e+07 after 7.76998e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7.76998e+09 after 5.46191e+11
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.46191e+11 after 7.72318e+13
Detected timeout of ITS tools.
[2023-03-18 19:22:07] [INFO ] Flatten gal took : 76 ms
[2023-03-18 19:22:07] [INFO ] Applying decomposition
[2023-03-18 19:22:07] [INFO ] Flatten gal took : 55 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/graph61922962782953418.txt' '-o' '/tmp/graph61922962782953418.bin' '-w' '/tmp/graph61922962782953418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph61922962782953418.bin' '-l' '-1' '-v' '-w' '/tmp/graph61922962782953418.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:22:07] [INFO ] Decomposing Gal with order
[2023-03-18 19:22:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:22:07] [INFO ] Removed a total of 1137 redundant transitions.
[2023-03-18 19:22:07] [INFO ] Flatten gal took : 151 ms
[2023-03-18 19:22:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1057 labels/synchronizations in 53 ms.
[2023-03-18 19:22:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality74328777784679879.gal : 12 ms
[2023-03-18 19:22:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16891771013574344826.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/ReachabilityCardinality74328777784679879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16891771013574344826.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 ...306
Loading property file /tmp/ReachabilityCardinality16891771013574344826.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.91486e+09 after 1.91526e+41
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin247543089186577625
[2023-03-18 19:22:23] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin247543089186577625
Running compilation step : cd /tmp/ltsmin247543089186577625;'/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 2474 ms.
Running link step : cd /tmp/ltsmin247543089186577625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin247543089186577625;'/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' 'ShieldRVsPT050BReachabilityCardinality10==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 19:22:38] [INFO ] Flatten gal took : 68 ms
[2023-03-18 19:22:38] [INFO ] Applying decomposition
[2023-03-18 19:22:38] [INFO ] Flatten gal took : 58 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/graph7830288642343732187.txt' '-o' '/tmp/graph7830288642343732187.bin' '-w' '/tmp/graph7830288642343732187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7830288642343732187.bin' '-l' '-1' '-v' '-w' '/tmp/graph7830288642343732187.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:22:38] [INFO ] Decomposing Gal with order
[2023-03-18 19:22:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:22:38] [INFO ] Removed a total of 1791 redundant transitions.
[2023-03-18 19:22:38] [INFO ] Flatten gal took : 102 ms
[2023-03-18 19:22:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-18 19:22:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2865212055293334233.gal : 17 ms
[2023-03-18 19:22:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12203591640796426751.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/ReachabilityCardinality2865212055293334233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12203591640796426751.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/ReachabilityCardinality12203591640796426751.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :289 after 6.52349e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6.52349e+06 after 8.54122e+41
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8.54122e+41 after 1.36109e+109
Reachability property ShieldRVs-PT-050B-ReachabilityCardinality-15 is true.
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.36109e+109 after 2.41686e+109
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 19:52:41] [INFO ] Flatten gal took : 419 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11757591479558208264
[2023-03-18 19:52:42] [INFO ] Computing symmetric may disable matrix : 966 transitions.
[2023-03-18 19:52:42] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:52:42] [INFO ] Computing symmetric may enable matrix : 966 transitions.
[2023-03-18 19:52:42] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:52:42] [INFO ] Applying decomposition
[2023-03-18 19:52:42] [INFO ] Flatten gal took : 273 ms
[2023-03-18 19:52:45] [INFO ] Computing Do-Not-Accords matrix : 966 transitions.
[2023-03-18 19:52:45] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:52:45] [INFO ] Built C files in 3701ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11757591479558208264
Running compilation step : cd /tmp/ltsmin11757591479558208264;'/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/graph10648455888031500879.txt' '-o' '/tmp/graph10648455888031500879.bin' '-w' '/tmp/graph10648455888031500879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10648455888031500879.bin' '-l' '-1' '-v' '-w' '/tmp/graph10648455888031500879.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:52:46] [INFO ] Decomposing Gal with order
[2023-03-18 19:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:52:47] [INFO ] Removed a total of 1128 redundant transitions.
[2023-03-18 19:52:47] [INFO ] Flatten gal took : 418 ms
[2023-03-18 19:52:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 940 labels/synchronizations in 62 ms.
[2023-03-18 19:52:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7550880484071583539.gal : 6 ms
[2023-03-18 19:52:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17950569862106946210.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/ReachabilityCardinality7550880484071583539.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17950569862106946210.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/ReachabilityCardinality17950569862106946210.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :19 after 57
Compilation finished in 2968 ms.
Running link step : cd /tmp/ltsmin11757591479558208264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin11757591479558208264;'/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' 'ShieldRVsPT050BReachabilityCardinality10==true'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.91486e+09 after 3.78565e+35
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: 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( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.163: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: Initializing POR dependencies: labels 968, guards 966
pins2lts-mc-linux64( 5/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.198: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.207: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.214: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.226: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.234: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 15.636: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 15.959: "ShieldRVsPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 15.959: "ShieldRVsPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 15.961: "ShieldRVsPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 15.962: "ShieldRVsPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 15.960: "ShieldRVsPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 15.963: There are 968 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 15.963: State length is 716, there are 966 groups
pins2lts-mc-linux64( 0/ 8), 15.963: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 15.963: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 15.963: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 15.963: Visible groups: 0 / 966, labels: 1 / 968
pins2lts-mc-linux64( 0/ 8), 15.963: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 15.963: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 15.961: "ShieldRVsPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 15.962: "ShieldRVsPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 15.961: "ShieldRVsPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 16.080: ~17 levels ~960 states ~4016 transitions
pins2lts-mc-linux64( 1/ 8), 16.168: ~8 levels ~1920 states ~9320 transitions
pins2lts-mc-linux64( 0/ 8), 16.333: ~20 levels ~3840 states ~20280 transitions
pins2lts-mc-linux64( 1/ 8), 16.703: ~10 levels ~7680 states ~43136 transitions
pins2lts-mc-linux64( 1/ 8), 17.395: ~11 levels ~15360 states ~89768 transitions
pins2lts-mc-linux64( 5/ 8), 18.736: ~12 levels ~30720 states ~226792 transitions
pins2lts-mc-linux64( 3/ 8), 21.311: ~9 levels ~61440 states ~427728 transitions
pins2lts-mc-linux64( 3/ 8), 26.424: ~10 levels ~122880 states ~895088 transitions
pins2lts-mc-linux64( 3/ 8), 36.540: ~11 levels ~245760 states ~1854072 transitions
pins2lts-mc-linux64( 3/ 8), 55.872: ~12 levels ~491520 states ~3879056 transitions
pins2lts-mc-linux64( 3/ 8), 96.088: ~13 levels ~983040 states ~8042912 transitions
pins2lts-mc-linux64( 3/ 8), 180.428: ~14 levels ~1966080 states ~16783744 transitions
pins2lts-mc-linux64( 3/ 8), 351.557: ~15 levels ~3932160 states ~34667656 transitions
pins2lts-mc-linux64( 3/ 8), 732.736: ~16 levels ~7864320 states ~72337488 transitions
pins2lts-mc-linux64( 6/ 8), 1306.357: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1306.501:
pins2lts-mc-linux64( 0/ 8), 1306.501: mean standard work distribution: 3.5% (states) 5.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1306.501:
pins2lts-mc-linux64( 0/ 8), 1306.501: Explored 12913548 states 125340412 transitions, fanout: 9.706
pins2lts-mc-linux64( 0/ 8), 1306.501: Total exploration time 1290.520 sec (1290.430 sec minimum, 1290.456 sec on average)
pins2lts-mc-linux64( 0/ 8), 1306.501: States per second: 10006, Transitions per second: 97124
pins2lts-mc-linux64( 0/ 8), 1306.501: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 1306.501:
pins2lts-mc-linux64( 0/ 8), 1306.501: Queue width: 8B, total height: 13455192, memory: 102.65MB
pins2lts-mc-linux64( 0/ 8), 1306.501: Tree memory: 457.2MB, 18.2 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1306.501: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1306.501: Stored 973 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1306.514: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1306.526: Est. total memory use: 559.8MB (~1126.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11757591479558208264;'/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' 'ShieldRVsPT050BReachabilityCardinality10==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11757591479558208264;'/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' 'ShieldRVsPT050BReachabilityCardinality10==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: 16393340 kB
MemFree: 154220 kB
After kill :
MemTotal: 16393340 kB
MemFree: 12933804 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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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 r421-tajo-167905974900158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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