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-167903718600319.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-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 686K 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679562509978

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:08:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 09:08:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:08:31] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-23 09:08:31] [INFO ] Transformed 2803 places.
[2023-03-23 09:08:32] [INFO ] Transformed 2603 transitions.
[2023-03-23 09:08:32] [INFO ] Found NUPN structural information;
[2023-03-23 09:08:32] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-23 09:08:32] [INFO ] Computed 361 place invariants in 25 ms
[2023-03-23 09:08:34] [INFO ] After 1093ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 09:08:35] [INFO ] [Nat]Absence check using 361 positive place invariants in 188 ms returned sat
[2023-03-23 09:08:45] [INFO ] After 9648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 09:08:49] [INFO ] Deduced a trap composed of 26 places in 1167 ms of which 7 ms to minimize.
[2023-03-23 09:08:50] [INFO ] Deduced a trap composed of 14 places in 1168 ms of which 4 ms to minimize.
[2023-03-23 09:08:51] [INFO ] Deduced a trap composed of 13 places in 1149 ms of which 4 ms to minimize.
[2023-03-23 09:08:52] [INFO ] Deduced a trap composed of 18 places in 1082 ms of which 5 ms to minimize.
[2023-03-23 09:08:54] [INFO ] Deduced a trap composed of 26 places in 1036 ms of which 2 ms to minimize.
[2023-03-23 09:08:55] [INFO ] Deduced a trap composed of 28 places in 980 ms of which 2 ms to minimize.
[2023-03-23 09:08:56] [INFO ] Deduced a trap composed of 25 places in 1054 ms of which 3 ms to minimize.
[2023-03-23 09:08:57] [INFO ] Deduced a trap composed of 28 places in 1189 ms of which 2 ms to minimize.
[2023-03-23 09:08:59] [INFO ] Deduced a trap composed of 20 places in 1027 ms of which 3 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:08:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 09:08:59] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 1212 ms.
Support contains 160 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2803 transition count 2045
Reduce places removed 558 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 560 rules applied. Total rules applied 1118 place count 2245 transition count 2043
Reduce places removed 1 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 26 rules applied. Total rules applied 1144 place count 2244 transition count 2018
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1169 place count 2219 transition count 2018
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 174 Pre rules applied. Total rules applied 1169 place count 2219 transition count 1844
Deduced a syphon composed of 174 places in 5 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 4 with 348 rules applied. Total rules applied 1517 place count 2045 transition count 1844
Discarding 274 places :
Symmetric choice reduction at 4 with 274 rule applications. Total rules 1791 place count 1771 transition count 1570
Iterating global reduction 4 with 274 rules applied. Total rules applied 2065 place count 1771 transition count 1570
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 2065 place count 1771 transition count 1476
Deduced a syphon composed of 94 places in 8 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 2253 place count 1677 transition count 1476
Performed 605 Post agglomeration using F-continuation condition.Transition count delta: 605
Deduced a syphon composed of 605 places in 6 ms
Reduce places removed 605 places and 0 transitions.
Iterating global reduction 4 with 1210 rules applied. Total rules applied 3463 place count 1072 transition count 871
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 3639 place count 984 transition count 912
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3640 place count 984 transition count 911
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3648 place count 984 transition count 903
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3656 place count 976 transition count 903
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 3690 place count 976 transition count 903
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3692 place count 976 transition count 903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3693 place count 975 transition count 902
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3695 place count 973 transition count 902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3695 place count 973 transition count 901
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3697 place count 972 transition count 901
Applied a total of 3697 rules in 1029 ms. Remains 972 /2803 variables (removed 1831) and now considering 901/2603 (removed 1702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1029 ms. Remains : 972/2803 places, 901/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 10) seen :3
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) 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 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 901 rows 972 cols
[2023-03-23 09:09:01] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-23 09:09:02] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 09:09:02] [INFO ] [Nat]Absence check using 359 positive place invariants in 129 ms returned sat
[2023-03-23 09:09:03] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 09:09:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 09:09:04] [INFO ] After 668ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 09:09:04] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2023-03-23 09:09:04] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-23 09:09:05] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-23 09:09:05] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2023-03-23 09:09:05] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2023-03-23 09:09:05] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2023-03-23 09:09:05] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2023-03-23 09:09:05] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-23 09:09:06] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2023-03-23 09:09:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1693 ms
[2023-03-23 09:09:06] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 1 ms to minimize.
[2023-03-23 09:09:06] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2023-03-23 09:09:07] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2023-03-23 09:09:07] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 2 ms to minimize.
[2023-03-23 09:09:07] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2023-03-23 09:09:07] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-23 09:09:07] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2023-03-23 09:09:08] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2023-03-23 09:09:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1734 ms
[2023-03-23 09:09:08] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-23 09:09:08] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-23 09:09:08] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-23 09:09:08] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-23 09:09:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 797 ms
[2023-03-23 09:09:09] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-23 09:09:09] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-23 09:09:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2023-03-23 09:09:09] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-23 09:09:09] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-23 09:09:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2023-03-23 09:09:09] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-23 09:09:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-23 09:09:10] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2023-03-23 09:09:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-23 09:09:10] [INFO ] After 6597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 607 ms.
[2023-03-23 09:09:10] [INFO ] After 8774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 112 ms.
Support contains 120 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 901/901 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 972 transition count 891
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 962 transition count 891
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 20 place count 962 transition count 877
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 48 place count 948 transition count 877
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 80 place count 932 transition count 861
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 94 place count 925 transition count 865
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 919 transition count 859
Applied a total of 100 rules in 85 ms. Remains 919 /972 variables (removed 53) and now considering 859/901 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 919/972 places, 859/901 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) 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 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 859 rows 919 cols
[2023-03-23 09:09:11] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-23 09:09:12] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 09:09:12] [INFO ] [Nat]Absence check using 359 positive place invariants in 87 ms returned sat
[2023-03-23 09:09:13] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-23 09:09:13] [INFO ] After 481ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:13] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2023-03-23 09:09:13] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-23 09:09:14] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-23 09:09:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 499 ms
[2023-03-23 09:09:14] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 1 ms to minimize.
[2023-03-23 09:09:14] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-23 09:09:14] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 13 ms to minimize.
[2023-03-23 09:09:15] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-23 09:09:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1158 ms
[2023-03-23 09:09:15] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2023-03-23 09:09:15] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2023-03-23 09:09:15] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-23 09:09:16] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-23 09:09:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 716 ms
[2023-03-23 09:09:16] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-23 09:09:16] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-23 09:09:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2023-03-23 09:09:16] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2023-03-23 09:09:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-23 09:09:17] [INFO ] After 3978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 463 ms.
[2023-03-23 09:09:17] [INFO ] After 5525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 140 ms.
Support contains 61 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 859/859 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 919 transition count 846
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 906 transition count 845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 905 transition count 845
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 28 place count 905 transition count 828
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 62 place count 888 transition count 828
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 887 transition count 827
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 887 transition count 827
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 130 place count 854 transition count 794
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 152 place count 843 transition count 806
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 843 transition count 805
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 842 transition count 805
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 842 transition count 805
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 162 place count 835 transition count 798
Applied a total of 162 rules in 125 ms. Remains 835 /919 variables (removed 84) and now considering 798/859 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 835/919 places, 798/859 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 120012 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 120012 steps, saw 88891 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 798 rows 835 cols
[2023-03-23 09:09:21] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-23 09:09:21] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 09:09:21] [INFO ] [Nat]Absence check using 359 positive place invariants in 88 ms returned sat
[2023-03-23 09:09:22] [INFO ] After 684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:22] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 09:09:23] [INFO ] After 454ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:23] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-23 09:09:23] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-03-23 09:09:23] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-23 09:09:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 434 ms
[2023-03-23 09:09:23] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2023-03-23 09:09:23] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2023-03-23 09:09:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2023-03-23 09:09:24] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-23 09:09:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-23 09:09:24] [INFO ] After 2158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 378 ms.
[2023-03-23 09:09:25] [INFO ] After 3606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 237 ms.
Support contains 61 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 798/798 transitions.
Applied a total of 0 rules in 15 ms. Remains 835 /835 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 835/835 places, 798/798 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 798/798 transitions.
Applied a total of 0 rules in 15 ms. Remains 835 /835 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2023-03-23 09:09:25] [INFO ] Invariant cache hit.
[2023-03-23 09:09:25] [INFO ] Implicit Places using invariants in 419 ms returned [824]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 421 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 834/835 places, 798/798 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 833 transition count 797
Applied a total of 2 rules in 27 ms. Remains 833 /834 variables (removed 1) and now considering 797/798 (removed 1) transitions.
// Phase 1: matrix 797 rows 833 cols
[2023-03-23 09:09:25] [INFO ] Computed 358 place invariants in 5 ms
[2023-03-23 09:09:26] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-23 09:09:26] [INFO ] Invariant cache hit.
[2023-03-23 09:09:26] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 09:09:27] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 833/835 places, 797/798 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2448 ms. Remains : 833/835 places, 797/798 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 127239 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127239 steps, saw 92355 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 09:09:31] [INFO ] Invariant cache hit.
[2023-03-23 09:09:31] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 09:09:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2023-03-23 09:09:32] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:32] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 09:09:32] [INFO ] After 407ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:33] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-23 09:09:33] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-03-23 09:09:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-23 09:09:34] [INFO ] After 1495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 487 ms.
[2023-03-23 09:09:34] [INFO ] After 2954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 187 ms.
Support contains 61 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 797/797 transitions.
Applied a total of 0 rules in 16 ms. Remains 833 /833 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 833/833 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 797/797 transitions.
Applied a total of 0 rules in 16 ms. Remains 833 /833 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2023-03-23 09:09:34] [INFO ] Invariant cache hit.
[2023-03-23 09:09:35] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-23 09:09:35] [INFO ] Invariant cache hit.
[2023-03-23 09:09:35] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 09:09:36] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
[2023-03-23 09:09:36] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-23 09:09:36] [INFO ] Invariant cache hit.
[2023-03-23 09:09:37] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2391 ms. Remains : 833/833 places, 797/797 transitions.
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 95 place count 833 transition count 797
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 833 transition count 794
Applied a total of 98 rules in 44 ms. Remains 833 /833 variables (removed 0) and now considering 794/797 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 794 rows 833 cols
[2023-03-23 09:09:37] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-23 09:09:37] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 09:09:37] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2023-03-23 09:09:38] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 09:09:38] [INFO ] After 388ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:38] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-23 09:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-03-23 09:09:39] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2023-03-23 09:09:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-23 09:09:39] [INFO ] After 1477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 415 ms.
[2023-03-23 09:09:40] [INFO ] After 2738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-23 09:09:40] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-23 09:09:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 833 places, 797 transitions and 3729 arcs took 4 ms.
[2023-03-23 09:09:40] [INFO ] Flatten gal took : 98 ms
Total runtime 68682 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 040B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 833 places, 797 transitions, 3729 arcs.
Final Score: 14672.628
Took : 35 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679562616610

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 5592:
syntax error

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-040B"
export BK_EXAMINATION="ReachabilityFireability"
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-040B, examination is ReachabilityFireability"
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-167903718600319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;