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-167903718400158.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 846K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679557141411

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:39:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 07:39:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:39:04] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-23 07:39:04] [INFO ] Transformed 3003 places.
[2023-03-23 07:39:04] [INFO ] Transformed 2953 transitions.
[2023-03-23 07:39:04] [INFO ] Found NUPN structural information;
[2023-03-23 07:39:04] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 14) seen :10
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-00 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2953 rows 3003 cols
[2023-03-23 07:39:05] [INFO ] Computed 451 place invariants in 32 ms
[2023-03-23 07:39:06] [INFO ] After 1154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:39:07] [INFO ] [Nat]Absence check using 451 positive place invariants in 218 ms returned sat
[2023-03-23 07:39:13] [INFO ] After 5776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:39:16] [INFO ] Deduced a trap composed of 19 places in 2210 ms of which 14 ms to minimize.
[2023-03-23 07:39:18] [INFO ] Deduced a trap composed of 18 places in 1155 ms of which 5 ms to minimize.
[2023-03-23 07:39:19] [INFO ] Deduced a trap composed of 21 places in 1120 ms of which 8 ms to minimize.
[2023-03-23 07:39:20] [INFO ] Deduced a trap composed of 17 places in 1290 ms of which 5 ms to minimize.
[2023-03-23 07:39:21] [INFO ] Deduced a trap composed of 18 places in 1021 ms of which 29 ms to minimize.
[2023-03-23 07:39:23] [INFO ] Deduced a trap composed of 28 places in 1174 ms of which 3 ms to minimize.
[2023-03-23 07:39:24] [INFO ] Deduced a trap composed of 16 places in 1329 ms of which 4 ms to minimize.
[2023-03-23 07:39:25] [INFO ] Deduced a trap composed of 28 places in 1063 ms of which 2 ms to minimize.
[2023-03-23 07:39:29] [INFO ] Deduced a trap composed of 14 places in 1427 ms of which 2 ms to minimize.
[2023-03-23 07:39:30] [INFO ] Deduced a trap composed of 24 places in 1500 ms of which 3 ms to minimize.
[2023-03-23 07:39:31] [INFO ] Deduced a trap composed of 18 places in 970 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:39:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:39:31] [INFO ] After 25186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 461 ms.
Support contains 93 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 3003 transition count 2719
Reduce places removed 234 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 239 rules applied. Total rules applied 473 place count 2769 transition count 2714
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 478 place count 2764 transition count 2714
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 245 Pre rules applied. Total rules applied 478 place count 2764 transition count 2469
Deduced a syphon composed of 245 places in 8 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 968 place count 2519 transition count 2469
Discarding 330 places :
Symmetric choice reduction at 3 with 330 rule applications. Total rules 1298 place count 2189 transition count 2139
Iterating global reduction 3 with 330 rules applied. Total rules applied 1628 place count 2189 transition count 2139
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 1628 place count 2189 transition count 2006
Deduced a syphon composed of 133 places in 14 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 1894 place count 2056 transition count 2006
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 6 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 3294 place count 1356 transition count 1306
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 320 times.
Drop transitions removed 320 transitions
Iterating global reduction 3 with 320 rules applied. Total rules applied 3614 place count 1356 transition count 1306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3615 place count 1355 transition count 1305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3616 place count 1354 transition count 1305
Applied a total of 3616 rules in 1048 ms. Remains 1354 /3003 variables (removed 1649) and now considering 1305/2953 (removed 1648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1049 ms. Remains : 1354/3003 places, 1305/2953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1305 rows 1354 cols
[2023-03-23 07:39:33] [INFO ] Computed 450 place invariants in 33 ms
[2023-03-23 07:39:34] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:39:34] [INFO ] [Nat]Absence check using 441 positive place invariants in 137 ms returned sat
[2023-03-23 07:39:34] [INFO ] [Nat]Absence check using 441 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-23 07:39:35] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:39:36] [INFO ] Deduced a trap composed of 5 places in 587 ms of which 1 ms to minimize.
[2023-03-23 07:39:36] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2023-03-23 07:39:37] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 0 ms to minimize.
[2023-03-23 07:39:37] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 0 ms to minimize.
[2023-03-23 07:39:40] [INFO ] Deduced a trap composed of 5 places in 2347 ms of which 1 ms to minimize.
[2023-03-23 07:39:40] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 1 ms to minimize.
[2023-03-23 07:39:41] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 0 ms to minimize.
[2023-03-23 07:39:41] [INFO ] Deduced a trap composed of 12 places in 679 ms of which 1 ms to minimize.
[2023-03-23 07:39:42] [INFO ] Deduced a trap composed of 11 places in 450 ms of which 0 ms to minimize.
[2023-03-23 07:39:42] [INFO ] Deduced a trap composed of 13 places in 398 ms of which 0 ms to minimize.
[2023-03-23 07:39:43] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 0 ms to minimize.
[2023-03-23 07:39:43] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 0 ms to minimize.
[2023-03-23 07:39:43] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 0 ms to minimize.
[2023-03-23 07:39:44] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2023-03-23 07:39:44] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 1 ms to minimize.
[2023-03-23 07:39:45] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 1 ms to minimize.
[2023-03-23 07:39:45] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 1 ms to minimize.
[2023-03-23 07:39:45] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 0 ms to minimize.
[2023-03-23 07:39:46] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 1 ms to minimize.
[2023-03-23 07:39:46] [INFO ] Deduced a trap composed of 8 places in 319 ms of which 0 ms to minimize.
[2023-03-23 07:39:47] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 0 ms to minimize.
[2023-03-23 07:39:47] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 1 ms to minimize.
[2023-03-23 07:39:47] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 17 ms to minimize.
[2023-03-23 07:39:48] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
[2023-03-23 07:39:48] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 0 ms to minimize.
[2023-03-23 07:39:49] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 0 ms to minimize.
[2023-03-23 07:39:49] [INFO ] Deduced a trap composed of 18 places in 412 ms of which 1 ms to minimize.
[2023-03-23 07:39:50] [INFO ] Deduced a trap composed of 7 places in 871 ms of which 0 ms to minimize.
[2023-03-23 07:39:51] [INFO ] Deduced a trap composed of 8 places in 785 ms of which 2 ms to minimize.
[2023-03-23 07:39:51] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 0 ms to minimize.
[2023-03-23 07:39:52] [INFO ] Deduced a trap composed of 7 places in 483 ms of which 1 ms to minimize.
[2023-03-23 07:39:52] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 2 ms to minimize.
[2023-03-23 07:39:53] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2023-03-23 07:39:53] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2023-03-23 07:39:53] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 0 ms to minimize.
[2023-03-23 07:39:54] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 1 ms to minimize.
[2023-03-23 07:39:54] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2023-03-23 07:39:55] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 1 ms to minimize.
[2023-03-23 07:39:55] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 0 ms to minimize.
[2023-03-23 07:39:55] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 22 ms to minimize.
[2023-03-23 07:39:56] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 0 ms to minimize.
[2023-03-23 07:39:56] [INFO ] Deduced a trap composed of 6 places in 571 ms of which 4 ms to minimize.
[2023-03-23 07:39:56] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 1 ms to minimize.
[2023-03-23 07:39:57] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 0 ms to minimize.
[2023-03-23 07:39:57] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2023-03-23 07:39:57] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-23 07:39:58] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 0 ms to minimize.
[2023-03-23 07:39:58] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 0 ms to minimize.
[2023-03-23 07:39:58] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 22791 ms
[2023-03-23 07:39:59] [INFO ] Deduced a trap composed of 3 places in 353 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 07:39:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:39:59] [INFO ] After 25170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 150 ms.
Support contains 77 out of 1354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1354/1354 places, 1305/1305 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1354 transition count 1302
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1351 transition count 1302
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 1351 transition count 1297
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 1346 transition count 1297
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 40 place count 1334 transition count 1285
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 1334 transition count 1285
Applied a total of 43 rules in 164 ms. Remains 1334 /1354 variables (removed 20) and now considering 1285/1305 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 1334/1354 places, 1285/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 118846 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 118846 steps, saw 77336 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :2
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1285 rows 1334 cols
[2023-03-23 07:40:03] [INFO ] Computed 450 place invariants in 34 ms
[2023-03-23 07:40:03] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:40:03] [INFO ] [Nat]Absence check using 442 positive place invariants in 82 ms returned sat
[2023-03-23 07:40:03] [INFO ] [Nat]Absence check using 442 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-23 07:40:04] [INFO ] After 1006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:40:04] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 1 ms to minimize.
[2023-03-23 07:40:05] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2023-03-23 07:40:05] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2023-03-23 07:40:05] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 6 ms to minimize.
[2023-03-23 07:40:05] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2023-03-23 07:40:06] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-23 07:40:06] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-23 07:40:06] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-23 07:40:06] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-03-23 07:40:07] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 14 ms to minimize.
[2023-03-23 07:40:07] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 1 ms to minimize.
[2023-03-23 07:40:07] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-23 07:40:07] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2023-03-23 07:40:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3311 ms
[2023-03-23 07:40:07] [INFO ] After 4404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-23 07:40:08] [INFO ] After 4892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 27 out of 1334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1334/1334 places, 1285/1285 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1334 transition count 1283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1332 transition count 1283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 4 place count 1332 transition count 1274
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 1323 transition count 1274
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 90 place count 1289 transition count 1240
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 102 place count 1289 transition count 1240
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 111 place count 1280 transition count 1231
Applied a total of 111 rules in 182 ms. Remains 1280 /1334 variables (removed 54) and now considering 1231/1285 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 1280/1334 places, 1231/1285 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 155884 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155884 steps, saw 93911 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1231 rows 1280 cols
[2023-03-23 07:40:11] [INFO ] Computed 450 place invariants in 17 ms
[2023-03-23 07:40:11] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:40:12] [INFO ] [Nat]Absence check using 446 positive place invariants in 76 ms returned sat
[2023-03-23 07:40:12] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 07:40:13] [INFO ] After 947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:40:13] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-23 07:40:13] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-23 07:40:13] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 0 ms to minimize.
[2023-03-23 07:40:14] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2023-03-23 07:40:14] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2023-03-23 07:40:14] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2023-03-23 07:40:15] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2023-03-23 07:40:15] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
[2023-03-23 07:40:15] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2023-03-23 07:40:15] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 0 ms to minimize.
[2023-03-23 07:40:16] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2023-03-23 07:40:16] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-23 07:40:17] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 1 ms to minimize.
[2023-03-23 07:40:17] [INFO ] Deduced a trap composed of 7 places in 429 ms of which 1 ms to minimize.
[2023-03-23 07:40:17] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 1 ms to minimize.
[2023-03-23 07:40:18] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2023-03-23 07:40:18] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2023-03-23 07:40:18] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 1 ms to minimize.
[2023-03-23 07:40:18] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-03-23 07:40:19] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-23 07:40:19] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2023-03-23 07:40:19] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 1 ms to minimize.
[2023-03-23 07:40:19] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2023-03-23 07:40:20] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2023-03-23 07:40:20] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2023-03-23 07:40:20] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 0 ms to minimize.
[2023-03-23 07:40:21] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-23 07:40:21] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2023-03-23 07:40:21] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2023-03-23 07:40:22] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2023-03-23 07:40:22] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 0 ms to minimize.
[2023-03-23 07:40:22] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-23 07:40:22] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 9567 ms
[2023-03-23 07:40:22] [INFO ] After 10592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-23 07:40:22] [INFO ] After 11034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 27 out of 1280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 74 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1280/1280 places, 1231/1231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 38 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
[2023-03-23 07:40:22] [INFO ] Invariant cache hit.
[2023-03-23 07:40:23] [INFO ] Implicit Places using invariants in 862 ms returned []
[2023-03-23 07:40:23] [INFO ] Invariant cache hit.
[2023-03-23 07:40:27] [INFO ] Implicit Places using invariants and state equation in 3258 ms returned []
Implicit Place search using SMT with State Equation took 4136 ms to find 0 implicit places.
[2023-03-23 07:40:27] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-23 07:40:27] [INFO ] Invariant cache hit.
[2023-03-23 07:40:28] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5245 ms. Remains : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 60 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-23 07:40:28] [INFO ] Invariant cache hit.
[2023-03-23 07:40:28] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:40:28] [INFO ] [Nat]Absence check using 446 positive place invariants in 173 ms returned sat
[2023-03-23 07:40:28] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-23 07:40:29] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:40:29] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-23 07:40:30] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 0 ms to minimize.
[2023-03-23 07:40:30] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-23 07:40:30] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-23 07:40:30] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-23 07:40:31] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2023-03-23 07:40:31] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-23 07:40:31] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-23 07:40:32] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2023-03-23 07:40:32] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-23 07:40:32] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-23 07:40:32] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 1 ms to minimize.
[2023-03-23 07:40:33] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2023-03-23 07:40:33] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 0 ms to minimize.
[2023-03-23 07:40:33] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-23 07:40:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3966 ms
[2023-03-23 07:40:33] [INFO ] After 4785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-23 07:40:33] [INFO ] After 5384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:40:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-23 07:40:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1280 places, 1231 transitions and 5790 arcs took 13 ms.
[2023-03-23 07:40:34] [INFO ] Flatten gal took : 243 ms
Total runtime 90203 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 050B
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: 1280 places, 1231 transitions, 5790 arcs.
Final Score: 17218.2
Took : 53 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-050B-ReachabilityCardinality-04 (reachable & potential(( ( ( ( ( (tk(P548)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P548)) ) ) & ( ( (tk(P668)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P668)) ) ) ) & ( ( ( (tk(P793)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P793)) ) ) & ( ( (tk(P641)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P641)) ) ) ) ) & ( ( ( ( (tk(P408)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P408)) ) ) & ( ( ( (tk(P199)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P199)) ) ) | ( ( ( (tk(P945)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P945)) ) ) & ( ( ( (tk(P1129)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1129)) ) ) | ( ( ( (tk(P97)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P97)) ) ) | ( ( (tk(P233)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P233)) ) ) ) ) ) ) ) & ( ( ( ( ( (tk(P291)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P291)) ) ) & ( ( (tk(P1209)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1209)) ) ) ) | ( ( ( (tk(P972)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P972)) ) ) & ( ( ( (tk(P1003)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1003)) ) ) & ( ( (tk(P294)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P294)) ) ) ) ) ) & ( ( ( ( (tk(P404)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P404)) ) ) & ( ( ( (tk(P1099)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1099)) ) ) & ( ( ( ( (tk(P1206)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1206)) ) ) | ( ( (tk(P1240)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1240)) ) ) ) | ( ( ( (tk(P1028)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1028)) ) ) | ( ( ( (tk(P26)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P26)) ) ) & ( ( (tk(P966)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P966)) ) ) ) ) ) ) ) | ( ( ( (tk(P1120)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1120)) ) ) & ( ( ( (tk(P1104)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1104)) ) ) & ( ( ( (tk(P717)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P717)) ) ) | ( ( ( (tk(P235)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P235)) ) ) | ( ( (tk(P384)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P384)) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8373304 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16100728 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldIIPs-PT-050B, 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-167903718400158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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