MCC'2023- Execution of r395-oct2-167903718400174

About the Execution of Smart+red for ShieldIIPs-PT-100B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3946.695	3600000.00	3747730.00	185.10	?FT??FF?TFFT?F??	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 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.9K 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.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 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 1.7M 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-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679558611427

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-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:03:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 08:03:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:03:34] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2023-03-23 08:03:34] [INFO ] Transformed 6003 places.
[2023-03-23 08:03:34] [INFO ] Transformed 5903 transitions.
[2023-03-23 08:03:34] [INFO ] Found NUPN structural information;
[2023-03-23 08:03:35] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 802 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 14) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-23 08:03:36] [INFO ] Computed 901 place invariants in 68 ms
[2023-03-23 08:03:38] [INFO ] After 2522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 08:03:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 1185 ms returned sat
[2023-03-23 08:04:04] [INFO ] After 20537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 08:04:04] [INFO ] After 20547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 08:04:04] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 324 ms.
Support contains 148 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 6003 transition count 5436
Reduce places removed 467 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 480 rules applied. Total rules applied 947 place count 5536 transition count 5423
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 960 place count 5523 transition count 5423
Performed 489 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 489 Pre rules applied. Total rules applied 960 place count 5523 transition count 4934
Deduced a syphon composed of 489 places in 25 ms
Reduce places removed 489 places and 0 transitions.
Iterating global reduction 3 with 978 rules applied. Total rules applied 1938 place count 5034 transition count 4934
Discarding 663 places :
Symmetric choice reduction at 3 with 663 rule applications. Total rules 2601 place count 4371 transition count 4271
Iterating global reduction 3 with 663 rules applied. Total rules applied 3264 place count 4371 transition count 4271
Performed 271 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 271 Pre rules applied. Total rules applied 3264 place count 4371 transition count 4000
Deduced a syphon composed of 271 places in 53 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 3806 place count 4100 transition count 4000
Performed 1421 Post agglomeration using F-continuation condition.Transition count delta: 1421
Deduced a syphon composed of 1421 places in 15 ms
Reduce places removed 1421 places and 0 transitions.
Iterating global reduction 3 with 2842 rules applied. Total rules applied 6648 place count 2679 transition count 2579
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 669 times.
Drop transitions removed 669 transitions
Iterating global reduction 3 with 669 rules applied. Total rules applied 7317 place count 2679 transition count 2579
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7318 place count 2678 transition count 2578
Applied a total of 7318 rules in 2149 ms. Remains 2678 /6003 variables (removed 3325) and now considering 2578/5903 (removed 3325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2151 ms. Remains : 2678/6003 places, 2578/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 9) seen :2
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2578 rows 2678 cols
[2023-03-23 08:04:07] [INFO ] Computed 901 place invariants in 85 ms
[2023-03-23 08:04:08] [INFO ] After 922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 08:04:09] [INFO ] [Nat]Absence check using 895 positive place invariants in 291 ms returned sat
[2023-03-23 08:04:09] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-23 08:04:15] [INFO ] After 4713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 08:04:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 08:04:17] [INFO ] After 2914ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 08:04:19] [INFO ] Deduced a trap composed of 8 places in 511 ms of which 22 ms to minimize.
[2023-03-23 08:04:20] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 1 ms to minimize.
[2023-03-23 08:04:20] [INFO ] Deduced a trap composed of 9 places in 419 ms of which 1 ms to minimize.
[2023-03-23 08:04:21] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 1 ms to minimize.
[2023-03-23 08:04:21] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 14 ms to minimize.
[2023-03-23 08:04:22] [INFO ] Deduced a trap composed of 15 places in 534 ms of which 1 ms to minimize.
[2023-03-23 08:04:22] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 1 ms to minimize.
[2023-03-23 08:04:23] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 0 ms to minimize.
[2023-03-23 08:04:23] [INFO ] Deduced a trap composed of 12 places in 475 ms of which 1 ms to minimize.
[2023-03-23 08:04:24] [INFO ] Deduced a trap composed of 21 places in 468 ms of which 1 ms to minimize.
[2023-03-23 08:04:24] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 0 ms to minimize.
[2023-03-23 08:04:25] [INFO ] Deduced a trap composed of 22 places in 553 ms of which 2 ms to minimize.
[2023-03-23 08:04:26] [INFO ] Deduced a trap composed of 21 places in 401 ms of which 1 ms to minimize.
[2023-03-23 08:04:26] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2023-03-23 08:04:27] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 1 ms to minimize.
[2023-03-23 08:04:27] [INFO ] Deduced a trap composed of 10 places in 542 ms of which 0 ms to minimize.
[2023-03-23 08:04:28] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2023-03-23 08:04:29] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2023-03-23 08:04:29] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 0 ms to minimize.
[2023-03-23 08:04:30] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 1 ms to minimize.
[2023-03-23 08:04:30] [INFO ] Deduced a trap composed of 19 places in 432 ms of which 1 ms to minimize.
[2023-03-23 08:04:31] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 22 ms to minimize.
[2023-03-23 08:04:31] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2023-03-23 08:04:32] [INFO ] Deduced a trap composed of 12 places in 399 ms of which 1 ms to minimize.
[2023-03-23 08:04:32] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2023-03-23 08:04:32] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 1 ms to minimize.
[2023-03-23 08:04:33] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-23 08:04:33] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 0 ms to minimize.
[2023-03-23 08:04:34] [INFO ] Deduced a trap composed of 16 places in 200 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 08:04:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 08:04:34] [INFO ] After 25184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1189 ms.
Support contains 143 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 2578/2578 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 0 with 1 rules applied. Total rules applied 1 place count 2678 transition count 2577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2677 transition count 2577
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 11 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 2671 transition count 2571
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 2671 transition count 2571
Applied a total of 15 rules in 314 ms. Remains 2671 /2678 variables (removed 7) and now considering 2571/2578 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 2671/2678 places, 2571/2578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 48611 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 48611 steps, saw 45909 distinct states, run finished after 3003 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2671 cols
[2023-03-23 08:04:39] [INFO ] Computed 901 place invariants in 85 ms
[2023-03-23 08:04:40] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 08:04:41] [INFO ] [Nat]Absence check using 895 positive place invariants in 365 ms returned sat
[2023-03-23 08:04:41] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 08:04:46] [INFO ] After 4071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 08:04:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 08:04:48] [INFO ] After 2695ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 08:04:50] [INFO ] Deduced a trap composed of 7 places in 1055 ms of which 3 ms to minimize.
[2023-03-23 08:04:51] [INFO ] Deduced a trap composed of 10 places in 422 ms of which 0 ms to minimize.
[2023-03-23 08:04:51] [INFO ] Deduced a trap composed of 13 places in 462 ms of which 0 ms to minimize.
[2023-03-23 08:04:52] [INFO ] Deduced a trap composed of 11 places in 390 ms of which 1 ms to minimize.
[2023-03-23 08:04:52] [INFO ] Deduced a trap composed of 7 places in 447 ms of which 18 ms to minimize.
[2023-03-23 08:04:53] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 1 ms to minimize.
[2023-03-23 08:04:53] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 18 ms to minimize.
[2023-03-23 08:04:54] [INFO ] Deduced a trap composed of 6 places in 513 ms of which 1 ms to minimize.
[2023-03-23 08:04:54] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 2 ms to minimize.
[2023-03-23 08:04:55] [INFO ] Deduced a trap composed of 8 places in 415 ms of which 1 ms to minimize.
[2023-03-23 08:04:55] [INFO ] Deduced a trap composed of 14 places in 441 ms of which 14 ms to minimize.
[2023-03-23 08:04:56] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2023-03-23 08:04:56] [INFO ] Deduced a trap composed of 12 places in 407 ms of which 0 ms to minimize.
[2023-03-23 08:04:57] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 1 ms to minimize.
[2023-03-23 08:04:58] [INFO ] Deduced a trap composed of 18 places in 447 ms of which 1 ms to minimize.
[2023-03-23 08:04:58] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 1 ms to minimize.
[2023-03-23 08:04:59] [INFO ] Deduced a trap composed of 21 places in 441 ms of which 0 ms to minimize.
[2023-03-23 08:04:59] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 1 ms to minimize.
[2023-03-23 08:05:00] [INFO ] Deduced a trap composed of 19 places in 417 ms of which 1 ms to minimize.
[2023-03-23 08:05:00] [INFO ] Deduced a trap composed of 19 places in 360 ms of which 1 ms to minimize.
[2023-03-23 08:05:01] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 0 ms to minimize.
[2023-03-23 08:05:01] [INFO ] Deduced a trap composed of 7 places in 435 ms of which 28 ms to minimize.
[2023-03-23 08:05:02] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 1 ms to minimize.
[2023-03-23 08:05:02] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 0 ms to minimize.
[2023-03-23 08:05:02] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-23 08:05:03] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 1 ms to minimize.
[2023-03-23 08:05:03] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 13 ms to minimize.
[2023-03-23 08:05:04] [INFO ] Deduced a trap composed of 15 places in 450 ms of which 1 ms to minimize.
[2023-03-23 08:05:04] [INFO ] Deduced a trap composed of 9 places in 363 ms of which 1 ms to minimize.
[2023-03-23 08:05:05] [INFO ] Deduced a trap composed of 19 places in 344 ms of which 2 ms to minimize.
[2023-03-23 08:05:05] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 1 ms to minimize.
[2023-03-23 08:05:05] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 16366 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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 08:05:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 08:05:05] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1177 ms.
Support contains 143 out of 2671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 107 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2671/2671 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 109 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-23 08:05:07] [INFO ] Invariant cache hit.
[2023-03-23 08:05:10] [INFO ] Implicit Places using invariants in 3335 ms returned [2656]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3343 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2670/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 116 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3570 ms. Remains : 2670/2671 places, 2571/2571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 54204 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54204 steps, saw 51163 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2670 cols
[2023-03-23 08:05:14] [INFO ] Computed 900 place invariants in 33 ms
[2023-03-23 08:05:15] [INFO ] After 827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 08:05:16] [INFO ] [Nat]Absence check using 894 positive place invariants in 433 ms returned sat
[2023-03-23 08:05:16] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-23 08:05:21] [INFO ] After 4657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 08:05:23] [INFO ] Deduced a trap composed of 6 places in 787 ms of which 1 ms to minimize.
[2023-03-23 08:05:23] [INFO ] Deduced a trap composed of 9 places in 587 ms of which 1 ms to minimize.
[2023-03-23 08:05:24] [INFO ] Deduced a trap composed of 9 places in 674 ms of which 1 ms to minimize.
[2023-03-23 08:05:25] [INFO ] Deduced a trap composed of 9 places in 656 ms of which 9 ms to minimize.
[2023-03-23 08:05:26] [INFO ] Deduced a trap composed of 10 places in 441 ms of which 13 ms to minimize.
[2023-03-23 08:05:26] [INFO ] Deduced a trap composed of 5 places in 499 ms of which 1 ms to minimize.
[2023-03-23 08:05:27] [INFO ] Deduced a trap composed of 9 places in 502 ms of which 4 ms to minimize.
[2023-03-23 08:05:27] [INFO ] Deduced a trap composed of 9 places in 516 ms of which 0 ms to minimize.
[2023-03-23 08:05:28] [INFO ] Deduced a trap composed of 13 places in 509 ms of which 2 ms to minimize.
[2023-03-23 08:05:29] [INFO ] Deduced a trap composed of 13 places in 461 ms of which 1 ms to minimize.
[2023-03-23 08:05:29] [INFO ] Deduced a trap composed of 11 places in 603 ms of which 1 ms to minimize.
[2023-03-23 08:05:30] [INFO ] Deduced a trap composed of 12 places in 578 ms of which 1 ms to minimize.
[2023-03-23 08:05:31] [INFO ] Deduced a trap composed of 8 places in 569 ms of which 1 ms to minimize.
[2023-03-23 08:05:31] [INFO ] Deduced a trap composed of 16 places in 423 ms of which 0 ms to minimize.
[2023-03-23 08:05:32] [INFO ] Deduced a trap composed of 7 places in 699 ms of which 1 ms to minimize.
[2023-03-23 08:05:33] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 1 ms to minimize.
[2023-03-23 08:05:34] [INFO ] Deduced a trap composed of 15 places in 717 ms of which 3 ms to minimize.
[2023-03-23 08:05:34] [INFO ] Deduced a trap composed of 20 places in 459 ms of which 1 ms to minimize.
[2023-03-23 08:05:35] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 2 ms to minimize.
[2023-03-23 08:05:35] [INFO ] Deduced a trap composed of 21 places in 509 ms of which 1 ms to minimize.
[2023-03-23 08:05:36] [INFO ] Deduced a trap composed of 8 places in 423 ms of which 1 ms to minimize.
[2023-03-23 08:05:36] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 1 ms to minimize.
[2023-03-23 08:05:37] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 1 ms to minimize.
[2023-03-23 08:05:37] [INFO ] Deduced a trap composed of 21 places in 539 ms of which 2 ms to minimize.
[2023-03-23 08:05:38] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 1 ms to minimize.
[2023-03-23 08:05:38] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 0 ms to minimize.
[2023-03-23 08:05:39] [INFO ] Deduced a trap composed of 8 places in 420 ms of which 0 ms to minimize.
[2023-03-23 08:05:39] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 0 ms to minimize.
[2023-03-23 08:05:40] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 0 ms to minimize.
[2023-03-23 08:05:40] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 0 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 08:05:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 08:05:40] [INFO ] After 25143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1093 ms.
Support contains 143 out of 2670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 135 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 2670/2670 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 91 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-23 08:05:42] [INFO ] Invariant cache hit.
[2023-03-23 08:05:44] [INFO ] Implicit Places using invariants in 2394 ms returned []
[2023-03-23 08:05:44] [INFO ] Invariant cache hit.
[2023-03-23 08:05:51] [INFO ] Implicit Places using invariants and state equation in 6675 ms returned []
Implicit Place search using SMT with State Equation took 9075 ms to find 0 implicit places.
[2023-03-23 08:05:51] [INFO ] Redundant transitions in 232 ms returned []
[2023-03-23 08:05:51] [INFO ] Invariant cache hit.
[2023-03-23 08:05:54] [INFO ] Dead Transitions using invariants and state equation in 2798 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12238 ms. Remains : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 131 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-23 08:05:54] [INFO ] Invariant cache hit.
[2023-03-23 08:05:55] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 08:05:56] [INFO ] [Nat]Absence check using 894 positive place invariants in 320 ms returned sat
[2023-03-23 08:05:56] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 76 ms returned sat
[2023-03-23 08:06:01] [INFO ] After 4691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 08:06:02] [INFO ] Deduced a trap composed of 6 places in 464 ms of which 2 ms to minimize.
[2023-03-23 08:06:03] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 1 ms to minimize.
[2023-03-23 08:06:03] [INFO ] Deduced a trap composed of 7 places in 503 ms of which 1 ms to minimize.
[2023-03-23 08:06:04] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 0 ms to minimize.
[2023-03-23 08:06:04] [INFO ] Deduced a trap composed of 13 places in 586 ms of which 1 ms to minimize.
[2023-03-23 08:06:05] [INFO ] Deduced a trap composed of 12 places in 476 ms of which 1 ms to minimize.
[2023-03-23 08:06:06] [INFO ] Deduced a trap composed of 11 places in 356 ms of which 1 ms to minimize.
[2023-03-23 08:06:06] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 1 ms to minimize.
[2023-03-23 08:06:06] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 1 ms to minimize.
[2023-03-23 08:06:07] [INFO ] Deduced a trap composed of 7 places in 601 ms of which 1 ms to minimize.
[2023-03-23 08:06:08] [INFO ] Deduced a trap composed of 8 places in 569 ms of which 1 ms to minimize.
[2023-03-23 08:06:08] [INFO ] Deduced a trap composed of 21 places in 380 ms of which 1 ms to minimize.
[2023-03-23 08:06:09] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 1 ms to minimize.
[2023-03-23 08:06:10] [INFO ] Deduced a trap composed of 14 places in 395 ms of which 1 ms to minimize.
[2023-03-23 08:06:10] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 1 ms to minimize.
[2023-03-23 08:06:11] [INFO ] Deduced a trap composed of 19 places in 427 ms of which 0 ms to minimize.
[2023-03-23 08:06:11] [INFO ] Deduced a trap composed of 13 places in 605 ms of which 1 ms to minimize.
[2023-03-23 08:06:12] [INFO ] Deduced a trap composed of 17 places in 581 ms of which 1 ms to minimize.
[2023-03-23 08:06:12] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 1 ms to minimize.
[2023-03-23 08:06:13] [INFO ] Deduced a trap composed of 29 places in 337 ms of which 1 ms to minimize.
[2023-03-23 08:06:13] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
[2023-03-23 08:06:14] [INFO ] Deduced a trap composed of 22 places in 407 ms of which 1 ms to minimize.
[2023-03-23 08:06:14] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 0 ms to minimize.
[2023-03-23 08:06:15] [INFO ] Deduced a trap composed of 21 places in 407 ms of which 1 ms to minimize.
[2023-03-23 08:06:15] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 0 ms to minimize.
[2023-03-23 08:06:15] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 13576 ms
[2023-03-23 08:06:16] [INFO ] Deduced a trap composed of 14 places in 311 ms of which 0 ms to minimize.
[2023-03-23 08:06:16] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-23 08:06:17] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 1 ms to minimize.
[2023-03-23 08:06:17] [INFO ] Deduced a trap composed of 15 places in 519 ms of which 1 ms to minimize.
[2023-03-23 08:06:18] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 0 ms to minimize.
[2023-03-23 08:06:18] [INFO ] Deduced a trap composed of 18 places in 317 ms of which 0 ms to minimize.
[2023-03-23 08:06:19] [INFO ] Deduced a trap composed of 17 places in 299 ms of which 3 ms to minimize.
[2023-03-23 08:06:19] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 13 ms to minimize.
[2023-03-23 08:06:20] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 0 ms to minimize.
[2023-03-23 08:06:20] [INFO ] Deduced a trap composed of 20 places in 472 ms of which 1 ms to minimize.
[2023-03-23 08:06:21] [INFO ] Deduced a trap composed of 21 places in 721 ms of which 0 ms to minimize.
[2023-03-23 08:06:22] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 0 ms to minimize.
[2023-03-23 08:06:22] [INFO ] Deduced a trap composed of 22 places in 484 ms of which 2 ms to minimize.
[2023-03-23 08:06:23] [INFO ] Deduced a trap composed of 27 places in 377 ms of which 1 ms to minimize.
[2023-03-23 08:06:23] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 1 ms to minimize.
[2023-03-23 08:06:24] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 0 ms to minimize.
[2023-03-23 08:06:24] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 1 ms to minimize.
[2023-03-23 08:06:25] [INFO ] Deduced a trap composed of 4 places in 748 ms of which 1 ms to minimize.
[2023-03-23 08:06:25] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 0 ms to minimize.
[2023-03-23 08:06:26] [INFO ] Deduced a trap composed of 25 places in 330 ms of which 1 ms to minimize.
[2023-03-23 08:06:26] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 0 ms to minimize.
[2023-03-23 08:06:27] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2023-03-23 08:06:27] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 1 ms to minimize.
[2023-03-23 08:06:27] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 0 ms to minimize.
[2023-03-23 08:06:28] [INFO ] Deduced a trap composed of 15 places in 392 ms of which 1 ms to minimize.
[2023-03-23 08:06:28] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 0 ms to minimize.
[2023-03-23 08:06:29] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 18 ms to minimize.
[2023-03-23 08:06:29] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2023-03-23 08:06:30] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 1 ms to minimize.
[2023-03-23 08:06:30] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 1 ms to minimize.
[2023-03-23 08:06:30] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 0 ms to minimize.
[2023-03-23 08:06:31] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 0 ms to minimize.
[2023-03-23 08:06:31] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 0 ms to minimize.
[2023-03-23 08:06:31] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 1 ms to minimize.
[2023-03-23 08:06:32] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2023-03-23 08:06:32] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-23 08:06:33] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 0 ms to minimize.
[2023-03-23 08:06:33] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2023-03-23 08:06:33] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2023-03-23 08:06:33] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 18060 ms
[2023-03-23 08:06:35] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 1 ms to minimize.
[2023-03-23 08:06:35] [INFO ] Deduced a trap composed of 6 places in 411 ms of which 1 ms to minimize.
[2023-03-23 08:06:36] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2023-03-23 08:06:36] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 1 ms to minimize.
[2023-03-23 08:06:37] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 1 ms to minimize.
[2023-03-23 08:06:37] [INFO ] Deduced a trap composed of 9 places in 366 ms of which 1 ms to minimize.
[2023-03-23 08:06:38] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 1 ms to minimize.
[2023-03-23 08:06:38] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 1 ms to minimize.
[2023-03-23 08:06:39] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2023-03-23 08:06:39] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 1 ms to minimize.
[2023-03-23 08:06:40] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 1 ms to minimize.
[2023-03-23 08:06:40] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 0 ms to minimize.
[2023-03-23 08:06:41] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 1 ms to minimize.
[2023-03-23 08:06:41] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 1 ms to minimize.
[2023-03-23 08:06:42] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2023-03-23 08:06:42] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 1 ms to minimize.
[2023-03-23 08:06:42] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2023-03-23 08:06:43] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 1 ms to minimize.
[2023-03-23 08:06:43] [INFO ] Deduced a trap composed of 10 places in 352 ms of which 1 ms to minimize.
[2023-03-23 08:06:44] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 1 ms to minimize.
[2023-03-23 08:06:44] [INFO ] Deduced a trap composed of 21 places in 508 ms of which 39 ms to minimize.
[2023-03-23 08:06:45] [INFO ] Deduced a trap composed of 14 places in 390 ms of which 0 ms to minimize.
[2023-03-23 08:06:45] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 1 ms to minimize.
[2023-03-23 08:06:46] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 30 ms to minimize.
[2023-03-23 08:06:46] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 1 ms to minimize.
[2023-03-23 08:06:47] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 22 ms to minimize.
[2023-03-23 08:06:47] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 1 ms to minimize.
[2023-03-23 08:06:47] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 1 ms to minimize.
[2023-03-23 08:06:48] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-23 08:06:48] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2023-03-23 08:06:48] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 1 ms to minimize.
[2023-03-23 08:06:49] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 1 ms to minimize.
[2023-03-23 08:06:49] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 0 ms to minimize.
[2023-03-23 08:06:49] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-23 08:06:50] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 1 ms to minimize.
[2023-03-23 08:06:50] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 15884 ms
[2023-03-23 08:06:51] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 0 ms to minimize.
[2023-03-23 08:06:52] [INFO ] Deduced a trap composed of 7 places in 357 ms of which 1 ms to minimize.
[2023-03-23 08:06:53] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 1 ms to minimize.
[2023-03-23 08:06:54] [INFO ] Deduced a trap composed of 11 places in 639 ms of which 2 ms to minimize.
[2023-03-23 08:06:55] [INFO ] Deduced a trap composed of 7 places in 875 ms of which 1 ms to minimize.
[2023-03-23 08:06:55] [INFO ] Deduced a trap composed of 11 places in 389 ms of which 1 ms to minimize.
[2023-03-23 08:06:56] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 0 ms to minimize.
[2023-03-23 08:06:57] [INFO ] Deduced a trap composed of 8 places in 401 ms of which 1 ms to minimize.
[2023-03-23 08:06:57] [INFO ] Deduced a trap composed of 10 places in 485 ms of which 1 ms to minimize.
[2023-03-23 08:06:58] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 0 ms to minimize.
[2023-03-23 08:06:58] [INFO ] Deduced a trap composed of 9 places in 422 ms of which 0 ms to minimize.
[2023-03-23 08:06:59] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 1 ms to minimize.
[2023-03-23 08:06:59] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 0 ms to minimize.
[2023-03-23 08:07:00] [INFO ] Deduced a trap composed of 22 places in 332 ms of which 1 ms to minimize.
[2023-03-23 08:07:01] [INFO ] Deduced a trap composed of 15 places in 417 ms of which 1 ms to minimize.
[2023-03-23 08:07:01] [INFO ] Deduced a trap composed of 25 places in 492 ms of which 1 ms to minimize.
[2023-03-23 08:07:02] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 1 ms to minimize.
[2023-03-23 08:07:02] [INFO ] Deduced a trap composed of 10 places in 379 ms of which 0 ms to minimize.
[2023-03-23 08:07:03] [INFO ] Deduced a trap composed of 12 places in 507 ms of which 0 ms to minimize.
[2023-03-23 08:07:03] [INFO ] Deduced a trap composed of 20 places in 299 ms of which 1 ms to minimize.
[2023-03-23 08:07:04] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 1 ms to minimize.
[2023-03-23 08:07:04] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 0 ms to minimize.
[2023-03-23 08:07:05] [INFO ] Deduced a trap composed of 22 places in 514 ms of which 1 ms to minimize.
[2023-03-23 08:07:05] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 0 ms to minimize.
[2023-03-23 08:07:06] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 1 ms to minimize.
[2023-03-23 08:07:06] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 0 ms to minimize.
[2023-03-23 08:07:07] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 1 ms to minimize.
[2023-03-23 08:07:07] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 0 ms to minimize.
[2023-03-23 08:07:08] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 1 ms to minimize.
[2023-03-23 08:07:08] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2023-03-23 08:07:09] [INFO ] Deduced a trap composed of 22 places in 381 ms of which 3 ms to minimize.
[2023-03-23 08:07:09] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 1 ms to minimize.
[2023-03-23 08:07:10] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 0 ms to minimize.
[2023-03-23 08:07:10] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 1 ms to minimize.
[2023-03-23 08:07:11] [INFO ] Deduced a trap composed of 29 places in 481 ms of which 1 ms to minimize.
[2023-03-23 08:07:11] [INFO ] Deduced a trap composed of 40 places in 428 ms of which 1 ms to minimize.
[2023-03-23 08:07:12] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 1 ms to minimize.
[2023-03-23 08:07:12] [INFO ] Deduced a trap composed of 22 places in 327 ms of which 1 ms to minimize.
[2023-03-23 08:07:13] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 0 ms to minimize.
[2023-03-23 08:07:13] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 1 ms to minimize.
[2023-03-23 08:07:13] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 0 ms to minimize.
[2023-03-23 08:07:14] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2023-03-23 08:07:14] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 14 ms to minimize.
[2023-03-23 08:07:14] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 23624 ms
[2023-03-23 08:07:15] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 0 ms to minimize.
[2023-03-23 08:07:15] [INFO ] Deduced a trap composed of 10 places in 393 ms of which 1 ms to minimize.
[2023-03-23 08:07:16] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 0 ms to minimize.
[2023-03-23 08:07:16] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 1 ms to minimize.
[2023-03-23 08:07:17] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 0 ms to minimize.
[2023-03-23 08:07:18] [INFO ] Deduced a trap composed of 10 places in 662 ms of which 0 ms to minimize.
[2023-03-23 08:07:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3036 ms
[2023-03-23 08:07:19] [INFO ] Deduced a trap composed of 14 places in 704 ms of which 1 ms to minimize.
[2023-03-23 08:07:20] [INFO ] Deduced a trap composed of 8 places in 784 ms of which 1 ms to minimize.
[2023-03-23 08:07:21] [INFO ] Deduced a trap composed of 13 places in 1536 ms of which 2 ms to minimize.
[2023-03-23 08:07:22] [INFO ] Deduced a trap composed of 7 places in 628 ms of which 1 ms to minimize.
[2023-03-23 08:07:23] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 0 ms to minimize.
[2023-03-23 08:07:23] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 0 ms to minimize.
[2023-03-23 08:07:23] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 1 ms to minimize.
[2023-03-23 08:07:24] [INFO ] Deduced a trap composed of 4 places in 597 ms of which 1 ms to minimize.
[2023-03-23 08:07:25] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 1 ms to minimize.
[2023-03-23 08:07:25] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2023-03-23 08:07:26] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 5 ms to minimize.
[2023-03-23 08:07:26] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-23 08:07:26] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 1 ms to minimize.
[2023-03-23 08:07:27] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-23 08:07:27] [INFO ] Deduced a trap composed of 17 places in 361 ms of which 0 ms to minimize.
[2023-03-23 08:07:28] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 0 ms to minimize.
[2023-03-23 08:07:28] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 15 ms to minimize.
[2023-03-23 08:07:29] [INFO ] Deduced a trap composed of 16 places in 325 ms of which 40 ms to minimize.
[2023-03-23 08:07:29] [INFO ] Deduced a trap composed of 17 places in 748 ms of which 1 ms to minimize.
[2023-03-23 08:07:30] [INFO ] Deduced a trap composed of 14 places in 590 ms of which 39 ms to minimize.
[2023-03-23 08:07:31] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 1 ms to minimize.
[2023-03-23 08:07:31] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 1 ms to minimize.
[2023-03-23 08:07:31] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 1 ms to minimize.
[2023-03-23 08:07:32] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2023-03-23 08:07:32] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 1 ms to minimize.
[2023-03-23 08:07:33] [INFO ] Deduced a trap composed of 19 places in 420 ms of which 0 ms to minimize.
[2023-03-23 08:07:33] [INFO ] Deduced a trap composed of 23 places in 409 ms of which 1 ms to minimize.
[2023-03-23 08:07:34] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2023-03-23 08:07:34] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 1 ms to minimize.
[2023-03-23 08:07:35] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 0 ms to minimize.
[2023-03-23 08:07:35] [INFO ] Deduced a trap composed of 28 places in 436 ms of which 1 ms to minimize.
[2023-03-23 08:07:36] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 0 ms to minimize.
[2023-03-23 08:07:36] [INFO ] Deduced a trap composed of 32 places in 344 ms of which 1 ms to minimize.
[2023-03-23 08:07:36] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 1 ms to minimize.
[2023-03-23 08:07:37] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 1 ms to minimize.
[2023-03-23 08:07:37] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 0 ms to minimize.
[2023-03-23 08:07:37] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 19425 ms
[2023-03-23 08:07:38] [INFO ] Deduced a trap composed of 12 places in 753 ms of which 1 ms to minimize.
[2023-03-23 08:07:39] [INFO ] Deduced a trap composed of 5 places in 746 ms of which 1 ms to minimize.
[2023-03-23 08:07:40] [INFO ] Deduced a trap composed of 24 places in 882 ms of which 2 ms to minimize.
[2023-03-23 08:07:42] [INFO ] Deduced a trap composed of 12 places in 1029 ms of which 2 ms to minimize.
[2023-03-23 08:07:43] [INFO ] Deduced a trap composed of 18 places in 933 ms of which 1 ms to minimize.
[2023-03-23 08:07:43] [INFO ] Deduced a trap composed of 28 places in 718 ms of which 1 ms to minimize.
[2023-03-23 08:07:44] [INFO ] Deduced a trap composed of 30 places in 694 ms of which 1 ms to minimize.
[2023-03-23 08:07:45] [INFO ] Deduced a trap composed of 22 places in 736 ms of which 1 ms to minimize.
[2023-03-23 08:07:46] [INFO ] Deduced a trap composed of 15 places in 721 ms of which 1 ms to minimize.
[2023-03-23 08:07:47] [INFO ] Deduced a trap composed of 19 places in 1037 ms of which 14 ms to minimize.
[2023-03-23 08:07:48] [INFO ] Deduced a trap composed of 26 places in 769 ms of which 1 ms to minimize.
[2023-03-23 08:07:49] [INFO ] Deduced a trap composed of 21 places in 560 ms of which 1 ms to minimize.
[2023-03-23 08:07:50] [INFO ] Deduced a trap composed of 16 places in 1353 ms of which 18 ms to minimize.
[2023-03-23 08:07:51] [INFO ] Deduced a trap composed of 8 places in 1100 ms of which 1 ms to minimize.
[2023-03-23 08:07:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 13924 ms
[2023-03-23 08:07:52] [INFO ] After 115152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3590 ms.
[2023-03-23 08:07:55] [INFO ] After 120487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-23 08:07:55] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-23 08:07:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2670 places, 2571 transitions and 12526 arcs took 14 ms.
[2023-03-23 08:07:56] [INFO ] Flatten gal took : 508 ms
Total runtime 262336 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 100B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 2670 places, 2571 transitions, 12526 arcs.
Final Score: 495952.825
Took : 28 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-100B-ReachabilityCardinality-00 (reachable & potential(( ( ( ( ( (tk(P2099)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2099)) ) ) & ( ( (tk(P129)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P129)) ) ) ) & ( ( ( (tk(P290)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P290)) ) ) & ( ( ( (tk(P1802)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1802)) ) ) & ( ( ( (tk(P1154)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1154)) ) ) | ( ( (tk(P1659)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1659)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P2164)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2164)) ) ) | ( ( (tk(P445)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P445)) ) ) ) & ( ( ( (tk(P2606)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2606)) ) ) | ( ( (tk(P1433)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1433)) ) ) ) ) & ( ( ( ( (tk(P2240)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2240)) ) ) | ( ( (tk(P11)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P11)) ) ) ) & ( ( ( ( ( (tk(P874)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P874)) ) ) & ( ( (tk(P1528)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1528)) ) ) ) | ( ( ( (tk(P834)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P834)) ) ) & ( ( (tk(P185)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P185)) ) ) ) ) & ( ( ( ( (tk(P1334)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1334)) ) ) & ( ( ( (tk(P2208)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2208)) ) ) | ( ( (tk(P2221)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2221)) ) ) ) ) | ( ( ( (tk(P2622)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2622)) ) ) & ( ( ( (tk(P101)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P101)) ) ) & ( ( ( (tk(P727)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P727)) ) ) | ( ( ( (tk(P1311)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1311)) ) ) & ( ( (tk(P1817)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1817)) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-100B-ReachabilityCardinality-03 (reachable &!potential( ( ( ( ( ( (tk(P2540)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2540)) ) ) | ( ( ( (tk(P2534)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2534)) ) ) | ( ( (tk(P1123)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1123)) ) ) ) ) | ( ( ( (tk(P768)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P768)) ) ) | ( ( ( (tk(P102)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P102)) ) ) | ( ( (tk(P2091)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2091)) ) ) ) ) ) | ( ( ( ( (tk(P2211)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2211)) ) ) | ( ( ( (tk(P65)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P65)) ) ) | ( ( (tk(P1467)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1467)) ) ) ) ) | ( ( ( ( (tk(P599)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P599)) ) ) & ( ( ( (tk(P1683)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1683)) ) ) & ( ( ( ( (tk(P2601)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2601)) ) ) | ( ( (tk(P1145)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1145)) ) ) ) | ( ( ( (tk(P2623)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2623)) ) ) | ( ( (tk(P1924)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1924)) ) ) ) ) ) ) | ( ( ( ( (tk(P2426)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2426)) ) ) & ( ( (tk(P2349)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2349)) ) ) ) | ( ( ( (tk(P1185)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1185)) ) ) & ( ( (tk(P607)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P607)) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-100B-ReachabilityCardinality-04 (reachable &!potential( ( ( ( ( (tk(P201)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P201)) ) ) & ( ( ( (tk(P512)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P512)) ) ) | ( ( (tk(P935)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P935)) ) ) ) ) | ( ( ( ( ( (tk(P2210)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2210)) ) ) & ( ( ( ( (tk(P2436)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2436)) ) ) | ( ( (tk(P250)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P250)) ) ) ) & ( ( ( ( (tk(P549)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P549)) ) ) & ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) ) | ( ( ( ( (tk(P655)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P655)) ) ) & ( ( (tk(P2618)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2618)) ) ) ) & ( ( ( ( (tk(P1708)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1708)) ) ) | ( ( (tk(P1716)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1716)) ) ) ) & ( ( ( (tk(P56)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P56)) ) ) | ( ( (tk(P1231)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1231)) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P734)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P734)) ) ) | ( ( ( ( (tk(P2546)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2546)) ) ) | ( ( (tk(P2297)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2297)) ) ) ) & ( ( ( (tk(P1152)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1152)) ) ) | ( ( (tk(P495)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P495)) ) ) ) ) ) & ( ( ( ( (tk(P1581)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1581)) ) ) | ( ( ( (tk(P340)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P340)) ) ) & ( ( (tk(P2469)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2469)) ) ) ) ) & ( ( ( (tk(P2589)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2589)) ) ) | ( ( (tk(P1588)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1588)) ) ) ) ) ) ) | ( ( ( ( ( (tk(P2445)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2445)) ) ) | ( ( (tk(P1276)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1276)) ) ) ) | ( ( ( (tk(P296)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P296)) ) ) | ( ( ( ( ( (tk(P539)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P539)) ) ) & ( ( (tk(P1951)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1951)) ) ) ) & ( ( ( (tk(P15)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P15)) ) ) & ( ( ( (tk(P323)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P323)) ) ) | ( ( (tk(P1777)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1777)) ) ) ) ) ) | ( ( ( ( ( (tk(P378)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P378)) ) ) | ( ( (tk(P814)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P814)) ) ) ) & ( ( ( (tk(P547)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P547)) ) ) | ( ( (tk(P43)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P43)) ) ) ) ) & ( ( ( ( (tk(P2559)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2559)) ) ) | ( ( (tk(P238)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P238)) ) ) ) & ( ( ( (tk(P163)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P163)) ) ) | ( ( (tk(P1511)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1511)) ) ) ) ) ) ) ) ) & ( ( ( (tk(P2555)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2555)) ) ) | ( ( ( ( (tk(P2353)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2353)) ) ) & ( ( (tk(P2484)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2484)) ) ) ) & ( ( ( (tk(P1841)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1841)) ) ) & ( ( ( (tk(P1084)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1084)) ) ) & ( ( ( (tk(P2152)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2152)) ) ) | ( ( ( ( (tk(P2204)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2204)) ) ) & ( ( (tk(P513)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P513)) ) ) ) | ( ( ( (tk(P940)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P940)) ) ) & ( ( (tk(P236)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P236)) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-100B-ReachabilityCardinality-07 (reachable &!potential( ( ( ( (tk(P1357)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1357)) ) ) | ( ( ( (tk(P1811)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1811)) ) ) | ( ( ( ( ( ( (tk(P588)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P588)) ) ) | ( ( (tk(P1514)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1514)) ) ) ) | ( ( ( (tk(P2560)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2560)) ) ) | ( ( (tk(P278)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P278)) ) ) ) ) | ( ( ( ( (tk(P673)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P673)) ) ) | ( ( (tk(P8)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P8)) ) ) ) | ( ( ( (tk(P793)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P793)) ) ) | ( ( ( (tk(P1568)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1568)) ) ) & ( ( ( ( (tk(P1601)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1601)) ) ) | ( ( (tk(P90)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P90)) ) ) ) & ( ( ( ( (tk(P2111)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2111)) ) ) | ( ( (tk(P175)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P175)) ) ) ) | ( ( ( (tk(P603)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P603)) ) ) | ( ( (tk(P2654)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2654)) ) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P2666)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2666)) ) ) | ( ( ( (tk(P482)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P482)) ) ) & ( ( (tk(P1498)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1498)) ) ) ) ) | ( ( ( ( (tk(P288)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P288)) ) ) & ( ( ( ( (tk(P412)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P412)) ) ) | ( ( (tk(P972)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P972)) ) ) ) & ( ( ( ( (tk(P519)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P519)) ) ) | ( ( (tk(P1905)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1905)) ) ) ) | ( ( ( (tk(P13)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P13)) ) ) | ( ( (tk(P339)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P339)) ) ) ) ) ) ) | ( ( ( (tk(P1840)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1840)) ) ) & ( ( ( (tk(P1567)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1567)) ) ) & ( ( (tk(P817)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P817)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-100B-ReachabilityCardinality-12 (reachable &!potential( ( ( ( (tk(P848)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P848)) ) ) | ( ( (tk(P2053)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2053)) ) ) )))
PROPERTY: ShieldIIPs-PT-100B-ReachabilityCardinality-14 (reachable & potential(( ( ( ( (tk(P1464)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1464)) ) ) & ( ( ( (tk(P2531)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2531)) ) ) & ( ( (tk(P1494)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1494)) ) ) ) ) & ( ( ( ( ( (tk(P1362)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1362)) ) ) | ( ( (tk(P711)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P711)) ) ) ) | ( ( ( (tk(P1882)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1882)) ) ) | ( ( ( (tk(P1813)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1813)) ) ) | ( ( (tk(P6)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P6)) ) ) ) ) ) & ( ( ( ( (tk(P2271)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2271)) ) ) | ( ( ( ( (tk(P2638)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2638)) ) ) | ( ( ( (tk(P549)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P549)) ) ) | ( ( ( (tk(P1395)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1395)) ) ) & ( ( (tk(P2076)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2076)) ) ) ) ) ) & ( ( ( (tk(P318)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P318)) ) ) | ( ( ( (tk(P1523)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1523)) ) ) | ( ( (tk(P146)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P146)) ) ) ) ) ) ) & ( ( ( (tk(P1127)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1127)) ) ) | ( ( (tk(P498)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P498)) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-100B-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (tk(P2244)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2244)) ) ) | ( ( (tk(P1376)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1376)) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12199812 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095828 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldIIPs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-oct2-167903718400174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;