Execution Chart

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

Trace from the execution

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

--------------------
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 1679302534550

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:55:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 08:55:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:55:36] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-20 08:55:36] [INFO ] Transformed 2003 places.
[2023-03-20 08:55:36] [INFO ] Transformed 2253 transitions.
[2023-03-20 08:55:36] [INFO ] Found NUPN structural information;
[2023-03-20 08:55:36] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 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 423 ms. (steps per millisecond=23 ) properties (out of 14) seen :8
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-04 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 56 ms. (steps per millisecond=178 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 2253 rows 2003 cols
[2023-03-20 08:55:37] [INFO ] Computed 201 place invariants in 31 ms
[2023-03-20 08:55:38] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 08:55:38] [INFO ] [Nat]Absence check using 201 positive place invariants in 73 ms returned sat
[2023-03-20 08:55:41] [INFO ] After 2152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 27 places in 590 ms of which 13 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 39 places in 660 ms of which 2 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 45 places in 577 ms of which 2 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 24 places in 564 ms of which 8 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 23 places in 550 ms of which 1 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 19 places in 513 ms of which 2 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 20 places in 531 ms of which 2 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 43 places in 494 ms of which 3 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 31 places in 496 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 26 places in 471 ms of which 1 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 32 places in 579 ms of which 2 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 27 places in 483 ms of which 1 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 29 places in 423 ms of which 1 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 21 places in 414 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 28 places in 423 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 57 places in 413 ms of which 1 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 25 places in 427 ms of which 1 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 10011 ms
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 47 places in 582 ms of which 1 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 33 places in 658 ms of which 1 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 30 places in 582 ms of which 1 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 40 places in 728 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 34 places in 737 ms of which 2 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 43 places in 675 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 32 places in 580 ms of which 1 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 27 places in 617 ms of which 1 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 41 places in 601 ms of which 1 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 30 places in 558 ms of which 1 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 26 places in 589 ms of which 1 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 31 places in 594 ms of which 1 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 31 places in 593 ms of which 1 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 22 places in 585 ms of which 2 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 42 places in 575 ms of which 1 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 23 places in 551 ms of which 2 ms to minimize.
[2023-03-20 08:56:03] [INFO ] Deduced a trap composed of 30 places in 594 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:56:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:56:03] [INFO ] After 25343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
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 247 ms.
Support contains 37 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 2003 transition count 2065
Reduce places removed 188 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 193 rules applied. Total rules applied 381 place count 1815 transition count 2060
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 386 place count 1810 transition count 2060
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 253 Pre rules applied. Total rules applied 386 place count 1810 transition count 1807
Deduced a syphon composed of 253 places in 4 ms
Reduce places removed 253 places and 0 transitions.
Iterating global reduction 3 with 506 rules applied. Total rules applied 892 place count 1557 transition count 1807
Discarding 330 places :
Symmetric choice reduction at 3 with 330 rule applications. Total rules 1222 place count 1227 transition count 1477
Iterating global reduction 3 with 330 rules applied. Total rules applied 1552 place count 1227 transition count 1477
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 1552 place count 1227 transition count 1341
Deduced a syphon composed of 136 places in 6 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 1824 place count 1091 transition count 1341
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Deduced a syphon composed of 350 places in 4 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 700 rules applied. Total rules applied 2524 place count 741 transition count 991
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 2623 place count 741 transition count 991
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2624 place count 740 transition count 990
Applied a total of 2624 rules in 517 ms. Remains 740 /2003 variables (removed 1263) and now considering 990/2253 (removed 1263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 740/2003 places, 990/2253 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) 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 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 990 rows 740 cols
[2023-03-20 08:56:04] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-20 08:56:04] [INFO ] [Real]Absence check using 201 positive place invariants in 43 ms returned sat
[2023-03-20 08:56:04] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 08:56:04] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:56:05] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 744 ms
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 342 ms
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 2800 ms
[2023-03-20 08:56:09] [INFO ] After 4537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-20 08:56:09] [INFO ] After 4824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 62 ms.
Support contains 21 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 990/990 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 740 transition count 988
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 738 transition count 988
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 738 transition count 986
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 8 place count 736 transition count 986
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 726 transition count 976
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 726 transition count 976
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 724 transition count 974
Applied a total of 33 rules in 162 ms. Remains 724 /740 variables (removed 16) and now considering 974/990 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 724/740 places, 974/990 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 163 ms. (steps per millisecond=61 ) 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 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 974 rows 724 cols
[2023-03-20 08:56:10] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-20 08:56:10] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-20 08:56:10] [INFO ] After 281ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 385 ms
[2023-03-20 08:56:10] [INFO ] After 713ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 08:56:10] [INFO ] After 847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 08:56:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-20 08:56:11] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 4 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 390 ms
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 434 ms
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 634 ms
[2023-03-20 08:56:12] [INFO ] After 1868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-20 08:56:13] [INFO ] After 2119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 27 ms.
Support contains 17 out of 724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 724/724 places, 974/974 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 720 transition count 970
Applied a total of 8 rules in 38 ms. Remains 720 /724 variables (removed 4) and now considering 970/974 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 720/724 places, 970/974 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 242799 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{2=1}
Probabilistic random walk after 242799 steps, saw 153423 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 970 rows 720 cols
[2023-03-20 08:56:16] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-20 08:56:16] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 08:56:16] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:17] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-20 08:56:17] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 349 ms
[2023-03-20 08:56:17] [INFO ] After 906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-20 08:56:17] [INFO ] After 1104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 8 out of 720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 970/970 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 720 transition count 968
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 718 transition count 968
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 713 transition count 963
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 711 transition count 961
Applied a total of 16 rules in 104 ms. Remains 711 /720 variables (removed 9) and now considering 961/970 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 711/720 places, 961/970 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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
Interrupted probabilistic random walk after 237449 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237449 steps, saw 218381 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 961 rows 711 cols
[2023-03-20 08:56:21] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-20 08:56:21] [INFO ] [Real]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:56:21] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:21] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:56:22] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 695 ms
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-03-20 08:56:23] [INFO ] After 1322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 08:56:23] [INFO ] After 1502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 961/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 711 /711 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 711/711 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 961/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 711 /711 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-20 08:56:23] [INFO ] Invariant cache hit.
[2023-03-20 08:56:23] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-20 08:56:23] [INFO ] Invariant cache hit.
[2023-03-20 08:56:24] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2023-03-20 08:56:24] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-20 08:56:24] [INFO ] Invariant cache hit.
[2023-03-20 08:56:24] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1534 ms. Remains : 711/711 places, 961/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 711 /711 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 08:56:24] [INFO ] Invariant cache hit.
[2023-03-20 08:56:25] [INFO ] [Real]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:56:25] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 23 ms returned sat
[2023-03-20 08:56:25] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-20 08:56:26] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-20 08:56:26] [INFO ] After 939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-20 08:56:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 711 places, 961 transitions and 4674 arcs took 11 ms.
[2023-03-20 08:56:26] [INFO ] Flatten gal took : 164 ms
Total runtime 50425 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/852/inv_0_ --invariant=/tmp/852/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 16005104 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097652 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-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 r425-tajo-167905977800158"
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 ;