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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 1.9M 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 ShieldPPPt-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679579722997

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=ShieldPPPt-PT-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:55:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 13:55:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:55:25] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2023-03-23 13:55:25] [INFO ] Transformed 7803 places.
[2023-03-23 13:55:25] [INFO ] Transformed 7103 transitions.
[2023-03-23 13:55:25] [INFO ] Found NUPN structural information;
[2023-03-23 13:55:25] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 788 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 13) seen :4
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-23 13:55:27] [INFO ] Computed 1101 place invariants in 68 ms
[2023-03-23 13:55:30] [INFO ] After 2699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 13:55:33] [INFO ] [Nat]Absence check using 1101 positive place invariants in 784 ms returned sat
[2023-03-23 13:55:45] [INFO ] After 10361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 13:55:50] [INFO ] Deduced a trap composed of 26 places in 3896 ms of which 13 ms to minimize.
[2023-03-23 13:55:54] [INFO ] Deduced a trap composed of 23 places in 3898 ms of which 6 ms to minimize.
[2023-03-23 13:55:58] [INFO ] Deduced a trap composed of 22 places in 3429 ms of which 7 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 13:55:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:55:58] [INFO ] After 28243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3116 ms.
Support contains 112 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1824 transitions
Trivial Post-agglo rules discarded 1824 transitions
Performed 1824 trivial Post agglomeration. Transition count delta: 1824
Iterating post reduction 0 with 1824 rules applied. Total rules applied 1824 place count 7803 transition count 5279
Reduce places removed 1824 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 1826 rules applied. Total rules applied 3650 place count 5979 transition count 5277
Reduce places removed 1 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 34 rules applied. Total rules applied 3684 place count 5978 transition count 5244
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 3717 place count 5945 transition count 5244
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 402 Pre rules applied. Total rules applied 3717 place count 5945 transition count 4842
Deduced a syphon composed of 402 places in 30 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 4 with 804 rules applied. Total rules applied 4521 place count 5543 transition count 4842
Discarding 679 places :
Symmetric choice reduction at 4 with 679 rule applications. Total rules 5200 place count 4864 transition count 4163
Iterating global reduction 4 with 679 rules applied. Total rules applied 5879 place count 4864 transition count 4163
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 281 Pre rules applied. Total rules applied 5879 place count 4864 transition count 3882
Deduced a syphon composed of 281 places in 20 ms
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 4 with 562 rules applied. Total rules applied 6441 place count 4583 transition count 3882
Performed 1644 Post agglomeration using F-continuation condition.Transition count delta: 1644
Deduced a syphon composed of 1644 places in 40 ms
Reduce places removed 1644 places and 0 transitions.
Iterating global reduction 4 with 3288 rules applied. Total rules applied 9729 place count 2939 transition count 2238
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 12 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9931 place count 2838 transition count 2238
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10133 place count 2737 transition count 2238
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 6 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 10289 place count 2659 transition count 2238
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 10296 place count 2659 transition count 2231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 10303 place count 2652 transition count 2231
Partial Free-agglomeration rule applied 290 times.
Drop transitions removed 290 transitions
Iterating global reduction 5 with 290 rules applied. Total rules applied 10593 place count 2652 transition count 2231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10594 place count 2651 transition count 2230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10595 place count 2650 transition count 2230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10595 place count 2650 transition count 2228
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10599 place count 2648 transition count 2228
Applied a total of 10599 rules in 3316 ms. Remains 2648 /7803 variables (removed 5155) and now considering 2228/7103 (removed 4875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3317 ms. Remains : 2648/7803 places, 2228/7103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 43647 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 43647 steps, saw 28231 distinct states, run finished after 3003 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2228 rows 2648 cols
[2023-03-23 13:56:09] [INFO ] Computed 1100 place invariants in 12 ms
[2023-03-23 13:56:10] [INFO ] After 927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 13:56:11] [INFO ] [Nat]Absence check using 1100 positive place invariants in 297 ms returned sat
[2023-03-23 13:56:14] [INFO ] After 3312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 13:56:14] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-23 13:56:17] [INFO ] After 2319ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 13:56:17] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 2 ms to minimize.
[2023-03-23 13:56:18] [INFO ] Deduced a trap composed of 7 places in 415 ms of which 2 ms to minimize.
[2023-03-23 13:56:18] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 0 ms to minimize.
[2023-03-23 13:56:19] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2023-03-23 13:56:19] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 2 ms to minimize.
[2023-03-23 13:56:20] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 1 ms to minimize.
[2023-03-23 13:56:20] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2023-03-23 13:56:20] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2023-03-23 13:56:21] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-23 13:56:21] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 0 ms to minimize.
[2023-03-23 13:56:21] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2023-03-23 13:56:22] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 1 ms to minimize.
[2023-03-23 13:56:22] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 0 ms to minimize.
[2023-03-23 13:56:23] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 0 ms to minimize.
[2023-03-23 13:56:23] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2023-03-23 13:56:24] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2023-03-23 13:56:24] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 1 ms to minimize.
[2023-03-23 13:56:24] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2023-03-23 13:56:25] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 0 ms to minimize.
[2023-03-23 13:56:25] [INFO ] Deduced a trap composed of 6 places in 399 ms of which 0 ms to minimize.
[2023-03-23 13:56:26] [INFO ] Deduced a trap composed of 8 places in 377 ms of which 1 ms to minimize.
[2023-03-23 13:56:27] [INFO ] Deduced a trap composed of 11 places in 557 ms of which 1 ms to minimize.
[2023-03-23 13:56:27] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 1 ms to minimize.
[2023-03-23 13:56:27] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10230 ms
[2023-03-23 13:56:28] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2023-03-23 13:56:28] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-23 13:56:29] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 1 ms to minimize.
[2023-03-23 13:56:29] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2023-03-23 13:56:30] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-23 13:56:30] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 0 ms to minimize.
[2023-03-23 13:56:30] [INFO ] Deduced a trap composed of 12 places in 355 ms of which 1 ms to minimize.
[2023-03-23 13:56:31] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 1 ms to minimize.
[2023-03-23 13:56:31] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-23 13:56:32] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 1 ms to minimize.
[2023-03-23 13:56:32] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 0 ms to minimize.
[2023-03-23 13:56:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4562 ms
[2023-03-23 13:56:33] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 0 ms to minimize.
[2023-03-23 13:56:34] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2023-03-23 13:56:34] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 0 ms to minimize.
[2023-03-23 13:56:34] [INFO ] Deduced a trap composed of 8 places in 372 ms of which 0 ms to minimize.
[2023-03-23 13:56:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1854 ms
[2023-03-23 13:56:35] [INFO ] After 20232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 13:56:35] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1639 ms.
Support contains 112 out of 2648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2648/2648 places, 2228/2228 transitions.
Applied a total of 0 rules in 120 ms. Remains 2648 /2648 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 2648/2648 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2648/2648 places, 2228/2228 transitions.
Applied a total of 0 rules in 164 ms. Remains 2648 /2648 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-23 13:56:37] [INFO ] Invariant cache hit.
[2023-03-23 13:56:39] [INFO ] Implicit Places using invariants in 2575 ms returned [2629, 2633]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2583 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2646/2648 places, 2228/2228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2644 transition count 2226
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2644 transition count 2226
Applied a total of 4 rules in 246 ms. Remains 2644 /2646 variables (removed 2) and now considering 2226/2228 (removed 2) transitions.
// Phase 1: matrix 2226 rows 2644 cols
[2023-03-23 13:56:39] [INFO ] Computed 1098 place invariants in 16 ms
[2023-03-23 13:56:42] [INFO ] Implicit Places using invariants in 2302 ms returned []
[2023-03-23 13:56:42] [INFO ] Invariant cache hit.
[2023-03-23 13:56:43] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-23 13:56:52] [INFO ] Implicit Places using invariants and state equation in 9912 ms returned []
Implicit Place search using SMT with State Equation took 12220 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2644/2648 places, 2226/2228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15214 ms. Remains : 2644/2648 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 47598 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47598 steps, saw 30883 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-23 13:56:56] [INFO ] Invariant cache hit.
[2023-03-23 13:56:57] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 13:56:58] [INFO ] [Nat]Absence check using 1098 positive place invariants in 295 ms returned sat
[2023-03-23 13:57:01] [INFO ] After 2619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 13:57:01] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-23 13:57:03] [INFO ] After 2033ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 13:57:04] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 2 ms to minimize.
[2023-03-23 13:57:04] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 1 ms to minimize.
[2023-03-23 13:57:05] [INFO ] Deduced a trap composed of 5 places in 594 ms of which 1 ms to minimize.
[2023-03-23 13:57:05] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 1 ms to minimize.
[2023-03-23 13:57:06] [INFO ] Deduced a trap composed of 5 places in 606 ms of which 1 ms to minimize.
[2023-03-23 13:57:07] [INFO ] Deduced a trap composed of 7 places in 482 ms of which 1 ms to minimize.
[2023-03-23 13:57:08] [INFO ] Deduced a trap composed of 7 places in 665 ms of which 2 ms to minimize.
[2023-03-23 13:57:08] [INFO ] Deduced a trap composed of 5 places in 488 ms of which 1 ms to minimize.
[2023-03-23 13:57:09] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 1 ms to minimize.
[2023-03-23 13:57:09] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 27 ms to minimize.
[2023-03-23 13:57:10] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 1 ms to minimize.
[2023-03-23 13:57:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6860 ms
[2023-03-23 13:57:11] [INFO ] Deduced a trap composed of 5 places in 422 ms of which 1 ms to minimize.
[2023-03-23 13:57:11] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2023-03-23 13:57:12] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 1 ms to minimize.
[2023-03-23 13:57:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1683 ms
[2023-03-23 13:57:13] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 1 ms to minimize.
[2023-03-23 13:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 573 ms
[2023-03-23 13:57:14] [INFO ] Deduced a trap composed of 7 places in 865 ms of which 2 ms to minimize.
[2023-03-23 13:57:15] [INFO ] Deduced a trap composed of 7 places in 859 ms of which 1 ms to minimize.
[2023-03-23 13:57:16] [INFO ] Deduced a trap composed of 5 places in 871 ms of which 2 ms to minimize.
[2023-03-23 13:57:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3122 ms
[2023-03-23 13:57:17] [INFO ] After 16145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2055 ms.
[2023-03-23 13:57:19] [INFO ] After 22289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 492 ms.
Support contains 112 out of 2644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2644/2644 places, 2226/2226 transitions.
Applied a total of 0 rules in 113 ms. Remains 2644 /2644 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 2644/2644 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2644/2644 places, 2226/2226 transitions.
Applied a total of 0 rules in 108 ms. Remains 2644 /2644 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-23 13:57:20] [INFO ] Invariant cache hit.
[2023-03-23 13:57:22] [INFO ] Implicit Places using invariants in 2299 ms returned []
[2023-03-23 13:57:22] [INFO ] Invariant cache hit.
[2023-03-23 13:57:24] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-23 13:57:30] [INFO ] Implicit Places using invariants and state equation in 8365 ms returned []
Implicit Place search using SMT with State Equation took 10668 ms to find 0 implicit places.
[2023-03-23 13:57:31] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-23 13:57:31] [INFO ] Invariant cache hit.
[2023-03-23 13:57:33] [INFO ] Dead Transitions using invariants and state equation in 2096 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13061 ms. Remains : 2644/2644 places, 2226/2226 transitions.
Partial Free-agglomeration rule applied 564 times.
Drop transitions removed 564 transitions
Iterating global reduction 0 with 564 rules applied. Total rules applied 564 place count 2644 transition count 2226
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 565 place count 2644 transition count 2225
Applied a total of 565 rules in 406 ms. Remains 2644 /2644 variables (removed 0) and now considering 2225/2226 (removed 1) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 2225 rows 2644 cols
[2023-03-23 13:57:33] [INFO ] Computed 1098 place invariants in 19 ms
[2023-03-23 13:57:34] [INFO ] After 627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 13:57:35] [INFO ] [Nat]Absence check using 1098 positive place invariants in 306 ms returned sat
[2023-03-23 13:57:38] [INFO ] After 2313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 13:57:38] [INFO ] State equation strengthened by 525 read => feed constraints.
[2023-03-23 13:57:42] [INFO ] After 4141ms SMT Verify possible using 525 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 13:57:43] [INFO ] Deduced a trap composed of 6 places in 645 ms of which 2 ms to minimize.
[2023-03-23 13:57:44] [INFO ] Deduced a trap composed of 5 places in 649 ms of which 1 ms to minimize.
[2023-03-23 13:57:44] [INFO ] Deduced a trap composed of 5 places in 605 ms of which 2 ms to minimize.
[2023-03-23 13:57:45] [INFO ] Deduced a trap composed of 5 places in 648 ms of which 1 ms to minimize.
[2023-03-23 13:57:46] [INFO ] Deduced a trap composed of 6 places in 636 ms of which 1 ms to minimize.
[2023-03-23 13:57:47] [INFO ] Deduced a trap composed of 5 places in 585 ms of which 2 ms to minimize.
[2023-03-23 13:57:47] [INFO ] Deduced a trap composed of 5 places in 618 ms of which 1 ms to minimize.
[2023-03-23 13:57:48] [INFO ] Deduced a trap composed of 7 places in 689 ms of which 2 ms to minimize.
[2023-03-23 13:57:49] [INFO ] Deduced a trap composed of 7 places in 584 ms of which 2 ms to minimize.
[2023-03-23 13:57:50] [INFO ] Deduced a trap composed of 5 places in 554 ms of which 1 ms to minimize.
[2023-03-23 13:57:50] [INFO ] Deduced a trap composed of 4 places in 710 ms of which 2 ms to minimize.
[2023-03-23 13:57:51] [INFO ] Deduced a trap composed of 6 places in 572 ms of which 1 ms to minimize.
[2023-03-23 13:57:52] [INFO ] Deduced a trap composed of 5 places in 586 ms of which 1 ms to minimize.
[2023-03-23 13:57:53] [INFO ] Deduced a trap composed of 13 places in 548 ms of which 1 ms to minimize.
[2023-03-23 13:57:53] [INFO ] Deduced a trap composed of 6 places in 561 ms of which 1 ms to minimize.
[2023-03-23 13:57:54] [INFO ] Deduced a trap composed of 7 places in 523 ms of which 1 ms to minimize.
[2023-03-23 13:57:55] [INFO ] Deduced a trap composed of 12 places in 552 ms of which 2 ms to minimize.
[2023-03-23 13:57:55] [INFO ] Deduced a trap composed of 8 places in 498 ms of which 2 ms to minimize.
[2023-03-23 13:57:56] [INFO ] Deduced a trap composed of 6 places in 589 ms of which 2 ms to minimize.
[2023-03-23 13:57:57] [INFO ] Deduced a trap composed of 12 places in 483 ms of which 1 ms to minimize.
[2023-03-23 13:57:57] [INFO ] Deduced a trap composed of 10 places in 498 ms of which 1 ms to minimize.
[2023-03-23 13:57:58] [INFO ] Deduced a trap composed of 8 places in 494 ms of which 1 ms to minimize.
[2023-03-23 13:57:59] [INFO ] Deduced a trap composed of 6 places in 570 ms of which 1 ms to minimize.
[2023-03-23 13:57:59] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 16725 ms
[2023-03-23 13:58:00] [INFO ] Deduced a trap composed of 6 places in 537 ms of which 1 ms to minimize.
[2023-03-23 13:58:01] [INFO ] Deduced a trap composed of 9 places in 599 ms of which 1 ms to minimize.
[2023-03-23 13:58:01] [INFO ] Deduced a trap composed of 10 places in 495 ms of which 1 ms to minimize.
[2023-03-23 13:58:02] [INFO ] Deduced a trap composed of 7 places in 498 ms of which 1 ms to minimize.
[2023-03-23 13:58:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2769 ms
[2023-03-23 13:58:03] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 1 ms to minimize.
[2023-03-23 13:58:04] [INFO ] Deduced a trap composed of 8 places in 419 ms of which 1 ms to minimize.
[2023-03-23 13:58:04] [INFO ] Deduced a trap composed of 5 places in 455 ms of which 1 ms to minimize.
[2023-03-23 13:58:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1829 ms
[2023-03-23 13:58:05] [INFO ] Deduced a trap composed of 5 places in 461 ms of which 1 ms to minimize.
[2023-03-23 13:58:06] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2023-03-23 13:58:06] [INFO ] Deduced a trap composed of 5 places in 529 ms of which 1 ms to minimize.
[2023-03-23 13:58:07] [INFO ] Deduced a trap composed of 7 places in 458 ms of which 1 ms to minimize.
[2023-03-23 13:58:07] [INFO ] Deduced a trap composed of 5 places in 454 ms of which 2 ms to minimize.
[2023-03-23 13:58:08] [INFO ] Deduced a trap composed of 6 places in 472 ms of which 0 ms to minimize.
[2023-03-23 13:58:09] [INFO ] Deduced a trap composed of 10 places in 455 ms of which 1 ms to minimize.
[2023-03-23 13:58:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4201 ms
[2023-03-23 13:58:12] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 2 ms to minimize.
[2023-03-23 13:58:13] [INFO ] Deduced a trap composed of 6 places in 505 ms of which 1 ms to minimize.
[2023-03-23 13:58:14] [INFO ] Deduced a trap composed of 5 places in 538 ms of which 1 ms to minimize.
[2023-03-23 13:58:14] [INFO ] Deduced a trap composed of 5 places in 519 ms of which 2 ms to minimize.
[2023-03-23 13:58:15] [INFO ] Deduced a trap composed of 6 places in 549 ms of which 2 ms to minimize.
[2023-03-23 13:58:16] [INFO ] Deduced a trap composed of 9 places in 589 ms of which 1 ms to minimize.
[2023-03-23 13:58:17] [INFO ] Deduced a trap composed of 9 places in 614 ms of which 1 ms to minimize.
[2023-03-23 13:58:17] [INFO ] Deduced a trap composed of 5 places in 594 ms of which 1 ms to minimize.
[2023-03-23 13:58:18] [INFO ] Deduced a trap composed of 7 places in 514 ms of which 1 ms to minimize.
[2023-03-23 13:58:19] [INFO ] Deduced a trap composed of 9 places in 571 ms of which 3 ms to minimize.
[2023-03-23 13:58:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7130 ms
[2023-03-23 13:58:20] [INFO ] After 41807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 6702 ms.
[2023-03-23 13:58:26] [INFO ] After 52434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-23 13:58:26] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-23 13:58:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2644 places, 2226 transitions and 9712 arcs took 17 ms.
[2023-03-23 13:58:27] [INFO ] Flatten gal took : 240 ms
Total runtime 182215 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 100B
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: 2644 places, 2226 transitions, 9712 arcs.
Final Score: 226376.117
Took : 92 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPt-PT-100B-ReachabilityCardinality-01 (reachable &!potential( ( ( ( ( ( ( (tk(P898)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P898)) ) ) | ( ( (tk(P628)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P628)) ) ) ) | ( ( ( (tk(P2420)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2420)) ) ) | ( ( (tk(P357)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P357)) ) ) ) ) | ( ( ( ( (tk(P2258)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2258)) ) ) | ( ( (tk(P1086)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1086)) ) ) ) | ( ( ( (tk(P2065)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2065)) ) ) | ( ( (tk(P110)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P110)) ) ) ) ) ) | ( ( ( ( ( (tk(P423)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P423)) ) ) | ( ( (tk(P862)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P862)) ) ) ) | ( ( ( (tk(P606)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P606)) ) ) | ( ( (tk(P2634)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2634)) ) ) ) ) | ( ( ( ( (tk(P2294)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2294)) ) ) | ( ( ( (tk(P2221)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2221)) ) ) & ( ( (tk(P1886)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1886)) ) ) ) ) | ( ( ( ( ( (tk(P1515)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1515)) ) ) & ( ( (tk(P2345)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2345)) ) ) ) & ( ( ( ( (tk(P2099)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2099)) ) ) | ( ( (tk(P2497)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2497)) ) ) ) & ( ( ( (tk(P2419)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2419)) ) ) | ( ( (tk(P2206)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2206)) ) ) ) ) ) | ( ( ( (tk(P2343)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2343)) ) ) & ( ( ( (tk(P2152)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2152)) ) ) & ( ( (tk(P1321)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1321)) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-100B-ReachabilityCardinality-02 (reachable & potential(( ( (tk(P1702)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1702)) ) )))
PROPERTY: ShieldPPPt-PT-100B-ReachabilityCardinality-04 (reachable &!potential( ( ( ( ( ( (tk(P2479)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2479)) ) ) | ( ( (tk(P1296)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1296)) ) ) ) | ( ( ( (tk(P908)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P908)) ) ) | ( ( (tk(P1210)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1210)) ) ) ) ) | ( ( ( ( (tk(P317)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P317)) ) ) | ( ( (tk(P370)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P370)) ) ) ) | ( ( ( (tk(P1417)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1417)) ) ) | ( ( ( ( (tk(P1118)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1118)) ) ) & ( ( (tk(P67)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P67)) ) ) ) | ( ( ( (tk(P2072)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2072)) ) ) & ( ( ( ( (tk(P2034)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2034)) ) ) & ( ( (tk(P820)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P820)) ) ) ) | ( ( ( ( (tk(P1391)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1391)) ) ) & ( ( (tk(P278)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P278)) ) ) ) | ( ( ( ( (tk(P825)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P825)) ) ) & ( ( ( (tk(P1327)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1327)) ) ) & ( ( (tk(P500)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P500)) ) ) ) ) & ( ( ( ( ( (tk(P448)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P448)) ) ) | ( ( (tk(P911)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P911)) ) ) ) & ( ( ( (tk(P677)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P677)) ) ) | ( ( (tk(P1263)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1263)) ) ) ) ) & ( ( ( ( (tk(P2271)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2271)) ) ) | ( ( (tk(P182)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P182)) ) ) ) & ( ( ( (tk(P2300)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2300)) ) ) | ( ( ( (tk(P1387)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1387)) ) ) | ( ( (tk(P564)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P564)) ) ) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-100B-ReachabilityCardinality-07 (reachable & potential(( ( ( (tk(P1409)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1409)) ) ) & ( ( ( (tk(P1752)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1752)) ) ) & ( ( ( (tk(P1041)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1041)) ) ) | ( ( (tk(P2074)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2074)) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-100B-ReachabilityCardinality-09 (reachable & potential(( ( ( (tk(P2082)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2082)) ) ) & ( ( ( (tk(P1731)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1731)) ) ) | ( ( ( (tk(P635)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P635)) ) ) & ( ( ( ( ( (tk(P506)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P506)) ) ) | ( ( (tk(P718)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P718)) ) ) ) | ( ( ( (tk(P887)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P887)) ) ) | ( ( (tk(P1870)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1870)) ) ) ) ) | ( ( ( ( (tk(P260)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P260)) ) ) | ( ( (tk(P1357)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1357)) ) ) ) | ( ( ( (tk(P1602)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1602)) ) ) | ( ( ( (tk(P2149)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2149)) ) ) & ( ( (tk(P1572)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1572)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-100B-ReachabilityCardinality-12 (reachable & potential(( ( ( ( ( (tk(P2041)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2041)) ) ) & ( ( ( (tk(P1347)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1347)) ) ) & ( ( (tk(P3)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P3)) ) ) ) ) & ( ( ( ( ( (tk(P1385)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1385)) ) ) | ( ( (tk(P1036)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1036)) ) ) ) & ( ( ( (tk(P830)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P830)) ) ) | ( ( ( (tk(P136)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P136)) ) ) & ( ( ( (tk(P1542)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1542)) ) ) | ( ( ( (tk(P847)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P847)) ) ) | ( ( (tk(P472)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P472)) ) ) ) ) ) ) ) & ( ( ( ( (tk(P418)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P418)) ) ) | ( ( ( (tk(P1596)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1596)) ) ) | ( ( (tk(P2069)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2069)) ) ) ) ) & ( ( ( (tk(P732)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P732)) ) ) | ( ( ( (tk(P1547)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1547)) ) ) | ( ( (tk(P1500)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1500)) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P2031)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2031)) ) ) & ( ( (tk(P1289)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1289)) ) ) ) & ( ( ( (tk(P722)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P722)) ) ) & ( ( ( ( (tk(P1173)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1173)) ) ) | ( ( (tk(P1494)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1494)) ) ) ) | ( ( ( (tk(P498)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P498)) ) ) | ( ( (tk(P1089)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1089)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P641)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P641)) ) ) | ( ( ( (tk(P29)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P29)) ) ) | ( ( (tk(P1377)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1377)) ) ) ) ) & ( ( ( ( (tk(P2153)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2153)) ) ) | ( ( ( (tk(P640)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P640)) ) ) & ( ( (tk(P1698)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1698)) ) ) ) ) | ( ( ( ( (tk(P478)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P478)) ) ) & ( ( ( (tk(P850)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P850)) ) ) & ( ( (tk(P1511)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1511)) ) ) ) ) | ( ( ( (tk(P601)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P601)) ) ) & ( ( ( ( (tk(P1992)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1992)) ) ) | ( ( (tk(P800)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P800)) ) ) ) | ( ( ( (tk(P1859)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1859)) ) ) | ( ( ( (tk(P2289)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2289)) ) ) | ( ( (tk(P515)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P515)) ) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P560)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P560)) ) ) | ( ( ( (tk(P1702)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1702)) ) ) & ( ( ( (tk(P2253)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2253)) ) ) | ( ( (tk(P1409)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1409)) ) ) ) ) ) & ( ( ( ( (tk(P994)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P994)) ) ) & ( ( (tk(P1066)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1066)) ) ) ) | ( ( ( (tk(P2432)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2432)) ) ) & ( ( (tk(P2545)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2545)) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-100B-ReachabilityCardinality-13 (reachable & potential(( ( (tk(P60)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P60)) ) )))
PROPERTY: ShieldPPPt-PT-100B-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P1296)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1296)) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 3279864 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16097636 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="ShieldPPPt-PT-100B"
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 ShieldPPPt-PT-100B, 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-167903719100702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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