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.r395-oct2-167903718600334.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 smartxred
Input is ShieldIIPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 860K 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 ShieldIIPt-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679563840047

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:30:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 09:30:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:30:42] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-23 09:30:42] [INFO ] Transformed 3503 places.
[2023-03-23 09:30:42] [INFO ] Transformed 3253 transitions.
[2023-03-23 09:30:42] [INFO ] Found NUPN structural information;
[2023-03-23 09:30:42] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 15) seen :6
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-23 09:30:43] [INFO ] Computed 451 place invariants in 28 ms
[2023-03-23 09:30:45] [INFO ] After 1423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 09:30:46] [INFO ] [Nat]Absence check using 451 positive place invariants in 281 ms returned sat
[2023-03-23 09:30:59] [INFO ] After 12085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 09:31:00] [INFO ] Deduced a trap composed of 23 places in 1364 ms of which 34 ms to minimize.
[2023-03-23 09:31:02] [INFO ] Deduced a trap composed of 15 places in 1272 ms of which 11 ms to minimize.
[2023-03-23 09:31:03] [INFO ] Deduced a trap composed of 19 places in 1173 ms of which 10 ms to minimize.
[2023-03-23 09:31:04] [INFO ] Deduced a trap composed of 13 places in 945 ms of which 14 ms to minimize.
[2023-03-23 09:31:05] [INFO ] Deduced a trap composed of 21 places in 939 ms of which 2 ms to minimize.
[2023-03-23 09:31:06] [INFO ] Deduced a trap composed of 22 places in 1044 ms of which 2 ms to minimize.
[2023-03-23 09:31:07] [INFO ] Deduced a trap composed of 23 places in 1099 ms of which 3 ms to minimize.
[2023-03-23 09:31:09] [INFO ] Deduced a trap composed of 29 places in 923 ms of which 1 ms to minimize.
[2023-03-23 09:31:10] [INFO ] Deduced a trap composed of 16 places in 879 ms of which 2 ms to minimize.
[2023-03-23 09:31:12] [INFO ] Deduced a trap composed of 15 places in 2322 ms of which 4 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-23 09:31:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 09:31:12] [INFO ] After 27392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1631 ms.
Support contains 143 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 747 transitions
Trivial Post-agglo rules discarded 747 transitions
Performed 747 trivial Post agglomeration. Transition count delta: 747
Iterating post reduction 0 with 747 rules applied. Total rules applied 747 place count 3503 transition count 2506
Reduce places removed 747 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 749 rules applied. Total rules applied 1496 place count 2756 transition count 2504
Reduce places removed 1 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 2 with 44 rules applied. Total rules applied 1540 place count 2755 transition count 2461
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1583 place count 2712 transition count 2461
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 205 Pre rules applied. Total rules applied 1583 place count 2712 transition count 2256
Deduced a syphon composed of 205 places in 8 ms
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 4 with 410 rules applied. Total rules applied 1993 place count 2507 transition count 2256
Discarding 311 places :
Symmetric choice reduction at 4 with 311 rule applications. Total rules 2304 place count 2196 transition count 1945
Iterating global reduction 4 with 311 rules applied. Total rules applied 2615 place count 2196 transition count 1945
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 124 Pre rules applied. Total rules applied 2615 place count 2196 transition count 1821
Deduced a syphon composed of 124 places in 11 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 2863 place count 2072 transition count 1821
Performed 789 Post agglomeration using F-continuation condition.Transition count delta: 789
Deduced a syphon composed of 789 places in 4 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 4 with 1578 rules applied. Total rules applied 4441 place count 1283 transition count 1032
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4643 place count 1182 transition count 1083
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 4695 place count 1156 transition count 1093
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 4702 place count 1156 transition count 1086
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 4709 place count 1149 transition count 1086
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 5 with 42 rules applied. Total rules applied 4751 place count 1149 transition count 1086
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4752 place count 1148 transition count 1085
Applied a total of 4752 rules in 1042 ms. Remains 1148 /3503 variables (removed 2355) and now considering 1085/3253 (removed 2168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 1148/3503 places, 1085/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 9) seen :2
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1085 rows 1148 cols
[2023-03-23 09:31:15] [INFO ] Computed 451 place invariants in 5 ms
[2023-03-23 09:31:16] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 09:31:16] [INFO ] [Nat]Absence check using 451 positive place invariants in 112 ms returned sat
[2023-03-23 09:31:17] [INFO ] After 1210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 09:31:17] [INFO ] State equation strengthened by 329 read => feed constraints.
[2023-03-23 09:31:19] [INFO ] After 1632ms SMT Verify possible using 329 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 09:31:19] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2023-03-23 09:31:20] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-23 09:31:20] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-23 09:31:20] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2023-03-23 09:31:20] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-23 09:31:21] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 1 ms to minimize.
[2023-03-23 09:31:21] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-23 09:31:21] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2023-03-23 09:31:21] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-23 09:31:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2197 ms
[2023-03-23 09:31:22] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-23 09:31:22] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-23 09:31:22] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2023-03-23 09:31:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 689 ms
[2023-03-23 09:31:23] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2023-03-23 09:31:23] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-23 09:31:23] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-23 09:31:23] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-23 09:31:23] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-23 09:31:24] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-23 09:31:24] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-23 09:31:24] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-23 09:31:24] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-23 09:31:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1669 ms
[2023-03-23 09:31:24] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-03-23 09:31:25] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2023-03-23 09:31:25] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-23 09:31:25] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2023-03-23 09:31:25] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-23 09:31:25] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2023-03-23 09:31:26] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-23 09:31:26] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-23 09:31:26] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 13 ms to minimize.
[2023-03-23 09:31:26] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-23 09:31:26] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-23 09:31:27] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-23 09:31:27] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2023-03-23 09:31:27] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-23 09:31:27] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-23 09:31:27] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3110 ms
[2023-03-23 09:31:28] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-23 09:31:28] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2023-03-23 09:31:28] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2023-03-23 09:31:28] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-23 09:31:29] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-23 09:31:29] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-23 09:31:29] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-23 09:31:29] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-23 09:31:29] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-23 09:31:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1780 ms
[2023-03-23 09:31:30] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-23 09:31:30] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-23 09:31:31] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-23 09:31:31] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-23 09:31:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 834 ms
[2023-03-23 09:31:31] [INFO ] After 13311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2463 ms.
[2023-03-23 09:31:33] [INFO ] After 17619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 92 ms.
Support contains 113 out of 1148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1148/1148 places, 1085/1085 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1148 transition count 1072
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1135 transition count 1072
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 26 place count 1135 transition count 1070
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 1133 transition count 1070
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 7 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 76 place count 1110 transition count 1047
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 1105 transition count 1052
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1105 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1104 transition count 1051
Applied a total of 88 rules in 223 ms. Remains 1104 /1148 variables (removed 44) and now considering 1051/1085 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 1104/1148 places, 1051/1085 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 71337 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71337 steps, saw 52111 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1051 rows 1104 cols
[2023-03-23 09:31:37] [INFO ] Computed 451 place invariants in 4 ms
[2023-03-23 09:31:38] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 09:31:38] [INFO ] [Nat]Absence check using 451 positive place invariants in 104 ms returned sat
[2023-03-23 09:31:39] [INFO ] After 1251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 09:31:39] [INFO ] State equation strengthened by 347 read => feed constraints.
[2023-03-23 09:31:41] [INFO ] After 1754ms SMT Verify possible using 347 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 09:31:41] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-23 09:31:42] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-23 09:31:42] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-23 09:31:42] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-23 09:31:42] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-23 09:31:42] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 4 ms to minimize.
[2023-03-23 09:31:43] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2023-03-23 09:31:43] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 9 ms to minimize.
[2023-03-23 09:31:43] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 8 ms to minimize.
[2023-03-23 09:31:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1840 ms
[2023-03-23 09:31:44] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 15 ms to minimize.
[2023-03-23 09:31:44] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-23 09:31:44] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-23 09:31:44] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2023-03-23 09:31:44] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-23 09:31:45] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2023-03-23 09:31:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1297 ms
[2023-03-23 09:31:45] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2023-03-23 09:31:46] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-23 09:31:46] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-03-23 09:31:46] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-23 09:31:46] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-23 09:31:46] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-23 09:31:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1310 ms
[2023-03-23 09:31:47] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-23 09:31:47] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2023-03-23 09:31:47] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-23 09:31:48] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-23 09:31:48] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-23 09:31:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1512 ms
[2023-03-23 09:31:50] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-23 09:31:51] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-23 09:31:51] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-23 09:31:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 867 ms
[2023-03-23 09:31:51] [INFO ] After 11624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4456 ms.
[2023-03-23 09:31:56] [INFO ] After 17804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 266 ms.
Support contains 113 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 1051/1051 transitions.
Applied a total of 0 rules in 29 ms. Remains 1104 /1104 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1104/1104 places, 1051/1051 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 1051/1051 transitions.
Applied a total of 0 rules in 25 ms. Remains 1104 /1104 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
[2023-03-23 09:31:56] [INFO ] Invariant cache hit.
[2023-03-23 09:31:57] [INFO ] Implicit Places using invariants in 731 ms returned [1094]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 734 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1103/1104 places, 1051/1051 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 1103 transition count 1050
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 1102 transition count 1050
Applied a total of 2 rules in 38 ms. Remains 1102 /1103 variables (removed 1) and now considering 1050/1051 (removed 1) transitions.
// Phase 1: matrix 1050 rows 1102 cols
[2023-03-23 09:31:57] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-23 09:31:57] [INFO ] Implicit Places using invariants in 541 ms returned [1087]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 542 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1101/1104 places, 1050/1051 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1100 transition count 1049
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1100 transition count 1049
Applied a total of 2 rules in 40 ms. Remains 1100 /1101 variables (removed 1) and now considering 1049/1050 (removed 1) transitions.
// Phase 1: matrix 1049 rows 1100 cols
[2023-03-23 09:31:57] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-23 09:31:58] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-23 09:31:58] [INFO ] Invariant cache hit.
[2023-03-23 09:31:58] [INFO ] State equation strengthened by 345 read => feed constraints.
[2023-03-23 09:32:02] [INFO ] Implicit Places using invariants and state equation in 4122 ms returned []
Implicit Place search using SMT with State Equation took 4726 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1100/1104 places, 1049/1051 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6105 ms. Remains : 1100/1104 places, 1049/1051 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 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 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) 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 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 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 86453 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86453 steps, saw 60802 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-23 09:32:06] [INFO ] Invariant cache hit.
[2023-03-23 09:32:06] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 09:32:07] [INFO ] [Nat]Absence check using 449 positive place invariants in 112 ms returned sat
[2023-03-23 09:32:08] [INFO ] After 1105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 09:32:08] [INFO ] State equation strengthened by 345 read => feed constraints.
[2023-03-23 09:32:09] [INFO ] After 1298ms SMT Verify possible using 345 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 09:32:09] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-23 09:32:10] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-23 09:32:10] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-23 09:32:10] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-23 09:32:10] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-23 09:32:11] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2023-03-23 09:32:11] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-03-23 09:32:11] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-23 09:32:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1654 ms
[2023-03-23 09:32:11] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2023-03-23 09:32:11] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-23 09:32:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2023-03-23 09:32:12] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-23 09:32:12] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-23 09:32:12] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-03-23 09:32:12] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-23 09:32:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 927 ms
[2023-03-23 09:32:13] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-23 09:32:13] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-23 09:32:14] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2023-03-23 09:32:14] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-23 09:32:14] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-23 09:32:14] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-23 09:32:15] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2023-03-23 09:32:15] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2023-03-23 09:32:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2159 ms
[2023-03-23 09:32:16] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2023-03-23 09:32:16] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-23 09:32:16] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-23 09:32:17] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-23 09:32:17] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2023-03-23 09:32:17] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-23 09:32:17] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-23 09:32:18] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
[2023-03-23 09:32:18] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-23 09:32:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2763 ms
[2023-03-23 09:32:20] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-23 09:32:20] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-23 09:32:20] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2023-03-23 09:32:20] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-23 09:32:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 963 ms
[2023-03-23 09:32:20] [INFO ] After 12583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 5684 ms.
[2023-03-23 09:32:26] [INFO ] After 19978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 410 ms.
Support contains 113 out of 1100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 1049/1049 transitions.
Applied a total of 0 rules in 31 ms. Remains 1100 /1100 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1100/1100 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 1049/1049 transitions.
Applied a total of 0 rules in 24 ms. Remains 1100 /1100 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2023-03-23 09:32:27] [INFO ] Invariant cache hit.
[2023-03-23 09:32:27] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-23 09:32:27] [INFO ] Invariant cache hit.
[2023-03-23 09:32:28] [INFO ] State equation strengthened by 345 read => feed constraints.
[2023-03-23 09:32:32] [INFO ] Implicit Places using invariants and state equation in 4468 ms returned []
Implicit Place search using SMT with State Equation took 5099 ms to find 0 implicit places.
[2023-03-23 09:32:32] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-23 09:32:32] [INFO ] Invariant cache hit.
[2023-03-23 09:32:32] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5724 ms. Remains : 1100/1100 places, 1049/1049 transitions.
Graph (complete) has 3093 edges and 1100 vertex of which 1099 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 173 times.
Drop transitions removed 173 transitions
Iterating global reduction 0 with 173 rules applied. Total rules applied 174 place count 1099 transition count 1049
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 175 place count 1099 transition count 1048
Applied a total of 175 rules in 72 ms. Remains 1099 /1100 variables (removed 1) and now considering 1048/1049 (removed 1) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1048 rows 1099 cols
[2023-03-23 09:32:32] [INFO ] Computed 448 place invariants in 9 ms
[2023-03-23 09:32:33] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 09:32:33] [INFO ] [Nat]Absence check using 448 positive place invariants in 101 ms returned sat
[2023-03-23 09:32:34] [INFO ] After 801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 09:32:34] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-23 09:32:35] [INFO ] After 1069ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 09:32:35] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-23 09:32:35] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-23 09:32:37] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2023-03-23 09:32:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1460 ms
[2023-03-23 09:32:37] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2023-03-23 09:32:37] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2023-03-23 09:32:37] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 8 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-23 09:32:39] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2023-03-23 09:32:39] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2023-03-23 09:32:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2087 ms
[2023-03-23 09:32:39] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2023-03-23 09:32:40] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2023-03-23 09:32:40] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-23 09:32:40] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2023-03-23 09:32:40] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-23 09:32:41] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-23 09:32:41] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-23 09:32:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1748 ms
[2023-03-23 09:32:41] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2023-03-23 09:32:42] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-23 09:32:42] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-23 09:32:42] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-23 09:32:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 945 ms
[2023-03-23 09:32:43] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2023-03-23 09:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-23 09:32:43] [INFO ] After 8945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1094 ms.
[2023-03-23 09:32:44] [INFO ] After 11334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-23 09:32:44] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-03-23 09:32:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1100 places, 1049 transitions and 4986 arcs took 17 ms.
[2023-03-23 09:32:45] [INFO ] Flatten gal took : 126 ms
Total runtime 123059 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 050B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1100 places, 1049 transitions, 4986 arcs.
Final Score: 116469.935
Took : 46 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-050B-ReachabilityCardinality-00 (reachable &!potential( ( ( ( (tk(P290)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P290)) ) ) | ( ( (tk(P554)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P554)) ) ) )))
PROPERTY: ShieldIIPt-PT-050B-ReachabilityCardinality-01 (reachable &!potential( ( ( (tk(P129)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P129)) ) )))
PROPERTY: ShieldIIPt-PT-050B-ReachabilityCardinality-02 (reachable & potential(( ( ( (tk(P565)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P565)) ) ) & ( ( ( (tk(P19)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P19)) ) ) | ( ( ( ( (tk(P181)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P181)) ) ) & ( ( (tk(P1059)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1059)) ) ) ) & ( ( ( (tk(P662)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P662)) ) ) & ( ( ( ( (tk(P312)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P312)) ) ) | ( ( (tk(P821)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P821)) ) ) ) & ( ( ( (tk(P453)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P453)) ) ) | ( ( ( ( (tk(P875)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P875)) ) ) & ( ( (tk(P599)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P599)) ) ) ) & ( ( ( (tk(P923)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P923)) ) ) & ( ( (tk(P127)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P127)) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-050B-ReachabilityCardinality-03 (reachable & potential(( ( (tk(P404)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P404)) ) )))
PROPERTY: ShieldIIPt-PT-050B-ReachabilityCardinality-05 (reachable & potential(( ( ( ( ( (tk(P882)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P882)) ) ) & ( ( ( (tk(P906)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P906)) ) ) & ( ( (tk(P90)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P90)) ) ) ) ) & ( ( ( (tk(P602)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P602)) ) ) & ( ( ( (tk(P530)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P530)) ) ) & ( ( (tk(P981)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P981)) ) ) ) ) ) & ( ( ( ( (tk(P255)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P255)) ) ) & ( ( ( (tk(P222)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P222)) ) ) & ( ( ( (tk(P327)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P327)) ) ) | ( ( (tk(P340)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P340)) ) ) ) ) ) & ( ( ( ( (tk(P206)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P206)) ) ) | ( ( ( (tk(P758)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P758)) ) ) | ( ( ( ( (tk(P1098)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1098)) ) ) & ( ( (tk(P620)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P620)) ) ) ) & ( ( ( (tk(P131)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P131)) ) ) & ( ( ( (tk(P1084)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1084)) ) ) & ( ( ( (tk(P816)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P816)) ) ) | ( ( ( (tk(P200)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P200)) ) ) | ( ( (tk(P751)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P751)) ) ) ) ) ) ) ) ) ) & ( ( ( ( ( (tk(P1044)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1044)) ) ) | ( ( ( (tk(P1001)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1001)) ) ) | ( ( (tk(P689)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P689)) ) ) ) ) | ( ( ( (tk(P763)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P763)) ) ) | ( ( ( ( (tk(P897)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P897)) ) ) & ( ( ( (tk(P205)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P205)) ) ) & ( ( (tk(P113)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P113)) ) ) ) ) | ( ( ( (tk(P748)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P748)) ) ) & ( ( ( (tk(P154)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P154)) ) ) | ( ( (tk(P41)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P41)) ) ) ) ) ) ) ) & ( ( ( (tk(P833)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P833)) ) ) | ( ( ( (tk(P332)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P332)) ) ) | ( ( ( (tk(P1050)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1050)) ) ) & ( ( (tk(P440)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P440)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-050B-ReachabilityCardinality-10 (reachable &!potential( ( ( ( ( (tk(P607)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P607)) ) ) | ( ( ( (tk(P536)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P536)) ) ) | ( ( (tk(P571)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P571)) ) ) ) ) | ( ( ( ( (tk(P904)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P904)) ) ) | ( ( ( ( (tk(P211)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P211)) ) ) & ( ( (tk(P513)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P513)) ) ) ) & ( ( ( (tk(P1015)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1015)) ) ) & ( ( ( ( ( (tk(P698)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P698)) ) ) & ( ( (tk(P922)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P922)) ) ) ) | ( ( ( (tk(P724)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P724)) ) ) & ( ( ( (tk(P218)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P218)) ) ) & ( ( ( (tk(P771)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P771)) ) ) | ( ( ( (tk(P163)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P163)) ) ) & ( ( (tk(P408)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P408)) ) ) ) ) ) ) ) & ( ( ( ( (tk(P307)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P307)) ) ) | ( ( (tk(P479)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P479)) ) ) ) | ( ( ( (tk(P274)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P274)) ) ) | ( ( (tk(P880)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P880)) ) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P330)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P330)) ) ) & ( ( (tk(P449)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P449)) ) ) ) & ( ( ( (tk(P446)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P446)) ) ) & ( ( ( (tk(P337)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P337)) ) ) & ( ( ( (tk(P715)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P715)) ) ) | ( ( ( ( (tk(P642)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P642)) ) ) | ( ( (tk(P1004)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1004)) ) ) ) & ( ( ( (tk(P651)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P651)) ) ) | ( ( ( (tk(P251)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P251)) ) ) & ( ( (tk(P198)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P198)) ) ) ) ) ) ) ) ) ) | ( ( ( (tk(P111)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P111)) ) ) & ( ( ( (tk(P576)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P576)) ) ) | ( ( ( (tk(P402)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P402)) ) ) | ( ( ( (tk(P115)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P115)) ) ) & ( ( ( (tk(P730)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P730)) ) ) | ( ( (tk(P516)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P516)) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-050B-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( (tk(P245)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P245)) ) ) | ( ( ( (tk(P67)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P67)) ) ) | ( ( (tk(P213)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P213)) ) ) ) ) | ( ( ( ( ( ( (tk(P1096)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1096)) ) ) & ( ( (tk(P1029)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1029)) ) ) ) & ( ( ( (tk(P1066)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1066)) ) ) & ( ( ( (tk(P319)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P319)) ) ) | ( ( ( (tk(P909)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P909)) ) ) | ( ( ( (tk(P368)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P368)) ) ) & ( ( ( (tk(P682)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P682)) ) ) | ( ( (tk(P493)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P493)) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P138)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P138)) ) ) & ( ( (tk(P1061)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1061)) ) ) ) & ( ( ( (tk(P853)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P853)) ) ) & ( ( ( ( (tk(P666)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P666)) ) ) | ( ( (tk(P1097)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1097)) ) ) ) & ( ( ( (tk(P733)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P733)) ) ) | ( ( (tk(P298)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P298)) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P716)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P716)) ) ) & ( ( (tk(P968)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P968)) ) ) ) & ( ( ( ( (tk(P29)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P29)) ) ) | ( ( (tk(P1013)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1013)) ) ) ) & ( ( ( (tk(P741)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P741)) ) ) | ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) & ( ( ( (tk(P429)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P429)) ) ) | ( ( (tk(P105)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P105)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P397)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P397)) ) ) & ( ( (tk(P754)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P754)) ) ) ) & ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) & ( ( (tk(P697)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P697)) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9955380 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16105116 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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="ShieldIIPt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldIIPt-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 r395-oct2-167903718600334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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