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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 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.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 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 762K 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-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679577437112

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-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:17:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 13:17:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:17:20] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-23 13:17:20] [INFO ] Transformed 3123 places.
[2023-03-23 13:17:20] [INFO ] Transformed 2843 transitions.
[2023-03-23 13:17:20] [INFO ] Found NUPN structural information;
[2023-03-23 13:17:20] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 14) seen :3
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-23 13:17:21] [INFO ] Computed 441 place invariants in 34 ms
[2023-03-23 13:17:23] [INFO ] [Real]Absence check using 441 positive place invariants in 418 ms returned sat
[2023-03-23 13:17:23] [INFO ] After 2039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 13:17:25] [INFO ] [Nat]Absence check using 441 positive place invariants in 399 ms returned sat
[2023-03-23 13:17:33] [INFO ] After 6841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 13:17:34] [INFO ] Deduced a trap composed of 22 places in 1272 ms of which 9 ms to minimize.
[2023-03-23 13:17:35] [INFO ] Deduced a trap composed of 23 places in 1338 ms of which 14 ms to minimize.
[2023-03-23 13:17:37] [INFO ] Deduced a trap composed of 24 places in 1115 ms of which 16 ms to minimize.
[2023-03-23 13:17:38] [INFO ] Deduced a trap composed of 28 places in 1074 ms of which 15 ms to minimize.
[2023-03-23 13:17:39] [INFO ] Deduced a trap composed of 32 places in 928 ms of which 1 ms to minimize.
[2023-03-23 13:17:40] [INFO ] Deduced a trap composed of 34 places in 1027 ms of which 3 ms to minimize.
[2023-03-23 13:17:41] [INFO ] Deduced a trap composed of 33 places in 1117 ms of which 2 ms to minimize.
[2023-03-23 13:17:43] [INFO ] Deduced a trap composed of 22 places in 928 ms of which 3 ms to minimize.
[2023-03-23 13:17:44] [INFO ] Deduced a trap composed of 25 places in 1469 ms of which 2 ms to minimize.
[2023-03-23 13:17:46] [INFO ] Deduced a trap composed of 56 places in 2140 ms of which 2 ms to minimize.
[2023-03-23 13:17:49] [INFO ] Deduced a trap composed of 13 places in 2790 ms of which 4 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:17:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:17:49] [INFO ] After 26187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1485 ms.
Support contains 104 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 686 rules applied. Total rules applied 686 place count 3123 transition count 2157
Reduce places removed 686 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 688 rules applied. Total rules applied 1374 place count 2437 transition count 2155
Reduce places removed 1 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 31 rules applied. Total rules applied 1405 place count 2436 transition count 2125
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1435 place count 2406 transition count 2125
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 1435 place count 2406 transition count 1956
Deduced a syphon composed of 169 places in 6 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1773 place count 2237 transition count 1956
Discarding 258 places :
Symmetric choice reduction at 4 with 258 rule applications. Total rules 2031 place count 1979 transition count 1698
Iterating global reduction 4 with 258 rules applied. Total rules applied 2289 place count 1979 transition count 1698
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 2289 place count 1979 transition count 1597
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2491 place count 1878 transition count 1597
Performed 632 Post agglomeration using F-continuation condition.Transition count delta: 632
Deduced a syphon composed of 632 places in 7 ms
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 4 with 1264 rules applied. Total rules applied 3755 place count 1246 transition count 965
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 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3957 place count 1145 transition count 965
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3959 place count 1144 transition count 965
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3965 place count 1144 transition count 959
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 3971 place count 1138 transition count 959
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 4071 place count 1138 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4072 place count 1137 transition count 958
Applied a total of 4072 rules in 1231 ms. Remains 1137 /3123 variables (removed 1986) and now considering 958/2843 (removed 1885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1232 ms. Remains : 1137/3123 places, 958/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 82762 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82762 steps, saw 53961 distinct states, run finished after 3016 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 958 rows 1137 cols
[2023-03-23 13:17:56] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-23 13:17:57] [INFO ] [Real]Absence check using 441 positive place invariants in 152 ms returned sat
[2023-03-23 13:17:57] [INFO ] After 560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 13:17:57] [INFO ] [Nat]Absence check using 441 positive place invariants in 84 ms returned sat
[2023-03-23 13:17:59] [INFO ] After 1361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 13:17:59] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-23 13:18:02] [INFO ] After 3352ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 13:18:03] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 17 ms to minimize.
[2023-03-23 13:18:03] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-23 13:18:03] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 0 ms to minimize.
[2023-03-23 13:18:04] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 1 ms to minimize.
[2023-03-23 13:18:04] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-23 13:18:04] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-23 13:18:04] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-23 13:18:04] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2023-03-23 13:18:05] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 11 ms to minimize.
[2023-03-23 13:18:05] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 0 ms to minimize.
[2023-03-23 13:18:05] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-23 13:18:06] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-23 13:18:06] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-23 13:18:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3768 ms
[2023-03-23 13:18:06] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
[2023-03-23 13:18:07] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2023-03-23 13:18:07] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2023-03-23 13:18:08] [INFO ] Deduced a trap composed of 6 places in 330 ms of which 0 ms to minimize.
[2023-03-23 13:18:08] [INFO ] Deduced a trap composed of 9 places in 457 ms of which 0 ms to minimize.
[2023-03-23 13:18:09] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 0 ms to minimize.
[2023-03-23 13:18:09] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 1 ms to minimize.
[2023-03-23 13:18:09] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-23 13:18:10] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2023-03-23 13:18:10] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 17 ms to minimize.
[2023-03-23 13:18:10] [INFO ] Deduced a trap composed of 9 places in 427 ms of which 0 ms to minimize.
[2023-03-23 13:18:11] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-23 13:18:11] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2023-03-23 13:18:11] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2023-03-23 13:18:12] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-23 13:18:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5549 ms
[2023-03-23 13:18:12] [INFO ] Deduced a trap composed of 6 places in 478 ms of which 41 ms to minimize.
[2023-03-23 13:18:13] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 2 ms to minimize.
[2023-03-23 13:18:13] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2023-03-23 13:18:13] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2023-03-23 13:18:14] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-23 13:18:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1644 ms
[2023-03-23 13:18:14] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2023-03-23 13:18:14] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2023-03-23 13:18:15] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 0 ms to minimize.
[2023-03-23 13:18:15] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 0 ms to minimize.
[2023-03-23 13:18:16] [INFO ] Deduced a trap composed of 7 places in 368 ms of which 1 ms to minimize.
[2023-03-23 13:18:16] [INFO ] Deduced a trap composed of 9 places in 327 ms of which 0 ms to minimize.
[2023-03-23 13:18:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2350 ms
[2023-03-23 13:18:16] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2023-03-23 13:18:17] [INFO ] Deduced a trap composed of 5 places in 358 ms of which 1 ms to minimize.
[2023-03-23 13:18:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 896 ms
[2023-03-23 13:18:19] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-23 13:18:20] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-23 13:18:20] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2023-03-23 13:18:20] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-23 13:18:21] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2023-03-23 13:18:21] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-23 13:18:21] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-23 13:18:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2098 ms
[2023-03-23 13:18:22] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-23 13:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-23 13:18:22] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 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:18:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:18:22] [INFO ] After 25212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 392 ms.
Support contains 104 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 958/958 transitions.
Applied a total of 0 rules in 121 ms. Remains 1137 /1137 variables (removed 0) and now considering 958/958 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 1137/1137 places, 958/958 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 958/958 transitions.
Applied a total of 0 rules in 87 ms. Remains 1137 /1137 variables (removed 0) and now considering 958/958 (removed 0) transitions.
[2023-03-23 13:18:23] [INFO ] Invariant cache hit.
[2023-03-23 13:18:23] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-23 13:18:23] [INFO ] Invariant cache hit.
[2023-03-23 13:18:24] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-23 13:18:28] [INFO ] Implicit Places using invariants and state equation in 4401 ms returned []
Implicit Place search using SMT with State Equation took 5128 ms to find 0 implicit places.
[2023-03-23 13:18:28] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-23 13:18:28] [INFO ] Invariant cache hit.
[2023-03-23 13:18:29] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6150 ms. Remains : 1137/1137 places, 958/958 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1137 transition count 957
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 1136 transition count 957
Partial Free-agglomeration rule applied 216 times.
Drop transitions removed 216 transitions
Iterating global reduction 0 with 216 rules applied. Total rules applied 218 place count 1136 transition count 957
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 221 place count 1136 transition count 954
Applied a total of 221 rules in 236 ms. Remains 1136 /1137 variables (removed 1) and now considering 954/958 (removed 4) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 954 rows 1136 cols
[2023-03-23 13:18:29] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-23 13:18:29] [INFO ] [Real]Absence check using 441 positive place invariants in 76 ms returned sat
[2023-03-23 13:18:29] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 13:18:30] [INFO ] [Nat]Absence check using 441 positive place invariants in 97 ms returned sat
[2023-03-23 13:18:31] [INFO ] After 1299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 13:18:31] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-03-23 13:18:34] [INFO ] After 2266ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 13:18:34] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2023-03-23 13:18:34] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2023-03-23 13:18:35] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 35 ms to minimize.
[2023-03-23 13:18:35] [INFO ] Deduced a trap composed of 8 places in 325 ms of which 5 ms to minimize.
[2023-03-23 13:18:35] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 1 ms to minimize.
[2023-03-23 13:18:36] [INFO ] Deduced a trap composed of 6 places in 403 ms of which 13 ms to minimize.
[2023-03-23 13:18:36] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 19 ms to minimize.
[2023-03-23 13:18:36] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 23 ms to minimize.
[2023-03-23 13:18:37] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2023-03-23 13:18:37] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-23 13:18:37] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2023-03-23 13:18:37] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2023-03-23 13:18:38] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 0 ms to minimize.
[2023-03-23 13:18:38] [INFO ] Deduced a trap composed of 8 places in 438 ms of which 1 ms to minimize.
[2023-03-23 13:18:38] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-23 13:18:38] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2023-03-23 13:18:39] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-23 13:18:39] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4847 ms
[2023-03-23 13:18:39] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 0 ms to minimize.
[2023-03-23 13:18:39] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-23 13:18:40] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 0 ms to minimize.
[2023-03-23 13:18:40] [INFO ] Deduced a trap composed of 8 places in 350 ms of which 0 ms to minimize.
[2023-03-23 13:18:40] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2023-03-23 13:18:41] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-23 13:18:41] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2023-03-23 13:18:42] [INFO ] Deduced a trap composed of 8 places in 350 ms of which 2 ms to minimize.
[2023-03-23 13:18:42] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-23 13:18:42] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2023-03-23 13:18:43] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 2 ms to minimize.
[2023-03-23 13:18:43] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-23 13:18:43] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 1 ms to minimize.
[2023-03-23 13:18:44] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2023-03-23 13:18:44] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2023-03-23 13:18:44] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2023-03-23 13:18:44] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 30 ms to minimize.
[2023-03-23 13:18:45] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2023-03-23 13:18:45] [INFO ] Deduced a trap composed of 16 places in 405 ms of which 0 ms to minimize.
[2023-03-23 13:18:45] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 0 ms to minimize.
[2023-03-23 13:18:46] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6706 ms
[2023-03-23 13:18:46] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-23 13:18:46] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2023-03-23 13:18:47] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-23 13:18:47] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-23 13:18:47] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 0 ms to minimize.
[2023-03-23 13:18:48] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-23 13:18:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1862 ms
[2023-03-23 13:18:48] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-23 13:18:48] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2023-03-23 13:18:49] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 1 ms to minimize.
[2023-03-23 13:18:49] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2023-03-23 13:18:49] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-23 13:18:49] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 0 ms to minimize.
[2023-03-23 13:18:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1808 ms
[2023-03-23 13:18:50] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 0 ms to minimize.
[2023-03-23 13:18:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-23 13:18:52] [INFO ] Deduced a trap composed of 8 places in 405 ms of which 1 ms to minimize.
[2023-03-23 13:18:52] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2023-03-23 13:18:52] [INFO ] Deduced a trap composed of 7 places in 300 ms of which 0 ms to minimize.
[2023-03-23 13:18:53] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 0 ms to minimize.
[2023-03-23 13:18:53] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-23 13:18:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2009 ms
[2023-03-23 13:18:54] [INFO ] Deduced a trap composed of 7 places in 447 ms of which 1 ms to minimize.
[2023-03-23 13:18:54] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 1 ms to minimize.
[2023-03-23 13:18:55] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 1 ms to minimize.
[2023-03-23 13:18:55] [INFO ] Deduced a trap composed of 8 places in 417 ms of which 1 ms to minimize.
[2023-03-23 13:18:55] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 1 ms to minimize.
[2023-03-23 13:18:56] [INFO ] Deduced a trap composed of 7 places in 379 ms of which 0 ms to minimize.
[2023-03-23 13:18:56] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2023-03-23 13:18:57] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 1 ms to minimize.
[2023-03-23 13:18:57] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 1 ms to minimize.
[2023-03-23 13:18:57] [INFO ] Deduced a trap composed of 10 places in 332 ms of which 1 ms to minimize.
[2023-03-23 13:18:58] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2023-03-23 13:18:58] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 0 ms to minimize.
[2023-03-23 13:18:58] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 1 ms to minimize.
[2023-03-23 13:18:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5078 ms
[2023-03-23 13:18:59] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 0 ms to minimize.
[2023-03-23 13:18:59] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 0 ms to minimize.
[2023-03-23 13:18:59] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2023-03-23 13:19:00] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-23 13:19:00] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-23 13:19:00] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-23 13:19:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1700 ms
[2023-03-23 13:19:01] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 0 ms to minimize.
[2023-03-23 13:19:01] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-23 13:19:01] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 1 ms to minimize.
[2023-03-23 13:19:02] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 1 ms to minimize.
[2023-03-23 13:19:02] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-23 13:19:02] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 0 ms to minimize.
[2023-03-23 13:19:02] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 35 ms to minimize.
[2023-03-23 13:19:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2351 ms
[2023-03-23 13:19:03] [INFO ] After 31062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2051 ms.
[2023-03-23 13:19:05] [INFO ] After 35226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-23 13:19:05] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-23 13:19:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1137 places, 958 transitions and 4097 arcs took 5 ms.
[2023-03-23 13:19:05] [INFO ] Flatten gal took : 241 ms
Total runtime 105752 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (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: 1137 places, 958 transitions, 4097 arcs.
Final Score: 106771.999
Took : 38 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-00 (reachable & potential(( ( ( (tk(P705)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P705)) ) ) & ( ( (tk(P497)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P497)) ) ) )))
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-01 (reachable & potential(( ( ( ( ( (tk(P488)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P488)) ) ) & ( ( ( (tk(P840)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P840)) ) ) & ( ( (tk(P629)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P629)) ) ) ) ) & ( ( ( (tk(P365)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P365)) ) ) & ( ( ( (tk(P208)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P208)) ) ) & ( ( (tk(P758)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P758)) ) ) ) ) ) & ( ( ( ( ( (tk(P377)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P377)) ) ) | ( ( (tk(P343)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P343)) ) ) ) & ( ( ( ( (tk(P8)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P8)) ) ) | ( ( (tk(P1039)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1039)) ) ) ) & ( ( ( ( ( (tk(P686)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P686)) ) ) & ( ( ( (tk(P1131)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1131)) ) ) & ( ( (tk(P116)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P116)) ) ) ) ) & ( ( ( (tk(P167)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P167)) ) ) & ( ( ( (tk(P796)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P796)) ) ) & ( ( ( (tk(P855)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P855)) ) ) | ( ( (tk(P932)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P932)) ) ) ) ) ) ) | ( ( ( ( (tk(P1029)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1029)) ) ) & ( ( ( (tk(P879)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P879)) ) ) & ( ( ( (tk(P675)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P675)) ) ) | ( ( (tk(P164)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P164)) ) ) ) ) ) & ( ( ( ( (tk(P1130)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1130)) ) ) | ( ( (tk(P27)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P27)) ) ) ) & ( ( ( ( (tk(P765)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P765)) ) ) | ( ( ( (tk(P206)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P206)) ) ) | ( ( ( (tk(P644)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P644)) ) ) & ( ( (tk(P410)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P410)) ) ) ) ) ) & ( ( ( ( (tk(P36)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P36)) ) ) | ( ( (tk(P382)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P382)) ) ) ) | ( ( ( (tk(P458)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P458)) ) ) | ( ( (tk(P290)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P290)) ) ) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P116)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P116)) ) ) | ( ( (tk(P1051)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1051)) ) ) ) & ( ( ( ( (tk(P885)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P885)) ) ) | ( ( ( (tk(P119)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P119)) ) ) & ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) ) ) & ( ( ( (tk(P680)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P680)) ) ) | ( ( ( (tk(P623)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P623)) ) ) | ( ( ( (tk(P1055)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1055)) ) ) & ( ( (tk(P173)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P173)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-02 (reachable & potential(( ( ( ( (tk(P317)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P317)) ) ) & ( ( (tk(P707)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P707)) ) ) ) & ( ( ( ( (tk(P876)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P876)) ) ) | ( ( (tk(P788)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P788)) ) ) ) & ( ( ( (tk(P242)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P242)) ) ) | ( ( (tk(P608)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P608)) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-03 (reachable & potential(( ( ( ( (tk(P323)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P323)) ) ) & ( ( (tk(P849)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P849)) ) ) ) & ( ( ( ( (tk(P956)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P956)) ) ) | ( ( ( (tk(P321)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P321)) ) ) | ( ( (tk(P1112)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1112)) ) ) ) ) & ( ( ( (tk(P146)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P146)) ) ) | ( ( ( (tk(P688)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P688)) ) ) | ( ( ( (tk(P419)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P419)) ) ) & ( ( (tk(P874)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P874)) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-04 (reachable & potential(( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) )))
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( ( (tk(P927)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P927)) ) ) | ( ( (tk(P99)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P99)) ) ) ) | ( ( ( (tk(P776)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P776)) ) ) | ( ( ( (tk(P1047)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1047)) ) ) | ( ( ( (tk(P351)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P351)) ) ) & ( ( (tk(P844)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P844)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P736)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P736)) ) ) | ( ( (tk(P614)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P614)) ) ) ) | ( ( ( (tk(P1022)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1022)) ) ) | ( ( (tk(P1082)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1082)) ) ) ) ) | ( ( ( ( (tk(P1106)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1106)) ) ) | ( ( (tk(P285)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P285)) ) ) ) | ( ( ( ( (tk(P188)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P188)) ) ) & ( ( ( (tk(P932)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P932)) ) ) | ( ( ( ( (tk(P1098)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1098)) ) ) | ( ( (tk(P607)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P607)) ) ) ) & ( ( ( (tk(P1086)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1086)) ) ) | ( ( (tk(P599)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P599)) ) ) ) ) ) ) | ( ( ( ( ( (tk(P237)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P237)) ) ) & ( ( (tk(P307)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P307)) ) ) ) & ( ( ( (tk(P905)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P905)) ) ) & ( ( (tk(P532)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P532)) ) ) ) ) & ( ( ( ( (tk(P87)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P87)) ) ) & ( ( (tk(P485)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P485)) ) ) ) & ( ( ( (tk(P203)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P203)) ) ) & ( ( ( ( (tk(P493)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P493)) ) ) | ( ( (tk(P1054)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1054)) ) ) ) & ( ( ( ( (tk(P171)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P171)) ) ) | ( ( (tk(P380)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P380)) ) ) ) | ( ( ( (tk(P179)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P179)) ) ) | ( ( ( (tk(P674)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P674)) ) ) & ( ( (tk(P816)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P816)) ) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-08 (reachable & potential(( ( ( (tk(P21)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P21)) ) ) & ( ( (tk(P702)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P702)) ) ) )))
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-11 (reachable & potential(( ( ( ( ( (tk(P989)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P989)) ) ) & ( ( (tk(P1072)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1072)) ) ) ) & ( ( ( (tk(P982)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P982)) ) ) & ( ( (tk(P519)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P519)) ) ) ) ) & ( ( ( ( (tk(P378)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P378)) ) ) & ( ( (tk(P1108)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1108)) ) ) ) & ( ( ( ( (tk(P400)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P400)) ) ) | ( ( (tk(P229)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P229)) ) ) ) & ( ( ( ( (tk(P994)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P994)) ) ) | ( ( (tk(P939)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P939)) ) ) ) | ( ( ( (tk(P258)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P258)) ) ) | ( ( (tk(P514)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P514)) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-040B-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (tk(P176)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P176)) ) ) | ( ( (tk(P642)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P642)) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9442212 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16105244 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-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 ShieldPPPt-PT-040B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-oct2-167903719100670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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