Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979500318.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979500318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 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:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 489K 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 ShieldRVt-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679384366102

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=ShieldRVt-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:39:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 07:39:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:39:27] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-21 07:39:27] [INFO ] Transformed 2003 places.
[2023-03-21 07:39:27] [INFO ] Transformed 2003 transitions.
[2023-03-21 07:39:27] [INFO ] Found NUPN structural information;
[2023-03-21 07:39:27] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 14) seen :5
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2003 rows 2003 cols
[2023-03-21 07:39:28] [INFO ] Computed 161 place invariants in 34 ms
[2023-03-21 07:39:29] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 07:39:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 55 ms returned sat
[2023-03-21 07:39:34] [INFO ] After 4174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 07:39:35] [INFO ] Deduced a trap composed of 45 places in 445 ms of which 5 ms to minimize.
[2023-03-21 07:39:36] [INFO ] Deduced a trap composed of 30 places in 507 ms of which 5 ms to minimize.
[2023-03-21 07:39:36] [INFO ] Deduced a trap composed of 39 places in 474 ms of which 3 ms to minimize.
[2023-03-21 07:39:37] [INFO ] Deduced a trap composed of 41 places in 470 ms of which 2 ms to minimize.
[2023-03-21 07:39:37] [INFO ] Deduced a trap composed of 27 places in 442 ms of which 2 ms to minimize.
[2023-03-21 07:39:38] [INFO ] Deduced a trap composed of 51 places in 401 ms of which 1 ms to minimize.
[2023-03-21 07:39:39] [INFO ] Deduced a trap composed of 50 places in 439 ms of which 1 ms to minimize.
[2023-03-21 07:39:39] [INFO ] Deduced a trap composed of 61 places in 307 ms of which 1 ms to minimize.
[2023-03-21 07:39:39] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 1 ms to minimize.
[2023-03-21 07:39:40] [INFO ] Deduced a trap composed of 60 places in 393 ms of which 1 ms to minimize.
[2023-03-21 07:39:40] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 1 ms to minimize.
[2023-03-21 07:39:41] [INFO ] Deduced a trap composed of 66 places in 331 ms of which 1 ms to minimize.
[2023-03-21 07:39:41] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 1 ms to minimize.
[2023-03-21 07:39:42] [INFO ] Deduced a trap composed of 55 places in 347 ms of which 2 ms to minimize.
[2023-03-21 07:39:42] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 1 ms to minimize.
[2023-03-21 07:39:42] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 1 ms to minimize.
[2023-03-21 07:39:43] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 1 ms to minimize.
[2023-03-21 07:39:43] [INFO ] Deduced a trap composed of 56 places in 304 ms of which 1 ms to minimize.
[2023-03-21 07:39:44] [INFO ] Deduced a trap composed of 60 places in 348 ms of which 1 ms to minimize.
[2023-03-21 07:39:44] [INFO ] Deduced a trap composed of 62 places in 282 ms of which 1 ms to minimize.
[2023-03-21 07:39:44] [INFO ] Deduced a trap composed of 56 places in 290 ms of which 1 ms to minimize.
[2023-03-21 07:39:45] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 1 ms to minimize.
[2023-03-21 07:39:45] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 10364 ms
[2023-03-21 07:39:46] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 1 ms to minimize.
[2023-03-21 07:39:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2023-03-21 07:39:47] [INFO ] Deduced a trap composed of 22 places in 592 ms of which 2 ms to minimize.
[2023-03-21 07:39:47] [INFO ] Deduced a trap composed of 33 places in 608 ms of which 2 ms to minimize.
[2023-03-21 07:39:48] [INFO ] Deduced a trap composed of 35 places in 551 ms of which 3 ms to minimize.
[2023-03-21 07:39:49] [INFO ] Deduced a trap composed of 44 places in 546 ms of which 2 ms to minimize.
[2023-03-21 07:39:49] [INFO ] Deduced a trap composed of 37 places in 458 ms of which 2 ms to minimize.
[2023-03-21 07:39:50] [INFO ] Deduced a trap composed of 37 places in 427 ms of which 1 ms to minimize.
[2023-03-21 07:39:50] [INFO ] Deduced a trap composed of 55 places in 534 ms of which 1 ms to minimize.
[2023-03-21 07:39:51] [INFO ] Deduced a trap composed of 58 places in 503 ms of which 2 ms to minimize.
[2023-03-21 07:39:51] [INFO ] Deduced a trap composed of 50 places in 515 ms of which 1 ms to minimize.
[2023-03-21 07:39:52] [INFO ] Deduced a trap composed of 38 places in 524 ms of which 2 ms to minimize.
[2023-03-21 07:39:53] [INFO ] Deduced a trap composed of 59 places in 566 ms of which 5 ms to minimize.
[2023-03-21 07:39:53] [INFO ] Deduced a trap composed of 25 places in 490 ms of which 2 ms to minimize.
[2023-03-21 07:39:54] [INFO ] Deduced a trap composed of 51 places in 497 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-21 07:39:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:39:54] [INFO ] After 25116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 643 ms.
Support contains 125 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 536 transitions
Trivial Post-agglo rules discarded 536 transitions
Performed 536 trivial Post agglomeration. Transition count delta: 536
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 2003 transition count 1467
Reduce places removed 536 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 538 rules applied. Total rules applied 1074 place count 1467 transition count 1465
Reduce places removed 1 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 28 rules applied. Total rules applied 1102 place count 1466 transition count 1438
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1129 place count 1439 transition count 1438
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 1129 place count 1439 transition count 1269
Deduced a syphon composed of 169 places in 2 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1467 place count 1270 transition count 1269
Discarding 237 places :
Symmetric choice reduction at 4 with 237 rule applications. Total rules 1704 place count 1033 transition count 1032
Iterating global reduction 4 with 237 rules applied. Total rules applied 1941 place count 1033 transition count 1032
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 1941 place count 1033 transition count 936
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 2133 place count 937 transition count 936
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 329
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 4 with 658 rules applied. Total rules applied 2791 place count 608 transition count 607
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 2981 place count 513 transition count 673
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2982 place count 513 transition count 672
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2992 place count 513 transition count 662
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 3002 place count 503 transition count 662
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3003 place count 503 transition count 661
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3006 place count 503 transition count 661
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3007 place count 503 transition count 660
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3008 place count 502 transition count 659
Applied a total of 3008 rules in 531 ms. Remains 502 /2003 variables (removed 1501) and now considering 659/2003 (removed 1344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 502/2003 places, 659/2003 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :1
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 659 rows 502 cols
[2023-03-21 07:39:56] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-21 07:39:56] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 07:39:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-21 07:39:56] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 07:39:56] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-21 07:39:57] [INFO ] After 720ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 07:39:57] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2023-03-21 07:39:58] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-21 07:39:58] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-21 07:39:58] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-21 07:39:58] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-21 07:39:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 652 ms
[2023-03-21 07:39:58] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-21 07:39:59] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-21 07:39:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2023-03-21 07:39:59] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-21 07:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-21 07:39:59] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-21 07:39:59] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2023-03-21 07:39:59] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-21 07:39:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2023-03-21 07:40:00] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2023-03-21 07:40:00] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2023-03-21 07:40:00] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-21 07:40:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 589 ms
[2023-03-21 07:40:00] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 2 ms to minimize.
[2023-03-21 07:40:01] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-21 07:40:01] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-21 07:40:01] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2023-03-21 07:40:01] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-21 07:40:02] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2023-03-21 07:40:02] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-21 07:40:02] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-21 07:40:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1741 ms
[2023-03-21 07:40:02] [INFO ] After 5514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1114 ms.
[2023-03-21 07:40:03] [INFO ] After 7195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 124 ms.
Support contains 124 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 659/659 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 501 transition count 659
Applied a total of 2 rules in 33 ms. Remains 501 /502 variables (removed 1) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 501/502 places, 659/659 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 140957 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140957 steps, saw 88225 distinct states, run finished after 3005 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 659 rows 501 cols
[2023-03-21 07:40:07] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-21 07:40:07] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 07:40:07] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-21 07:40:08] [INFO ] After 587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 07:40:08] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-21 07:40:09] [INFO ] After 711ms SMT Verify possible using 239 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 07:40:09] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2023-03-21 07:40:09] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-21 07:40:09] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-21 07:40:09] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2023-03-21 07:40:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 555 ms
[2023-03-21 07:40:09] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-21 07:40:10] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-21 07:40:10] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-21 07:40:10] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-21 07:40:10] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2023-03-21 07:40:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 723 ms
[2023-03-21 07:40:10] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-21 07:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-21 07:40:11] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-21 07:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-21 07:40:11] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2023-03-21 07:40:11] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2023-03-21 07:40:12] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-21 07:40:12] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2023-03-21 07:40:12] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-03-21 07:40:12] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-21 07:40:12] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2023-03-21 07:40:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1227 ms
[2023-03-21 07:40:12] [INFO ] After 4377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1114 ms.
[2023-03-21 07:40:13] [INFO ] After 6281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 102 ms.
Support contains 124 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 659/659 transitions.
Applied a total of 0 rules in 19 ms. Remains 501 /501 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 501/501 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 659/659 transitions.
Applied a total of 0 rules in 17 ms. Remains 501 /501 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2023-03-21 07:40:14] [INFO ] Invariant cache hit.
[2023-03-21 07:40:14] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-21 07:40:14] [INFO ] Invariant cache hit.
[2023-03-21 07:40:14] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-21 07:40:15] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-21 07:40:15] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-21 07:40:15] [INFO ] Invariant cache hit.
[2023-03-21 07:40:15] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1537 ms. Remains : 501/501 places, 659/659 transitions.
Graph (trivial) has 83 edges and 501 vertex of which 4 / 501 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1515 edges and 499 vertex of which 497 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 80 edges and 495 vertex of which 4 / 495 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 493 transition count 650
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 79 edges and 491 vertex of which 4 / 491 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 489 transition count 641
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 489 transition count 637
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 51 place count 489 transition count 610
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 71 place count 489 transition count 610
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 489 transition count 609
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 82 place count 489 transition count 599
Applied a total of 82 rules in 107 ms. Remains 489 /501 variables (removed 12) and now considering 599/659 (removed 60) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 599 rows 489 cols
[2023-03-21 07:40:15] [INFO ] Computed 156 place invariants in 3 ms
[2023-03-21 07:40:15] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 07:40:15] [INFO ] [Nat]Absence check using 156 positive place invariants in 28 ms returned sat
[2023-03-21 07:40:16] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 07:40:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 07:40:16] [INFO ] After 359ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 07:40:17] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-21 07:40:17] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-21 07:40:17] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-21 07:40:17] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2023-03-21 07:40:17] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-21 07:40:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 647 ms
[2023-03-21 07:40:17] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2023-03-21 07:40:17] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-21 07:40:18] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-21 07:40:18] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-21 07:40:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 416 ms
[2023-03-21 07:40:18] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-21 07:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-21 07:40:18] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-21 07:40:18] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-21 07:40:18] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-21 07:40:18] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-21 07:40:19] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-21 07:40:19] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-21 07:40:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 654 ms
[2023-03-21 07:40:19] [INFO ] After 2623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 428 ms.
[2023-03-21 07:40:19] [INFO ] After 3833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-21 07:40:19] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-21 07:40:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 501 places, 659 transitions and 3050 arcs took 7 ms.
[2023-03-21 07:40:19] [INFO ] Flatten gal took : 102 ms
Total runtime 52379 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVt (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: 501 places, 659 transitions, 3050 arcs.
Final Score: 15723.592
Took : 26 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldRVt-PT-040B-ReachabilityCardinality-01 (reachable &!potential( ( ( ( (tk(P215)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P215)) ) ) & ( ( ( ( (tk(P64)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) ) | ( ( ( (tk(P53)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P53)) ) ) | ( ( (tk(P412)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P412)) ) ) ) ) | ( ( ( ( (tk(P410)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P410)) ) ) | ( ( ( (tk(P292)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P292)) ) ) & ( ( ( ( ( (tk(P111)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P111)) ) ) & ( ( (tk(P404)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P404)) ) ) ) & ( ( ( (tk(P374)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P374)) ) ) & ( ( ( (tk(P144)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P144)) ) ) | ( ( (tk(P105)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P105)) ) ) ) ) ) | ( ( ( (tk(P221)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P221)) ) ) & ( ( (tk(P253)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P253)) ) ) ) ) ) ) | ( ( ( ( (tk(P494)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P494)) ) ) & ( ( (tk(P163)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P163)) ) ) ) | ( ( ( ( (tk(P403)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P403)) ) ) | ( ( (tk(P428)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P428)) ) ) ) & ( ( ( (tk(P368)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P368)) ) ) | ( ( ( (tk(P171)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P171)) ) ) & ( ( (tk(P146)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P146)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldRVt-PT-040B-ReachabilityCardinality-02 (reachable & potential(( ( (tk(P219)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P219)) ) )))
PROPERTY: ShieldRVt-PT-040B-ReachabilityCardinality-04 (reachable &!potential( ( ( ( (tk(P231)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P231)) ) ) | ( ( ( (tk(P174)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P174)) ) ) | ( ( (tk(P392)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P392)) ) ) ) )))
PROPERTY: ShieldRVt-PT-040B-ReachabilityCardinality-07 (reachable &!potential( ( ( ( (tk(P161)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P161)) ) ) | ( ( ( ( (tk(P72)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P72)) ) ) & ( ( ( (tk(P389)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P389)) ) ) | ( ( (tk(P271)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P271)) ) ) ) ) & ( ( ( ( ( (tk(P405)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P405)) ) ) | ( ( (tk(P278)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P278)) ) ) ) | ( ( ( (tk(P322)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P322)) ) ) | ( ( (tk(P210)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P210)) ) ) ) ) & ( ( ( ( ( (tk(P463)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P463)) ) ) | ( ( (tk(P371)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P371)) ) ) ) | ( ( ( (tk(P107)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P107)) ) ) | ( ( ( (tk(P173)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P173)) ) ) & ( ( (tk(P314)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P314)) ) ) ) ) ) & ( ( ( (tk(P369)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P369)) ) ) | ( ( ( ( (tk(P209)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P209)) ) ) | ( ( (tk(P466)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P466)) ) ) ) & ( ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) | ( ( ( (tk(P288)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P288)) ) ) & ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldRVt-PT-040B-ReachabilityCardinality-09 (reachable & potential(( ( (tk(P33)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P33)) ) )))
PROPERTY: ShieldRVt-PT-040B-ReachabilityCardinality-10 (reachable &!potential( ( ( ( (tk(P455)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P455)) ) ) | ( ( ( (tk(P195)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P195)) ) ) & ( ( ( (tk(P117)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P117)) ) ) | ( ( (tk(P10)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P10)) ) ) ) ) )))
PROPERTY: ShieldRVt-PT-040B-ReachabilityCardinality-13 (reachable &!potential( ( ( ( (tk(P267)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P267)) ) ) | ( ( (tk(P17)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P17)) ) ) )))
PROPERTY: ShieldRVt-PT-040B-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( ( (tk(P283)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P283)) ) ) | ( ( (tk(P449)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P449)) ) ) ) | ( ( ( (tk(P235)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P235)) ) ) | ( ( ( (tk(P258)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P258)) ) ) | ( ( (tk(P85)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P85)) ) ) ) ) ) | ( ( ( ( (tk(P86)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P86)) ) ) | ( ( ( (tk(P74)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P74)) ) ) | ( ( (tk(P454)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P454)) ) ) ) ) | ( ( ( ( ( ( (tk(P157)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P157)) ) ) | ( ( ( (tk(P135)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P135)) ) ) | ( ( (tk(P382)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P382)) ) ) ) ) | ( ( ( ( (tk(P269)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P269)) ) ) & ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) ) | ( ( ( ( ( ( ( (tk(P126)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P126)) ) ) | ( ( (tk(P474)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P474)) ) ) ) | ( ( ( (tk(P96)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P96)) ) ) | ( ( ( (tk(P347)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P347)) ) ) | ( ( (tk(P197)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P197)) ) ) ) ) ) | ( ( ( ( (tk(P236)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P236)) ) ) | ( ( (tk(P306)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P306)) ) ) ) | ( ( ( (tk(P17)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P17)) ) ) | ( ( ( (tk(P77)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P77)) ) ) | ( ( (tk(P149)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P149)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P154)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P154)) ) ) | ( ( (tk(P436)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P436)) ) ) ) | ( ( ( (tk(P186)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P186)) ) ) | ( ( (tk(P305)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P305)) ) ) ) ) | ( ( ( ( (tk(P191)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P191)) ) ) | ( ( (tk(P109)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P109)) ) ) ) | ( ( ( ( ( (tk(P69)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P69)) ) ) | ( ( (tk(P305)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P305)) ) ) ) & ( ( ( (tk(P353)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P353)) ) ) | ( ( (tk(P141)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P141)) ) ) ) ) | ( ( ( ( ( (tk(P382)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P382)) ) ) | ( ( (tk(P31)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P31)) ) ) ) & ( ( ( (tk(P377)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P377)) ) ) | ( ( (tk(P78)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P78)) ) ) ) ) | ( ( ( (tk(P262)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P262)) ) ) & ( ( ( (tk(P6)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P6)) ) ) & ( ( ( (tk(P225)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P225)) ) ) | ( ( (tk(P101)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P101)) ) ) ) ) ) ) ) ) ) ) | ( ( ( (tk(P130)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P130)) ) ) & ( ( (tk(P344)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P344)) ) ) ) ) ) ) & ( ( ( (tk(P415)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P415)) ) ) | ( ( ( ( (tk(P441)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P441)) ) ) & ( ( (tk(P478)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P478)) ) ) ) & ( ( ( ( (tk(P239)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P239)) ) ) | ( ( (tk(P115)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P115)) ) ) ) & ( ( ( ( (tk(P213)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P213)) ) ) | ( ( (tk(P438)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P438)) ) ) ) | ( ( ( (tk(P371)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P371)) ) ) | ( ( (tk(P94)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P94)) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P485)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P485)) ) ) & ( ( ( ( (tk(P310)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P310)) ) ) | ( ( (tk(P226)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P226)) ) ) ) & ( ( ( (tk(P360)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P360)) ) ) | ( ( ( (tk(P424)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P424)) ) ) & ( ( (tk(P351)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P351)) ) ) ) ) ) ) | ( ( ( ( (tk(P398)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P398)) ) ) & ( ( ( (tk(P47)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P47)) ) ) | ( ( (tk(P211)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P211)) ) ) ) ) & ( ( ( ( ( ( (tk(P458)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P458)) ) ) & ( ( (tk(P60)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P60)) ) ) ) & ( ( ( (tk(P434)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P434)) ) ) & ( ( ( (tk(P176)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P176)) ) ) & ( ( (tk(P139)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P139)) ) ) ) ) ) | ( ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) & ( ( (tk(P450)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P450)) ) ) ) & ( ( ( (tk(P303)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P303)) ) ) & ( ( ( (tk(P245)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P245)) ) ) & ( ( (tk(P479)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P479)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P183)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P183)) ) ) | ( ( (tk(P205)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P205)) ) ) ) | ( ( ( (tk(P394)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P394)) ) ) | ( ( (tk(P411)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P411)) ) ) ) ) & ( ( ( (tk(P56)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P56)) ) ) | ( ( ( (tk(P280)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P280)) ) ) | ( ( (tk(P495)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P495)) ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 2860860 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098424 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="ShieldRVt-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 ShieldRVt-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 r427-tajo-167905979500318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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