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

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679562473814

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-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:07:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 09:07:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:07:56] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-23 09:07:56] [INFO ] Transformed 2803 places.
[2023-03-23 09:07:56] [INFO ] Transformed 2603 transitions.
[2023-03-23 09:07:56] [INFO ] Found NUPN structural information;
[2023-03-23 09:07:56] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 12) seen :6
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-23 09:07:58] [INFO ] Computed 361 place invariants in 29 ms
[2023-03-23 09:07:59] [INFO ] After 1486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 09:08:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 228 ms returned sat
[2023-03-23 09:08:07] [INFO ] After 6088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 09:08:08] [INFO ] Deduced a trap composed of 24 places in 1296 ms of which 30 ms to minimize.
[2023-03-23 09:08:10] [INFO ] Deduced a trap composed of 23 places in 1539 ms of which 17 ms to minimize.
[2023-03-23 09:08:13] [INFO ] Deduced a trap composed of 18 places in 2761 ms of which 15 ms to minimize.
[2023-03-23 09:08:14] [INFO ] Deduced a trap composed of 21 places in 1137 ms of which 5 ms to minimize.
[2023-03-23 09:08:15] [INFO ] Deduced a trap composed of 21 places in 894 ms of which 18 ms to minimize.
[2023-03-23 09:08:16] [INFO ] Deduced a trap composed of 17 places in 989 ms of which 3 ms to minimize.
[2023-03-23 09:08:17] [INFO ] Deduced a trap composed of 18 places in 895 ms of which 3 ms to minimize.
[2023-03-23 09:08:21] [INFO ] Deduced a trap composed of 31 places in 2927 ms of which 5 ms to minimize.
[2023-03-23 09:08:23] [INFO ] Deduced a trap composed of 28 places in 1930 ms of which 2 ms to minimize.
[2023-03-23 09:08:25] [INFO ] Deduced a trap composed of 23 places in 2307 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 09:08:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 09:08:25] [INFO ] After 25981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 905 ms.
Support contains 36 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 654 transitions
Trivial Post-agglo rules discarded 654 transitions
Performed 654 trivial Post agglomeration. Transition count delta: 654
Iterating post reduction 0 with 654 rules applied. Total rules applied 654 place count 2803 transition count 1949
Reduce places removed 654 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 656 rules applied. Total rules applied 1310 place count 2149 transition count 1947
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 1321 place count 2148 transition count 1937
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1331 place count 2138 transition count 1937
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 165 Pre rules applied. Total rules applied 1331 place count 2138 transition count 1772
Deduced a syphon composed of 165 places in 5 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 1661 place count 1973 transition count 1772
Discarding 271 places :
Symmetric choice reduction at 4 with 271 rule applications. Total rules 1932 place count 1702 transition count 1501
Iterating global reduction 4 with 271 rules applied. Total rules applied 2203 place count 1702 transition count 1501
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 113 Pre rules applied. Total rules applied 2203 place count 1702 transition count 1388
Deduced a syphon composed of 113 places in 7 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 2429 place count 1589 transition count 1388
Performed 663 Post agglomeration using F-continuation condition.Transition count delta: 663
Deduced a syphon composed of 663 places in 2 ms
Reduce places removed 663 places and 0 transitions.
Iterating global reduction 4 with 1326 rules applied. Total rules applied 3755 place count 926 transition count 725
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3957 place count 825 transition count 789
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 3985 place count 811 transition count 798
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3986 place count 811 transition count 797
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3987 place count 811 transition count 796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3988 place count 810 transition count 796
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 4028 place count 810 transition count 796
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4029 place count 809 transition count 795
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4031 place count 807 transition count 795
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4031 place count 807 transition count 794
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 4033 place count 806 transition count 794
Applied a total of 4033 rules in 824 ms. Remains 806 /2803 variables (removed 1997) and now considering 794/2603 (removed 1809) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 824 ms. Remains : 806/2803 places, 794/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 102566 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102566 steps, saw 76950 distinct states, run finished after 3005 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 794 rows 806 cols
[2023-03-23 09:08:30] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-23 09:08:31] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 09:08:31] [INFO ] [Nat]Absence check using 359 positive place invariants in 56 ms returned sat
[2023-03-23 09:08:32] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 09:08:32] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-23 09:08:32] [INFO ] After 349ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 09:08:32] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-03-23 09:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-23 09:08:33] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-23 09:08:33] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-03-23 09:08:33] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-23 09:08:33] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2023-03-23 09:08:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 728 ms
[2023-03-23 09:08:33] [INFO ] After 1649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-03-23 09:08:33] [INFO ] After 2792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 98 ms.
Support contains 36 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 794/794 transitions.
Applied a total of 0 rules in 30 ms. Remains 806 /806 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 806/806 places, 794/794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 794/794 transitions.
Applied a total of 0 rules in 35 ms. Remains 806 /806 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2023-03-23 09:08:34] [INFO ] Invariant cache hit.
[2023-03-23 09:08:34] [INFO ] Implicit Places using invariants in 471 ms returned [793]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 473 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 805/806 places, 794/794 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 804 transition count 793
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 804 transition count 793
Applied a total of 2 rules in 43 ms. Remains 804 /805 variables (removed 1) and now considering 793/794 (removed 1) transitions.
// Phase 1: matrix 793 rows 804 cols
[2023-03-23 09:08:34] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-23 09:08:35] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-23 09:08:35] [INFO ] Invariant cache hit.
[2023-03-23 09:08:35] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-23 09:08:36] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 804/806 places, 793/794 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2647 ms. Remains : 804/806 places, 793/794 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) 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 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 98361 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98361 steps, saw 72277 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-23 09:08:40] [INFO ] Invariant cache hit.
[2023-03-23 09:08:40] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 09:08:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 246 ms returned sat
[2023-03-23 09:08:42] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 09:08:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-23 09:08:42] [INFO ] After 348ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 09:08:42] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-23 09:08:42] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-23 09:08:43] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-03-23 09:08:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 551 ms
[2023-03-23 09:08:43] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2023-03-23 09:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-23 09:08:43] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-23 09:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-23 09:08:43] [INFO ] After 1719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-23 09:08:44] [INFO ] After 3414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 91 ms.
Support contains 36 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 793/793 transitions.
Applied a total of 0 rules in 24 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 804/804 places, 793/793 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 793/793 transitions.
Applied a total of 0 rules in 32 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2023-03-23 09:08:44] [INFO ] Invariant cache hit.
[2023-03-23 09:08:44] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-23 09:08:44] [INFO ] Invariant cache hit.
[2023-03-23 09:08:45] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-23 09:08:46] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
[2023-03-23 09:08:46] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-23 09:08:46] [INFO ] Invariant cache hit.
[2023-03-23 09:08:46] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2744 ms. Remains : 804/804 places, 793/793 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 804 transition count 793
Applied a total of 82 rules in 38 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 793 rows 804 cols
[2023-03-23 09:08:47] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-23 09:08:47] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 09:08:47] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-23 09:08:48] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 09:08:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-23 09:08:48] [INFO ] After 347ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 09:08:48] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 1 ms to minimize.
[2023-03-23 09:08:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-23 09:08:49] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2023-03-23 09:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-23 09:08:49] [INFO ] After 1246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 359 ms.
[2023-03-23 09:08:49] [INFO ] After 2416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-23 09:08:49] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-23 09:08:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 804 places, 793 transitions and 3794 arcs took 11 ms.
[2023-03-23 09:08:49] [INFO ] Flatten gal took : 95 ms
Total runtime 53456 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 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: 804 places, 793 transitions, 3794 arcs.
Final Score: 6996.26
Took : 35 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-040B-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (tk(P49)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P49)) ) ) | ( ( ( (tk(P621)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P621)) ) ) | ( ( (tk(P185)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P185)) ) ) ) ) | ( ( ( ( (tk(P771)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P771)) ) ) | ( ( ( (tk(P664)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P664)) ) ) & ( ( (tk(P385)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P385)) ) ) ) ) | ( ( ( ( (tk(P344)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P344)) ) ) & ( ( (tk(P649)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P649)) ) ) ) | ( ( ( (tk(P802)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P802)) ) ) & ( ( (tk(P24)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P24)) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-040B-ReachabilityCardinality-03 (reachable & potential(( ( (tk(P526)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P526)) ) )))
PROPERTY: ShieldIIPt-PT-040B-ReachabilityCardinality-05 (reachable & potential(( ( ( ( (tk(P221)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P221)) ) ) & ( ( (tk(P322)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P322)) ) ) ) & ( ( ( (tk(P754)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P754)) ) ) & ( ( ( (tk(P2)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2)) ) ) & ( ( ( (tk(P504)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P504)) ) ) | ( ( ( (tk(P327)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P327)) ) ) | ( ( (tk(P767)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P767)) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-040B-ReachabilityCardinality-06 (reachable & potential(( ( (tk(P292)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P292)) ) )))
PROPERTY: ShieldIIPt-PT-040B-ReachabilityCardinality-12 (reachable & potential(( ( ( ( (tk(P306)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P306)) ) ) & ( ( ( (tk(P262)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P262)) ) ) & ( ( (tk(P562)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P562)) ) ) ) ) & ( ( ( (tk(P383)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P383)) ) ) & ( ( ( (tk(P15)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P15)) ) ) & ( ( ( ( (tk(P19)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P19)) ) ) & ( ( (tk(P564)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P564)) ) ) ) | ( ( ( ( (tk(P125)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P125)) ) ) & ( ( ( (tk(P769)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P769)) ) ) | ( ( ( (tk(P365)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P365)) ) ) | ( ( (tk(P234)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P234)) ) ) ) ) ) | ( ( ( (tk(P719)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P719)) ) ) & ( ( ( (tk(P202)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P202)) ) ) | ( ( ( ( (tk(P664)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P664)) ) ) & ( ( (tk(P60)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P60)) ) ) ) | ( ( ( (tk(P199)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P199)) ) ) & ( ( ( (tk(P461)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P461)) ) ) & ( ( (tk(P549)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P549)) ) ) ) ) ) ) ) ) ) ) ) )))
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679562578141

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

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="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-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-167903718600318"
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 [ "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 ;