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-167903718900510.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 ShieldPPPs-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-167903718900510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 888K 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 ShieldPPPs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679571701109

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=ShieldPPPs-PT-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 11:41:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 11:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:41:43] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2023-03-23 11:41:44] [INFO ] Transformed 3403 places.
[2023-03-23 11:41:44] [INFO ] Transformed 3153 transitions.
[2023-03-23 11:41:44] [INFO ] Found NUPN structural information;
[2023-03-23 11:41:44] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 14) seen :6
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-23 11:41:45] [INFO ] Computed 551 place invariants in 42 ms
[2023-03-23 11:41:46] [INFO ] After 1383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 11:41:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 440 ms returned sat
[2023-03-23 11:41:58] [INFO ] After 9295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 11:42:02] [INFO ] Deduced a trap composed of 27 places in 1604 ms of which 18 ms to minimize.
[2023-03-23 11:42:03] [INFO ] Deduced a trap composed of 14 places in 1586 ms of which 4 ms to minimize.
[2023-03-23 11:42:05] [INFO ] Deduced a trap composed of 23 places in 1255 ms of which 17 ms to minimize.
[2023-03-23 11:42:06] [INFO ] Deduced a trap composed of 23 places in 1207 ms of which 3 ms to minimize.
[2023-03-23 11:42:08] [INFO ] Deduced a trap composed of 26 places in 1252 ms of which 2 ms to minimize.
[2023-03-23 11:42:09] [INFO ] Deduced a trap composed of 31 places in 1411 ms of which 3 ms to minimize.
[2023-03-23 11:42:11] [INFO ] Deduced a trap composed of 31 places in 1241 ms of which 17 ms to minimize.
[2023-03-23 11:42:11] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 11274 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 11:42:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:42:11] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1108 ms.
Support contains 113 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 3403 transition count 2843
Reduce places removed 310 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 327 rules applied. Total rules applied 637 place count 3093 transition count 2826
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 654 place count 3076 transition count 2826
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 654 place count 3076 transition count 2578
Deduced a syphon composed of 248 places in 13 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 1150 place count 2828 transition count 2578
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 1465 place count 2513 transition count 2263
Iterating global reduction 3 with 315 rules applied. Total rules applied 1780 place count 2513 transition count 2263
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 1780 place count 2513 transition count 2139
Deduced a syphon composed of 124 places in 40 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 2028 place count 2389 transition count 2139
Performed 702 Post agglomeration using F-continuation condition.Transition count delta: 702
Deduced a syphon composed of 702 places in 3 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 3 with 1404 rules applied. Total rules applied 3432 place count 1687 transition count 1437
Partial Free-agglomeration rule applied 406 times.
Drop transitions removed 406 transitions
Iterating global reduction 3 with 406 rules applied. Total rules applied 3838 place count 1687 transition count 1437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3839 place count 1686 transition count 1436
Applied a total of 3839 rules in 1473 ms. Remains 1686 /3403 variables (removed 1717) and now considering 1436/3153 (removed 1717) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1474 ms. Remains : 1686/3403 places, 1436/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :1
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1436 rows 1686 cols
[2023-03-23 11:42:15] [INFO ] Computed 551 place invariants in 103 ms
[2023-03-23 11:42:15] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 11:42:16] [INFO ] [Nat]Absence check using 526 positive place invariants in 188 ms returned sat
[2023-03-23 11:42:16] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-23 11:42:19] [INFO ] After 2867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 11:42:19] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 1 ms to minimize.
[2023-03-23 11:42:20] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2023-03-23 11:42:20] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 1 ms to minimize.
[2023-03-23 11:42:21] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 0 ms to minimize.
[2023-03-23 11:42:21] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 0 ms to minimize.
[2023-03-23 11:42:21] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 0 ms to minimize.
[2023-03-23 11:42:22] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 1 ms to minimize.
[2023-03-23 11:42:22] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 0 ms to minimize.
[2023-03-23 11:42:22] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-23 11:42:23] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
[2023-03-23 11:42:23] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2023-03-23 11:42:23] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 0 ms to minimize.
[2023-03-23 11:42:24] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 0 ms to minimize.
[2023-03-23 11:42:24] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 1 ms to minimize.
[2023-03-23 11:42:25] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2023-03-23 11:42:25] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-23 11:42:25] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-23 11:42:26] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2023-03-23 11:42:26] [INFO ] Deduced a trap composed of 7 places in 359 ms of which 2 ms to minimize.
[2023-03-23 11:42:26] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2023-03-23 11:42:27] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 0 ms to minimize.
[2023-03-23 11:42:27] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 2 ms to minimize.
[2023-03-23 11:42:27] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 2 ms to minimize.
[2023-03-23 11:42:28] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2023-03-23 11:42:28] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 1 ms to minimize.
[2023-03-23 11:42:29] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 0 ms to minimize.
[2023-03-23 11:42:29] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2023-03-23 11:42:29] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-23 11:42:29] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2023-03-23 11:42:30] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 1 ms to minimize.
[2023-03-23 11:42:30] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-23 11:42:31] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2023-03-23 11:42:31] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2023-03-23 11:42:31] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 0 ms to minimize.
[2023-03-23 11:42:32] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-23 11:42:32] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 0 ms to minimize.
[2023-03-23 11:42:32] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 0 ms to minimize.
[2023-03-23 11:42:32] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-23 11:42:33] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2023-03-23 11:42:33] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2023-03-23 11:42:33] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
[2023-03-23 11:42:34] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 0 ms to minimize.
[2023-03-23 11:42:34] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 0 ms to minimize.
[2023-03-23 11:42:34] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-23 11:42:34] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 0 ms to minimize.
[2023-03-23 11:42:34] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 15456 ms
[2023-03-23 11:42:35] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2023-03-23 11:42:35] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 0 ms to minimize.
[2023-03-23 11:42:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2023-03-23 11:42:36] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 6 ms to minimize.
[2023-03-23 11:42:36] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 14 ms to minimize.
[2023-03-23 11:42:36] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-23 11:42:37] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2023-03-23 11:42:37] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2023-03-23 11:42:37] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2023-03-23 11:42:38] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 1 ms to minimize.
[2023-03-23 11:42:38] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 1 ms to minimize.
[2023-03-23 11:42:39] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 1 ms to minimize.
[2023-03-23 11:42:39] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 1 ms to minimize.
[2023-03-23 11:42:39] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 4 ms to minimize.
[2023-03-23 11:42:40] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 1 ms to minimize.
[2023-03-23 11:42:40] [INFO ] Deduced a trap composed of 6 places in 309 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 11:42:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:42:40] [INFO ] After 25127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 367 ms.
Support contains 86 out of 1686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1686/1686 places, 1436/1436 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1686 transition count 1430
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1680 transition count 1430
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 1680 transition count 1423
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 1673 transition count 1423
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 1672 transition count 1422
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 1672 transition count 1422
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 70 place count 1651 transition count 1401
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 1651 transition count 1401
Applied a total of 76 rules in 312 ms. Remains 1651 /1686 variables (removed 35) and now considering 1401/1436 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 1651/1686 places, 1401/1436 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 5) seen :1
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1401 rows 1651 cols
[2023-03-23 11:42:42] [INFO ] Computed 551 place invariants in 57 ms
[2023-03-23 11:42:42] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 11:42:42] [INFO ] [Nat]Absence check using 525 positive place invariants in 142 ms returned sat
[2023-03-23 11:42:42] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-23 11:42:44] [INFO ] After 1339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 11:42:44] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 21 ms to minimize.
[2023-03-23 11:42:45] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 2 ms to minimize.
[2023-03-23 11:42:45] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 0 ms to minimize.
[2023-03-23 11:42:45] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 1 ms to minimize.
[2023-03-23 11:42:46] [INFO ] Deduced a trap composed of 26 places in 330 ms of which 0 ms to minimize.
[2023-03-23 11:42:46] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 0 ms to minimize.
[2023-03-23 11:42:46] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 1 ms to minimize.
[2023-03-23 11:42:47] [INFO ] Deduced a trap composed of 21 places in 344 ms of which 1 ms to minimize.
[2023-03-23 11:42:47] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2023-03-23 11:42:47] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-23 11:42:48] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 1 ms to minimize.
[2023-03-23 11:42:48] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 0 ms to minimize.
[2023-03-23 11:42:48] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 0 ms to minimize.
[2023-03-23 11:42:49] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 0 ms to minimize.
[2023-03-23 11:42:49] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 0 ms to minimize.
[2023-03-23 11:42:49] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 0 ms to minimize.
[2023-03-23 11:42:50] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2023-03-23 11:42:50] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2023-03-23 11:42:50] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-23 11:42:50] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2023-03-23 11:42:51] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-23 11:42:51] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 0 ms to minimize.
[2023-03-23 11:42:51] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 3 ms to minimize.
[2023-03-23 11:42:51] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 0 ms to minimize.
[2023-03-23 11:42:52] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2023-03-23 11:42:52] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-23 11:42:52] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-23 11:42:53] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-23 11:42:53] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2023-03-23 11:42:53] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2023-03-23 11:42:53] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 1 ms to minimize.
[2023-03-23 11:42:54] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-23 11:42:54] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2023-03-23 11:42:54] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 1 ms to minimize.
[2023-03-23 11:42:54] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2023-03-23 11:42:55] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 0 ms to minimize.
[2023-03-23 11:42:55] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 2 ms to minimize.
[2023-03-23 11:42:55] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 10932 ms
[2023-03-23 11:42:55] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 2 ms to minimize.
[2023-03-23 11:42:56] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 25 ms to minimize.
[2023-03-23 11:42:56] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2023-03-23 11:42:56] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-23 11:42:56] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-23 11:42:57] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 1 ms to minimize.
[2023-03-23 11:42:57] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2023-03-23 11:42:58] [INFO ] Deduced a trap composed of 11 places in 314 ms of which 0 ms to minimize.
[2023-03-23 11:42:58] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 4 ms to minimize.
[2023-03-23 11:42:58] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 0 ms to minimize.
[2023-03-23 11:42:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 3505 ms
[2023-03-23 11:42:59] [INFO ] Deduced a trap composed of 6 places in 465 ms of which 0 ms to minimize.
[2023-03-23 11:43:00] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2023-03-23 11:43:00] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-23 11:43:00] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 0 ms to minimize.
[2023-03-23 11:43:01] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-23 11:43:01] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 1 ms to minimize.
[2023-03-23 11:43:01] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2023-03-23 11:43:02] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 0 ms to minimize.
[2023-03-23 11:43:02] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 2 ms to minimize.
[2023-03-23 11:43:02] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2023-03-23 11:43:03] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-23 11:43:03] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 1 ms to minimize.
[2023-03-23 11:43:03] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 1 ms to minimize.
[2023-03-23 11:43:03] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-23 11:43:04] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 1 ms to minimize.
[2023-03-23 11:43:04] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 0 ms to minimize.
[2023-03-23 11:43:05] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 1 ms to minimize.
[2023-03-23 11:43:05] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2023-03-23 11:43:05] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 1 ms to minimize.
[2023-03-23 11:43:06] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 1 ms to minimize.
[2023-03-23 11:43:06] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 0 ms to minimize.
[2023-03-23 11:43:06] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 1 ms to minimize.
[2023-03-23 11:43:07] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 1 ms to minimize.
[2023-03-23 11:43:07] [INFO ] Deduced a trap composed of 16 places in 355 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 11:43:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:43:07] [INFO ] After 25241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 161 ms.
Support contains 53 out of 1651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1651/1651 places, 1401/1401 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1651 transition count 1397
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1647 transition count 1397
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 1647 transition count 1392
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 18 place count 1642 transition count 1392
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 78 place count 1612 transition count 1362
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 1612 transition count 1362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1611 transition count 1361
Applied a total of 82 rules in 276 ms. Remains 1611 /1651 variables (removed 40) and now considering 1361/1401 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 1611/1651 places, 1361/1401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 87694 steps, run timeout after 3013 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87694 steps, saw 80494 distinct states, run finished after 3016 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1361 rows 1611 cols
[2023-03-23 11:43:11] [INFO ] Computed 551 place invariants in 22 ms
[2023-03-23 11:43:11] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:43:12] [INFO ] [Nat]Absence check using 523 positive place invariants in 86 ms returned sat
[2023-03-23 11:43:12] [INFO ] [Nat]Absence check using 523 positive and 28 generalized place invariants in 5 ms returned sat
[2023-03-23 11:43:13] [INFO ] After 1405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:43:14] [INFO ] Deduced a trap composed of 7 places in 316 ms of which 1 ms to minimize.
[2023-03-23 11:43:14] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 1 ms to minimize.
[2023-03-23 11:43:14] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2023-03-23 11:43:14] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 4 ms to minimize.
[2023-03-23 11:43:15] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2023-03-23 11:43:15] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-23 11:43:15] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2023-03-23 11:43:16] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-23 11:43:16] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2023-03-23 11:43:16] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2023-03-23 11:43:17] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2023-03-23 11:43:17] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 0 ms to minimize.
[2023-03-23 11:43:17] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 0 ms to minimize.
[2023-03-23 11:43:17] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 0 ms to minimize.
[2023-03-23 11:43:18] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 0 ms to minimize.
[2023-03-23 11:43:18] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2023-03-23 11:43:18] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 1 ms to minimize.
[2023-03-23 11:43:19] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-23 11:43:19] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2023-03-23 11:43:19] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2023-03-23 11:43:20] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 0 ms to minimize.
[2023-03-23 11:43:20] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2023-03-23 11:43:20] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-23 11:43:20] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-23 11:43:20] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2023-03-23 11:43:21] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2023-03-23 11:43:21] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 1 ms to minimize.
[2023-03-23 11:43:22] [INFO ] Deduced a trap composed of 6 places in 1417 ms of which 1 ms to minimize.
[2023-03-23 11:43:23] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 0 ms to minimize.
[2023-03-23 11:43:23] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 0 ms to minimize.
[2023-03-23 11:43:23] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-23 11:43:24] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 0 ms to minimize.
[2023-03-23 11:43:24] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 0 ms to minimize.
[2023-03-23 11:43:24] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2023-03-23 11:43:24] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2023-03-23 11:43:25] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2023-03-23 11:43:25] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 11344 ms
[2023-03-23 11:43:25] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-23 11:43:26] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2023-03-23 11:43:26] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2023-03-23 11:43:26] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-23 11:43:27] [INFO ] Deduced a trap composed of 7 places in 409 ms of which 1 ms to minimize.
[2023-03-23 11:43:27] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-03-23 11:43:27] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2023-03-23 11:43:27] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-23 11:43:28] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-23 11:43:28] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2023-03-23 11:43:28] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-23 11:43:28] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2023-03-23 11:43:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3215 ms
[2023-03-23 11:43:29] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-23 11:43:29] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-23 11:43:29] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2023-03-23 11:43:29] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-23 11:43:30] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2023-03-23 11:43:30] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-23 11:43:30] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-23 11:43:30] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-23 11:43:31] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2023-03-23 11:43:31] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-23 11:43:31] [INFO ] Deduced a trap composed of 8 places in 417 ms of which 1 ms to minimize.
[2023-03-23 11:43:32] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-23 11:43:32] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-23 11:43:32] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-23 11:43:32] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 0 ms to minimize.
[2023-03-23 11:43:33] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 0 ms to minimize.
[2023-03-23 11:43:33] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-23 11:43:33] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 1 ms to minimize.
[2023-03-23 11:43:34] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-23 11:43:34] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 2 ms to minimize.
[2023-03-23 11:43:34] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-23 11:43:34] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-23 11:43:34] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2023-03-23 11:43:35] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-23 11:43:35] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-23 11:43:35] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-23 11:43:35] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-23 11:43:35] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2023-03-23 11:43:36] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2023-03-23 11:43:36] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2023-03-23 11:43:36] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2023-03-23 11:43:36] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-23 11:43:36] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 7823 ms
[2023-03-23 11:43:36] [INFO ] After 24519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-23 11:43:36] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 205 ms.
Support contains 53 out of 1611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1611/1611 places, 1361/1361 transitions.
Applied a total of 0 rules in 52 ms. Remains 1611 /1611 variables (removed 0) and now considering 1361/1361 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1611/1611 places, 1361/1361 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1611/1611 places, 1361/1361 transitions.
Applied a total of 0 rules in 52 ms. Remains 1611 /1611 variables (removed 0) and now considering 1361/1361 (removed 0) transitions.
[2023-03-23 11:43:37] [INFO ] Invariant cache hit.
[2023-03-23 11:43:38] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2023-03-23 11:43:38] [INFO ] Invariant cache hit.
[2023-03-23 11:43:40] [INFO ] Implicit Places using invariants and state equation in 2582 ms returned []
Implicit Place search using SMT with State Equation took 3602 ms to find 0 implicit places.
[2023-03-23 11:43:40] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-23 11:43:40] [INFO ] Invariant cache hit.
[2023-03-23 11:43:41] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4812 ms. Remains : 1611/1611 places, 1361/1361 transitions.
Applied a total of 0 rules in 52 ms. Remains 1611 /1611 variables (removed 0) and now considering 1361/1361 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-23 11:43:41] [INFO ] Invariant cache hit.
[2023-03-23 11:43:42] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:43:42] [INFO ] [Nat]Absence check using 523 positive place invariants in 144 ms returned sat
[2023-03-23 11:43:42] [INFO ] [Nat]Absence check using 523 positive and 28 generalized place invariants in 150 ms returned sat
[2023-03-23 11:43:44] [INFO ] After 1853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:43:45] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 0 ms to minimize.
[2023-03-23 11:43:45] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 1 ms to minimize.
[2023-03-23 11:43:45] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 1 ms to minimize.
[2023-03-23 11:43:46] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 0 ms to minimize.
[2023-03-23 11:43:46] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2023-03-23 11:43:46] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 1 ms to minimize.
[2023-03-23 11:43:47] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2023-03-23 11:43:47] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 0 ms to minimize.
[2023-03-23 11:43:47] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 0 ms to minimize.
[2023-03-23 11:43:48] [INFO ] Deduced a trap composed of 10 places in 372 ms of which 1 ms to minimize.
[2023-03-23 11:43:48] [INFO ] Deduced a trap composed of 8 places in 379 ms of which 2 ms to minimize.
[2023-03-23 11:43:49] [INFO ] Deduced a trap composed of 8 places in 392 ms of which 1 ms to minimize.
[2023-03-23 11:43:49] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 1 ms to minimize.
[2023-03-23 11:43:50] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 2 ms to minimize.
[2023-03-23 11:43:50] [INFO ] Deduced a trap composed of 7 places in 374 ms of which 1 ms to minimize.
[2023-03-23 11:43:50] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 0 ms to minimize.
[2023-03-23 11:43:51] [INFO ] Deduced a trap composed of 8 places in 412 ms of which 1 ms to minimize.
[2023-03-23 11:43:51] [INFO ] Deduced a trap composed of 7 places in 474 ms of which 0 ms to minimize.
[2023-03-23 11:43:52] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-23 11:43:52] [INFO ] Deduced a trap composed of 12 places in 342 ms of which 1 ms to minimize.
[2023-03-23 11:43:53] [INFO ] Deduced a trap composed of 8 places in 522 ms of which 1 ms to minimize.
[2023-03-23 11:43:53] [INFO ] Deduced a trap composed of 6 places in 378 ms of which 1 ms to minimize.
[2023-03-23 11:43:53] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 1 ms to minimize.
[2023-03-23 11:43:54] [INFO ] Deduced a trap composed of 8 places in 357 ms of which 1 ms to minimize.
[2023-03-23 11:43:54] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 1 ms to minimize.
[2023-03-23 11:43:55] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 1 ms to minimize.
[2023-03-23 11:43:55] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2023-03-23 11:43:55] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
[2023-03-23 11:43:55] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 0 ms to minimize.
[2023-03-23 11:43:56] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 7 ms to minimize.
[2023-03-23 11:43:56] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 11 ms to minimize.
[2023-03-23 11:43:57] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-23 11:43:57] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 1 ms to minimize.
[2023-03-23 11:43:57] [INFO ] Deduced a trap composed of 8 places in 366 ms of which 1 ms to minimize.
[2023-03-23 11:43:58] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-23 11:43:58] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2023-03-23 11:43:58] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 3 ms to minimize.
[2023-03-23 11:43:59] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 11 ms to minimize.
[2023-03-23 11:43:59] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 3 ms to minimize.
[2023-03-23 11:44:00] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 1 ms to minimize.
[2023-03-23 11:44:00] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 1 ms to minimize.
[2023-03-23 11:44:00] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
[2023-03-23 11:44:01] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 0 ms to minimize.
[2023-03-23 11:44:01] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 1 ms to minimize.
[2023-03-23 11:44:01] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 0 ms to minimize.
[2023-03-23 11:44:02] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 1 ms to minimize.
[2023-03-23 11:44:02] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 1 ms to minimize.
[2023-03-23 11:44:02] [INFO ] Deduced a trap composed of 10 places in 367 ms of which 1 ms to minimize.
[2023-03-23 11:44:03] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2023-03-23 11:44:03] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2023-03-23 11:44:04] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2023-03-23 11:44:04] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 1 ms to minimize.
[2023-03-23 11:44:04] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 1 ms to minimize.
[2023-03-23 11:44:04] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 19952 ms
[2023-03-23 11:44:05] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-23 11:44:05] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-23 11:44:07] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-23 11:44:07] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-23 11:44:07] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2023-03-23 11:44:07] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-23 11:44:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2368 ms
[2023-03-23 11:44:08] [INFO ] Deduced a trap composed of 8 places in 327 ms of which 1 ms to minimize.
[2023-03-23 11:44:08] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 0 ms to minimize.
[2023-03-23 11:44:08] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-23 11:44:09] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-23 11:44:09] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2023-03-23 11:44:09] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2023-03-23 11:44:10] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-23 11:44:10] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-23 11:44:10] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2023-03-23 11:44:10] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 0 ms to minimize.
[2023-03-23 11:44:11] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2023-03-23 11:44:11] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-23 11:44:11] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2023-03-23 11:44:12] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 1 ms to minimize.
[2023-03-23 11:44:12] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2023-03-23 11:44:12] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 0 ms to minimize.
[2023-03-23 11:44:13] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-23 11:44:13] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-23 11:44:13] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 0 ms to minimize.
[2023-03-23 11:44:13] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 0 ms to minimize.
[2023-03-23 11:44:15] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-23 11:44:15] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2023-03-23 11:44:15] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2023-03-23 11:44:15] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-23 11:44:16] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-23 11:44:16] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2023-03-23 11:44:16] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-23 11:44:16] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 0 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 0 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 1 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-23 11:44:18] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 0 ms to minimize.
[2023-03-23 11:44:18] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 10202 ms
[2023-03-23 11:44:18] [INFO ] After 35337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1474 ms.
[2023-03-23 11:44:19] [INFO ] After 37587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:44:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-23 11:44:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1611 places, 1361 transitions and 6254 arcs took 29 ms.
[2023-03-23 11:44:20] [INFO ] Flatten gal took : 210 ms
Total runtime 156971 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (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: 1611 places, 1361 transitions, 6254 arcs.
Final Score: 273718.831
Took : 61 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPs-PT-050B-ReachabilityCardinality-08 (reachable &!potential( ( ( ( (tk(P227)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P227)) ) ) | ( ( (tk(P359)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P359)) ) ) )))
PROPERTY: ShieldPPPs-PT-050B-ReachabilityCardinality-14 (reachable &!potential( ( ( ( (tk(P649)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P649)) ) ) | ( ( ( (tk(P135)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P135)) ) ) | ( ( ( (tk(P444)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P444)) ) ) & ( ( ( (tk(P230)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P230)) ) ) | ( ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) | ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( ( (tk(P1163)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1163)) ) ) & ( ( (tk(P812)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P812)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPs-PT-050B-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( ( (tk(P1582)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1582)) ) ) | ( ( (tk(P1250)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1250)) ) ) ) | ( ( ( (tk(P1078)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1078)) ) ) | ( ( (tk(P930)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P930)) ) ) ) ) | ( ( ( ( ( (tk(P469)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P469)) ) ) & ( ( (tk(P1165)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1165)) ) ) ) | ( ( ( ( (tk(P386)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P386)) ) ) & ( ( (tk(P810)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P810)) ) ) ) & ( ( ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P62)) ) ) | ( ( ( (tk(P1232)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1232)) ) ) | ( ( (tk(P1512)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1512)) ) ) ) ) & ( ( ( ( (tk(P713)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P713)) ) ) | ( ( (tk(P889)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P889)) ) ) ) & ( ( ( ( (tk(P239)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P239)) ) ) & ( ( (tk(P42)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P42)) ) ) ) | ( ( ( (tk(P1080)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1080)) ) ) & ( ( (tk(P169)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P169)) ) ) ) ) ) ) ) ) | ( ( ( ( ( ( (tk(P100)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P100)) ) ) | ( ( (tk(P771)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P771)) ) ) ) | ( ( ( ( (tk(P1156)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1156)) ) ) & ( ( ( (tk(P1142)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1142)) ) ) | ( ( ( (tk(P1154)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1154)) ) ) & ( ( (tk(P106)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P106)) ) ) ) ) ) | ( ( ( ( (tk(P168)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P168)) ) ) & ( ( ( (tk(P360)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P360)) ) ) & ( ( (tk(P194)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P194)) ) ) ) ) | ( ( ( (tk(P592)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P592)) ) ) & ( ( ( (tk(P1314)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1314)) ) ) | ( ( ( ( (tk(P384)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P384)) ) ) & ( ( (tk(P996)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P996)) ) ) ) | ( ( ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) & ( ( (tk(P294)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P294)) ) ) ) & ( ( ( (tk(P407)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P407)) ) ) & ( ( (tk(P148)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P148)) ) ) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P1006)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1006)) ) ) | ( ( (tk(P1037)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1037)) ) ) ) | ( ( ( (tk(P863)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P863)) ) ) | ( ( ( (tk(P742)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P742)) ) ) | ( ( ( (tk(P1503)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1503)) ) ) & ( ( ( (tk(P234)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P234)) ) ) & ( ( (tk(P421)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P421)) ) ) ) ) ) ) ) ) | ( ( ( (tk(P1570)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1570)) ) ) & ( ( (tk(P616)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P616)) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12510680 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16100204 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="ShieldPPPs-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 ShieldPPPs-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-167903718900510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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