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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 675K 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 ShieldIIPs-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679556742078

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=ShieldIIPs-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:32:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 07:32:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:32:24] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-23 07:32:24] [INFO ] Transformed 2403 places.
[2023-03-23 07:32:24] [INFO ] Transformed 2363 transitions.
[2023-03-23 07:32:24] [INFO ] Found NUPN structural information;
[2023-03-23 07:32:24] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 13) seen :11
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2023-03-23 07:32:25] [INFO ] Computed 361 place invariants in 25 ms
[2023-03-23 07:32:25] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 07:32:26] [INFO ] [Nat]Absence check using 361 positive place invariants in 272 ms returned sat
[2023-03-23 07:32:29] [INFO ] After 2544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:32:32] [INFO ] Deduced a trap composed of 31 places in 1121 ms of which 22 ms to minimize.
[2023-03-23 07:32:33] [INFO ] Deduced a trap composed of 25 places in 710 ms of which 28 ms to minimize.
[2023-03-23 07:32:34] [INFO ] Deduced a trap composed of 20 places in 829 ms of which 4 ms to minimize.
[2023-03-23 07:32:35] [INFO ] Deduced a trap composed of 21 places in 822 ms of which 9 ms to minimize.
[2023-03-23 07:32:36] [INFO ] Deduced a trap composed of 22 places in 806 ms of which 42 ms to minimize.
[2023-03-23 07:32:36] [INFO ] Deduced a trap composed of 29 places in 696 ms of which 2 ms to minimize.
[2023-03-23 07:32:37] [INFO ] Deduced a trap composed of 21 places in 659 ms of which 6 ms to minimize.
[2023-03-23 07:32:38] [INFO ] Deduced a trap composed of 20 places in 717 ms of which 1 ms to minimize.
[2023-03-23 07:32:39] [INFO ] Deduced a trap composed of 15 places in 858 ms of which 7 ms to minimize.
[2023-03-23 07:32:40] [INFO ] Deduced a trap composed of 31 places in 724 ms of which 3 ms to minimize.
[2023-03-23 07:32:41] [INFO ] Deduced a trap composed of 24 places in 680 ms of which 2 ms to minimize.
[2023-03-23 07:32:42] [INFO ] Deduced a trap composed of 21 places in 589 ms of which 1 ms to minimize.
[2023-03-23 07:32:42] [INFO ] Deduced a trap composed of 14 places in 680 ms of which 1 ms to minimize.
[2023-03-23 07:32:43] [INFO ] Deduced a trap composed of 23 places in 648 ms of which 2 ms to minimize.
[2023-03-23 07:32:44] [INFO ] Deduced a trap composed of 28 places in 559 ms of which 1 ms to minimize.
[2023-03-23 07:32:45] [INFO ] Deduced a trap composed of 32 places in 634 ms of which 2 ms to minimize.
[2023-03-23 07:32:45] [INFO ] Deduced a trap composed of 25 places in 551 ms of which 1 ms to minimize.
[2023-03-23 07:32:46] [INFO ] Deduced a trap composed of 26 places in 645 ms of which 2 ms to minimize.
[2023-03-23 07:32:47] [INFO ] Deduced a trap composed of 25 places in 578 ms of which 2 ms to minimize.
[2023-03-23 07:32:48] [INFO ] Deduced a trap composed of 17 places in 795 ms of which 2 ms to minimize.
[2023-03-23 07:32:49] [INFO ] Deduced a trap composed of 28 places in 711 ms of which 1 ms to minimize.
[2023-03-23 07:32:50] [INFO ] Deduced a trap composed of 21 places in 737 ms of which 1 ms to minimize.
[2023-03-23 07:32:50] [INFO ] Deduced a trap composed of 24 places in 664 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 07:32:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:32:50] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 151 ms.
Support contains 25 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 2403 transition count 2168
Reduce places removed 195 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 196 rules applied. Total rules applied 391 place count 2208 transition count 2167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 2207 transition count 2167
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 392 place count 2207 transition count 1968
Deduced a syphon composed of 199 places in 5 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 790 place count 2008 transition count 1968
Discarding 271 places :
Symmetric choice reduction at 3 with 271 rule applications. Total rules 1061 place count 1737 transition count 1697
Iterating global reduction 3 with 271 rules applied. Total rules applied 1332 place count 1737 transition count 1697
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 1332 place count 1737 transition count 1579
Deduced a syphon composed of 118 places in 6 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 1568 place count 1619 transition count 1579
Performed 591 Post agglomeration using F-continuation condition.Transition count delta: 591
Deduced a syphon composed of 591 places in 3 ms
Reduce places removed 591 places and 0 transitions.
Iterating global reduction 3 with 1182 rules applied. Total rules applied 2750 place count 1028 transition count 988
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 273 times.
Drop transitions removed 273 transitions
Iterating global reduction 3 with 273 rules applied. Total rules applied 3023 place count 1028 transition count 988
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3024 place count 1027 transition count 987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3025 place count 1026 transition count 987
Applied a total of 3025 rules in 852 ms. Remains 1026 /2403 variables (removed 1377) and now considering 987/2363 (removed 1376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 1026/2403 places, 987/2363 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 987 rows 1026 cols
[2023-03-23 07:32:52] [INFO ] Computed 360 place invariants in 31 ms
[2023-03-23 07:32:52] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:32:52] [INFO ] [Nat]Absence check using 359 positive place invariants in 156 ms returned sat
[2023-03-23 07:32:52] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 07:32:53] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:32:53] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-23 07:32:53] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-23 07:32:53] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2023-03-23 07:32:54] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2023-03-23 07:32:54] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-23 07:32:54] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-23 07:32:54] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2023-03-23 07:32:54] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-23 07:32:55] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2023-03-23 07:32:55] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-03-23 07:32:55] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 13 ms to minimize.
[2023-03-23 07:32:55] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-23 07:32:55] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2023-03-23 07:32:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2395 ms
[2023-03-23 07:32:55] [INFO ] After 3010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-23 07:32:55] [INFO ] After 3376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 23 out of 1026 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 987/987 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1026 transition count 987
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1025 transition count 986
Applied a total of 3 rules in 156 ms. Remains 1025 /1026 variables (removed 1) and now considering 986/987 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 1025/1026 places, 986/987 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 171799 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171799 steps, saw 105849 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 986 rows 1025 cols
[2023-03-23 07:32:59] [INFO ] Computed 360 place invariants in 68 ms
[2023-03-23 07:32:59] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:32:59] [INFO ] [Nat]Absence check using 359 positive place invariants in 70 ms returned sat
[2023-03-23 07:32:59] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-23 07:33:00] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:33:00] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 11 ms to minimize.
[2023-03-23 07:33:00] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-03-23 07:33:00] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-23 07:33:00] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-23 07:33:00] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2023-03-23 07:33:00] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-03-23 07:33:01] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-03-23 07:33:01] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-23 07:33:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1085 ms
[2023-03-23 07:33:01] [INFO ] After 1639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-23 07:33:01] [INFO ] After 1930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 23 out of 1025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 26 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1025/1025 places, 986/986 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 23 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
[2023-03-23 07:33:01] [INFO ] Invariant cache hit.
[2023-03-23 07:33:02] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-23 07:33:02] [INFO ] Invariant cache hit.
[2023-03-23 07:33:03] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2023-03-23 07:33:03] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-23 07:33:03] [INFO ] Invariant cache hit.
[2023-03-23 07:33:04] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3295 ms. Remains : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 22 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-23 07:33:04] [INFO ] Invariant cache hit.
[2023-03-23 07:33:04] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:33:05] [INFO ] [Nat]Absence check using 359 positive place invariants in 62 ms returned sat
[2023-03-23 07:33:05] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 07:33:05] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:33:05] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-23 07:33:05] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2023-03-23 07:33:05] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:33:06] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-23 07:33:06] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 9 ms to minimize.
[2023-03-23 07:33:06] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-03-23 07:33:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 944 ms
[2023-03-23 07:33:06] [INFO ] After 1465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-23 07:33:06] [INFO ] After 1739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:33:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-23 07:33:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1025 places, 986 transitions and 4642 arcs took 13 ms.
[2023-03-23 07:33:06] [INFO ] Flatten gal took : 120 ms
Total runtime 42901 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 040B
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: 1025 places, 986 transitions, 4642 arcs.
Final Score: 10912.872
Took : 39 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-040B-ReachabilityCardinality-00 (reachable & potential(( ( ( ( ( (tk(P145)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P145)) ) ) & ( ( ( (tk(P786)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P786)) ) ) & ( ( (tk(P968)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P968)) ) ) ) ) & ( ( ( (tk(P848)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P848)) ) ) & ( ( ( (tk(P323)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P323)) ) ) & ( ( (tk(P694)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P694)) ) ) ) ) ) & ( ( ( ( ( ( (tk(P588)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P588)) ) ) | ( ( (tk(P690)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P690)) ) ) ) | ( ( ( (tk(P963)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P963)) ) ) | ( ( ( (tk(P812)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P812)) ) ) & ( ( ( (tk(P640)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P640)) ) ) & ( ( (tk(P857)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P857)) ) ) ) ) ) ) & ( ( ( ( (tk(P507)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P507)) ) ) | ( ( ( (tk(P699)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P699)) ) ) | ( ( (tk(P883)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P883)) ) ) ) ) & ( ( ( (tk(P11)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P11)) ) ) | ( ( (tk(P269)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P269)) ) ) ) ) ) & ( ( ( ( (tk(P654)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P654)) ) ) | ( ( (tk(P711)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P711)) ) ) ) & ( ( ( ( (tk(P521)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P521)) ) ) | ( ( (tk(P877)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P877)) ) ) ) & ( ( ( (tk(P426)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P426)) ) ) | ( ( (tk(P286)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P286)) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6755848 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098340 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040B"
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 ShieldIIPs-PT-040B, 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-167903718400142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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