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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 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 512K 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-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679561077652

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:44:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 08:44:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:44:39] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-23 08:44:39] [INFO ] Transformed 2103 places.
[2023-03-23 08:44:39] [INFO ] Transformed 1953 transitions.
[2023-03-23 08:44:39] [INFO ] Found NUPN structural information;
[2023-03-23 08:44:39] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 15) seen :10
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-23 08:44:40] [INFO ] Computed 271 place invariants in 35 ms
[2023-03-23 08:44:41] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 08:44:42] [INFO ] [Nat]Absence check using 271 positive place invariants in 127 ms returned sat
[2023-03-23 08:44:45] [INFO ] After 3463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 08:44:46] [INFO ] Deduced a trap composed of 21 places in 756 ms of which 13 ms to minimize.
[2023-03-23 08:44:47] [INFO ] Deduced a trap composed of 18 places in 1031 ms of which 3 ms to minimize.
[2023-03-23 08:44:48] [INFO ] Deduced a trap composed of 19 places in 557 ms of which 2 ms to minimize.
[2023-03-23 08:44:50] [INFO ] Deduced a trap composed of 28 places in 1274 ms of which 5 ms to minimize.
[2023-03-23 08:44:51] [INFO ] Deduced a trap composed of 18 places in 954 ms of which 1 ms to minimize.
[2023-03-23 08:44:51] [INFO ] Deduced a trap composed of 31 places in 672 ms of which 1 ms to minimize.
[2023-03-23 08:44:52] [INFO ] Deduced a trap composed of 45 places in 581 ms of which 4 ms to minimize.
[2023-03-23 08:44:53] [INFO ] Deduced a trap composed of 37 places in 775 ms of which 1 ms to minimize.
[2023-03-23 08:44:54] [INFO ] Deduced a trap composed of 28 places in 658 ms of which 3 ms to minimize.
[2023-03-23 08:44:54] [INFO ] Deduced a trap composed of 28 places in 597 ms of which 2 ms to minimize.
[2023-03-23 08:44:55] [INFO ] Deduced a trap composed of 29 places in 528 ms of which 1 ms to minimize.
[2023-03-23 08:44:56] [INFO ] Deduced a trap composed of 19 places in 550 ms of which 2 ms to minimize.
[2023-03-23 08:44:56] [INFO ] Deduced a trap composed of 50 places in 519 ms of which 1 ms to minimize.
[2023-03-23 08:44:57] [INFO ] Deduced a trap composed of 27 places in 526 ms of which 2 ms to minimize.
[2023-03-23 08:44:58] [INFO ] Deduced a trap composed of 28 places in 677 ms of which 1 ms to minimize.
[2023-03-23 08:44:58] [INFO ] Deduced a trap composed of 22 places in 631 ms of which 2 ms to minimize.
[2023-03-23 08:44:59] [INFO ] Deduced a trap composed of 35 places in 583 ms of which 1 ms to minimize.
[2023-03-23 08:45:00] [INFO ] Deduced a trap composed of 26 places in 583 ms of which 1 ms to minimize.
[2023-03-23 08:45:00] [INFO ] Deduced a trap composed of 26 places in 514 ms of which 1 ms to minimize.
[2023-03-23 08:45:01] [INFO ] Deduced a trap composed of 26 places in 631 ms of which 2 ms to minimize.
[2023-03-23 08:45:02] [INFO ] Deduced a trap composed of 38 places in 497 ms of which 1 ms to minimize.
[2023-03-23 08:45:02] [INFO ] Deduced a trap composed of 22 places in 601 ms of which 1 ms to minimize.
[2023-03-23 08:45:03] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 2 ms to minimize.
[2023-03-23 08:45:03] [INFO ] Deduced a trap composed of 22 places in 458 ms of which 2 ms to minimize.
[2023-03-23 08:45:04] [INFO ] Deduced a trap composed of 33 places in 495 ms of which 1 ms to minimize.
[2023-03-23 08:45:05] [INFO ] Deduced a trap composed of 24 places in 513 ms of which 1 ms to minimize.
[2023-03-23 08:45:05] [INFO ] Deduced a trap composed of 24 places in 433 ms of which 1 ms to minimize.
[2023-03-23 08:45:06] [INFO ] Deduced a trap composed of 30 places in 458 ms of which 2 ms to minimize.
[2023-03-23 08:45:06] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 2 ms to minimize.
[2023-03-23 08:45:08] [INFO ] Deduced a trap composed of 13 places in 1605 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 08:45:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 08:45:08] [INFO ] After 26631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 238 ms.
Support contains 113 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2103 transition count 1516
Reduce places removed 437 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 439 rules applied. Total rules applied 876 place count 1666 transition count 1514
Reduce places removed 1 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 30 rules applied. Total rules applied 906 place count 1665 transition count 1485
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 935 place count 1636 transition count 1485
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 935 place count 1636 transition count 1360
Deduced a syphon composed of 125 places in 3 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1185 place count 1511 transition count 1360
Discarding 188 places :
Symmetric choice reduction at 4 with 188 rule applications. Total rules 1373 place count 1323 transition count 1172
Iterating global reduction 4 with 188 rules applied. Total rules applied 1561 place count 1323 transition count 1172
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 1561 place count 1323 transition count 1098
Deduced a syphon composed of 74 places in 5 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 1709 place count 1249 transition count 1098
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 2 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 4 with 900 rules applied. Total rules applied 2609 place count 799 transition count 648
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2763 place count 722 transition count 688
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 722 transition count 686
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2767 place count 720 transition count 686
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 2793 place count 720 transition count 686
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2794 place count 719 transition count 685
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2796 place count 717 transition count 685
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2796 place count 717 transition count 684
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2798 place count 716 transition count 684
Applied a total of 2798 rules in 629 ms. Remains 716 /2103 variables (removed 1387) and now considering 684/1953 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 629 ms. Remains : 716/2103 places, 684/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 125445 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125445 steps, saw 71076 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 684 rows 716 cols
[2023-03-23 08:45:12] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-23 08:45:12] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 08:45:13] [INFO ] [Nat]Absence check using 269 positive place invariants in 45 ms returned sat
[2023-03-23 08:45:14] [INFO ] After 718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 08:45:14] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-23 08:45:14] [INFO ] After 546ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 08:45:14] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 1 ms to minimize.
[2023-03-23 08:45:15] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2023-03-23 08:45:15] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 1 ms to minimize.
[2023-03-23 08:45:15] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 13 ms to minimize.
[2023-03-23 08:45:15] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2023-03-23 08:45:15] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-23 08:45:16] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2023-03-23 08:45:16] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2023-03-23 08:45:16] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2023-03-23 08:45:16] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2023-03-23 08:45:16] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2023-03-23 08:45:16] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-23 08:45:17] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2023-03-23 08:45:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2602 ms
[2023-03-23 08:45:17] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 13 ms to minimize.
[2023-03-23 08:45:17] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2023-03-23 08:45:18] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2023-03-23 08:45:18] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-23 08:45:18] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2023-03-23 08:45:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1043 ms
[2023-03-23 08:45:19] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 0 ms to minimize.
[2023-03-23 08:45:19] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 1 ms to minimize.
[2023-03-23 08:45:19] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-23 08:45:19] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-23 08:45:19] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-23 08:45:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 981 ms
[2023-03-23 08:45:19] [INFO ] After 5723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 554 ms.
[2023-03-23 08:45:20] [INFO ] After 7420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 155 ms.
Support contains 113 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 53 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 716/716 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 52 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2023-03-23 08:45:20] [INFO ] Invariant cache hit.
[2023-03-23 08:45:21] [INFO ] Implicit Places using invariants in 484 ms returned [702]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 500 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 715/716 places, 684/684 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 714 transition count 683
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 714 transition count 683
Applied a total of 2 rules in 47 ms. Remains 714 /715 variables (removed 1) and now considering 683/684 (removed 1) transitions.
// Phase 1: matrix 683 rows 714 cols
[2023-03-23 08:45:21] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-23 08:45:21] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-23 08:45:21] [INFO ] Invariant cache hit.
[2023-03-23 08:45:22] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-23 08:45:23] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 714/716 places, 683/684 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2706 ms. Remains : 714/716 places, 683/684 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 08:45:23] [INFO ] Invariant cache hit.
[2023-03-23 08:45:23] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:45:24] [INFO ] [Nat]Absence check using 268 positive place invariants in 62 ms returned sat
[2023-03-23 08:45:24] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:45:24] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-23 08:45:25] [INFO ] After 509ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:45:25] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 8 ms to minimize.
[2023-03-23 08:45:25] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 13 ms to minimize.
[2023-03-23 08:45:25] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2023-03-23 08:45:28] [INFO ] Deduced a trap composed of 6 places in 2483 ms of which 0 ms to minimize.
[2023-03-23 08:45:29] [INFO ] Deduced a trap composed of 7 places in 662 ms of which 1 ms to minimize.
[2023-03-23 08:45:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3823 ms
[2023-03-23 08:45:29] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-23 08:45:29] [INFO ] Deduced a trap composed of 3 places in 385 ms of which 1 ms to minimize.
[2023-03-23 08:45:30] [INFO ] Deduced a trap composed of 6 places in 458 ms of which 1 ms to minimize.
[2023-03-23 08:45:30] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-23 08:45:30] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 2 ms to minimize.
[2023-03-23 08:45:31] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-23 08:45:31] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 24 ms to minimize.
[2023-03-23 08:45:31] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2023-03-23 08:45:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2193 ms
[2023-03-23 08:45:31] [INFO ] After 6864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-23 08:45:32] [INFO ] After 8007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 111 ms.
Support contains 60 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 714 transition count 675
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 706 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 705 transition count 674
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 705 transition count 662
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 42 place count 693 transition count 662
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 692 transition count 661
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 692 transition count 661
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 44 place count 692 transition count 660
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 691 transition count 660
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 98 place count 665 transition count 634
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 116 place count 656 transition count 643
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 656 transition count 642
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 656 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 655 transition count 641
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 123 place count 655 transition count 641
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 134 place count 644 transition count 630
Applied a total of 134 rules in 161 ms. Remains 644 /714 variables (removed 70) and now considering 630/683 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 644/714 places, 630/683 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 143595 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143595 steps, saw 82452 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 630 rows 644 cols
[2023-03-23 08:45:35] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-23 08:45:35] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:45:36] [INFO ] [Nat]Absence check using 268 positive place invariants in 77 ms returned sat
[2023-03-23 08:45:36] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:45:36] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-23 08:45:37] [INFO ] After 290ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:45:37] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 13 ms to minimize.
[2023-03-23 08:45:37] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-23 08:45:37] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2023-03-23 08:45:37] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2023-03-23 08:45:38] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-23 08:45:38] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-23 08:45:38] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-23 08:45:38] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2023-03-23 08:45:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1428 ms
[2023-03-23 08:45:38] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-23 08:45:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-23 08:45:39] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-23 08:45:39] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2023-03-23 08:45:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2023-03-23 08:45:39] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2023-03-23 08:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-23 08:45:39] [INFO ] After 2745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-23 08:45:39] [INFO ] After 3883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 46 ms.
Support contains 60 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 630/630 transitions.
Applied a total of 0 rules in 12 ms. Remains 644 /644 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 644/644 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 630/630 transitions.
Applied a total of 0 rules in 10 ms. Remains 644 /644 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2023-03-23 08:45:39] [INFO ] Invariant cache hit.
[2023-03-23 08:45:40] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-23 08:45:40] [INFO ] Invariant cache hit.
[2023-03-23 08:45:40] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-23 08:45:41] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2023-03-23 08:45:41] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-23 08:45:41] [INFO ] Invariant cache hit.
[2023-03-23 08:45:41] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1841 ms. Remains : 644/644 places, 630/630 transitions.
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 0 with 67 rules applied. Total rules applied 67 place count 644 transition count 630
Applied a total of 67 rules in 22 ms. Remains 644 /644 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 630 rows 644 cols
[2023-03-23 08:45:41] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-23 08:45:41] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:45:42] [INFO ] [Nat]Absence check using 268 positive place invariants in 36 ms returned sat
[2023-03-23 08:45:42] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:45:42] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-23 08:45:42] [INFO ] After 236ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:45:43] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-23 08:45:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-23 08:45:43] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2023-03-23 08:45:43] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-23 08:45:43] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-23 08:45:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 528 ms
[2023-03-23 08:45:43] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-23 08:45:43] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2023-03-23 08:45:44] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2023-03-23 08:45:44] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-23 08:45:44] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-23 08:45:44] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-23 08:45:44] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-23 08:45:45] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-23 08:45:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1401 ms
[2023-03-23 08:45:45] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2023-03-23 08:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-23 08:45:45] [INFO ] After 2795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 248 ms.
[2023-03-23 08:45:45] [INFO ] After 3740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:45:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 24 ms.
[2023-03-23 08:45:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 644 places, 630 transitions and 2885 arcs took 4 ms.
[2023-03-23 08:45:46] [INFO ] Flatten gal took : 95 ms
Total runtime 66413 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 030B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 644 places, 630 transitions, 2885 arcs.
Final Score: 7433.92
Took : 28 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-030B-ReachabilityCardinality-00 (reachable &!potential( ( ( ( (tk(P333)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P333)) ) ) | ( ( (tk(P350)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P350)) ) ) )))
PROPERTY: ShieldIIPt-PT-030B-ReachabilityCardinality-02 (reachable & potential(( ( ( (tk(P287)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P287)) ) ) & ( ( (tk(P17)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P17)) ) ) )))
PROPERTY: ShieldIIPt-PT-030B-ReachabilityCardinality-07 (reachable & potential(( ( ( ( (tk(P295)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P295)) ) ) & ( ( ( ( (tk(P207)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P207)) ) ) | ( ( (tk(P289)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P289)) ) ) ) & ( ( ( (tk(P551)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P551)) ) ) | ( ( ( (tk(P399)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P399)) ) ) | ( ( (tk(P335)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P335)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P266)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P266)) ) ) | ( ( ( ( ( ( (tk(P427)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P427)) ) ) & ( ( (tk(P194)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P194)) ) ) ) & ( ( ( (tk(P473)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P473)) ) ) & ( ( (tk(P531)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P531)) ) ) ) ) & ( ( ( ( (tk(P258)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P258)) ) ) & ( ( ( (tk(P382)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P382)) ) ) | ( ( (tk(P570)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P570)) ) ) ) ) & ( ( ( ( ( (tk(P60)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P60)) ) ) | ( ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) | ( ( (tk(P170)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P170)) ) ) ) ) | ( ( ( (tk(P314)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P314)) ) ) | ( ( ( (tk(P235)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P235)) ) ) | ( ( (tk(P380)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P380)) ) ) ) ) ) & ( ( ( (tk(P626)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P626)) ) ) | ( ( ( ( (tk(P377)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P377)) ) ) & ( ( (tk(P241)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P241)) ) ) ) | ( ( ( (tk(P140)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P140)) ) ) & ( ( (tk(P177)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P177)) ) ) ) ) ) ) ) ) | ( ( ( (tk(P284)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P284)) ) ) & ( ( ( ( (tk(P310)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P310)) ) ) | ( ( (tk(P70)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P70)) ) ) ) | ( ( ( (tk(P144)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P144)) ) ) | ( ( ( (tk(P590)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P590)) ) ) & ( ( (tk(P260)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P260)) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) | ( ( (tk(P167)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P167)) ) ) ) | ( ( ( ( (tk(P80)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P80)) ) ) & ( ( (tk(P521)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P521)) ) ) ) | ( ( ( ( (tk(P232)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P232)) ) ) & ( ( (tk(P228)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P228)) ) ) ) & ( ( ( ( (tk(P608)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P608)) ) ) | ( ( (tk(P438)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P438)) ) ) ) & ( ( ( (tk(P397)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P397)) ) ) | ( ( (tk(P328)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P328)) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P226)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P226)) ) ) | ( ( ( (tk(P293)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P293)) ) ) & ( ( ( (tk(P412)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P412)) ) ) | ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) & ( ( (tk(P315)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P315)) ) ) ) ) ) ) & ( ( ( ( (tk(P40)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P40)) ) ) & ( ( ( ( (tk(P68)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P68)) ) ) & ( ( (tk(P541)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P541)) ) ) ) | ( ( ( (tk(P111)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P111)) ) ) & ( ( (tk(P309)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P309)) ) ) ) ) ) | ( ( ( (tk(P527)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P527)) ) ) & ( ( ( (tk(P40)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P40)) ) ) & ( ( ( (tk(P514)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P514)) ) ) | ( ( (tk(P465)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P465)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-030B-ReachabilityCardinality-11 (reachable & potential(( ( ( (tk(P337)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P337)) ) ) & ( ( (tk(P245)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P245)) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 1607832 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102624 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldIIPt-PT-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-oct2-167903718600302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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