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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679576806199

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:06:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 13:06:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:06:48] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-23 13:06:48] [INFO ] Transformed 2343 places.
[2023-03-23 13:06:48] [INFO ] Transformed 2133 transitions.
[2023-03-23 13:06:48] [INFO ] Found NUPN structural information;
[2023-03-23 13:06:48] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2023-03-23 13:06:49] [INFO ] Computed 331 place invariants in 24 ms
[2023-03-23 13:06:51] [INFO ] After 1206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-23 13:06:52] [INFO ] [Nat]Absence check using 331 positive place invariants in 139 ms returned sat
[2023-03-23 13:06:56] [INFO ] After 3703ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-23 13:06:57] [INFO ] Deduced a trap composed of 21 places in 753 ms of which 11 ms to minimize.
[2023-03-23 13:06:58] [INFO ] Deduced a trap composed of 17 places in 895 ms of which 3 ms to minimize.
[2023-03-23 13:06:59] [INFO ] Deduced a trap composed of 19 places in 615 ms of which 1 ms to minimize.
[2023-03-23 13:07:00] [INFO ] Deduced a trap composed of 26 places in 664 ms of which 3 ms to minimize.
[2023-03-23 13:07:01] [INFO ] Deduced a trap composed of 27 places in 541 ms of which 14 ms to minimize.
[2023-03-23 13:07:01] [INFO ] Deduced a trap composed of 22 places in 653 ms of which 2 ms to minimize.
[2023-03-23 13:07:02] [INFO ] Deduced a trap composed of 25 places in 591 ms of which 2 ms to minimize.
[2023-03-23 13:07:03] [INFO ] Deduced a trap composed of 43 places in 706 ms of which 5 ms to minimize.
[2023-03-23 13:07:04] [INFO ] Deduced a trap composed of 29 places in 662 ms of which 1 ms to minimize.
[2023-03-23 13:07:04] [INFO ] Deduced a trap composed of 45 places in 514 ms of which 1 ms to minimize.
[2023-03-23 13:07:05] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 2 ms to minimize.
[2023-03-23 13:07:05] [INFO ] Deduced a trap composed of 34 places in 449 ms of which 1 ms to minimize.
[2023-03-23 13:07:06] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 1 ms to minimize.
[2023-03-23 13:07:06] [INFO ] Deduced a trap composed of 43 places in 377 ms of which 1 ms to minimize.
[2023-03-23 13:07:07] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 2 ms to minimize.
[2023-03-23 13:07:07] [INFO ] Deduced a trap composed of 41 places in 485 ms of which 2 ms to minimize.
[2023-03-23 13:07:08] [INFO ] Deduced a trap composed of 42 places in 464 ms of which 1 ms to minimize.
[2023-03-23 13:07:09] [INFO ] Deduced a trap composed of 34 places in 433 ms of which 1 ms to minimize.
[2023-03-23 13:07:09] [INFO ] Deduced a trap composed of 29 places in 395 ms of which 2 ms to minimize.
[2023-03-23 13:07:09] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 3 ms to minimize.
[2023-03-23 13:07:10] [INFO ] Deduced a trap composed of 42 places in 610 ms of which 1 ms to minimize.
[2023-03-23 13:07:11] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 1 ms to minimize.
[2023-03-23 13:07:11] [INFO ] Deduced a trap composed of 56 places in 361 ms of which 0 ms to minimize.
[2023-03-23 13:07:12] [INFO ] Deduced a trap composed of 40 places in 364 ms of which 1 ms to minimize.
[2023-03-23 13:07:12] [INFO ] Deduced a trap composed of 31 places in 457 ms of which 1 ms to minimize.
[2023-03-23 13:07:13] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 1 ms to minimize.
[2023-03-23 13:07:13] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 1 ms to minimize.
[2023-03-23 13:07:14] [INFO ] Deduced a trap composed of 43 places in 355 ms of which 1 ms to minimize.
[2023-03-23 13:07:14] [INFO ] Deduced a trap composed of 40 places in 311 ms of which 1 ms to minimize.
[2023-03-23 13:07:14] [INFO ] Deduced a trap composed of 43 places in 327 ms of which 0 ms to minimize.
[2023-03-23 13:07:15] [INFO ] Deduced a trap composed of 45 places in 312 ms of which 1 ms to minimize.
[2023-03-23 13:07:15] [INFO ] Deduced a trap composed of 45 places in 316 ms of which 0 ms to minimize.
[2023-03-23 13:07:16] [INFO ] Deduced a trap composed of 41 places in 363 ms of which 2 ms to minimize.
[2023-03-23 13:07:17] [INFO ] Deduced a trap composed of 24 places in 1158 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 13:07:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:07:17] [INFO ] After 26184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 11 different solutions.
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1082 ms.
Support contains 128 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2343 transition count 1658
Reduce places removed 475 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 477 rules applied. Total rules applied 952 place count 1868 transition count 1656
Reduce places removed 1 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 37 rules applied. Total rules applied 989 place count 1867 transition count 1620
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 1025 place count 1831 transition count 1620
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 1025 place count 1831 transition count 1495
Deduced a syphon composed of 125 places in 6 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1275 place count 1706 transition count 1495
Discarding 186 places :
Symmetric choice reduction at 4 with 186 rule applications. Total rules 1461 place count 1520 transition count 1309
Iterating global reduction 4 with 186 rules applied. Total rules applied 1647 place count 1520 transition count 1309
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 1647 place count 1520 transition count 1239
Deduced a syphon composed of 70 places in 6 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 1787 place count 1450 transition count 1239
Performed 466 Post agglomeration using F-continuation condition.Transition count delta: 466
Deduced a syphon composed of 466 places in 2 ms
Reduce places removed 466 places and 0 transitions.
Iterating global reduction 4 with 932 rules applied. Total rules applied 2719 place count 984 transition count 773
Renaming transitions due to excessive name length > 1024 char.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 2851 place count 918 transition count 773
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 2858 place count 918 transition count 766
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2865 place count 911 transition count 766
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 5 with 77 rules applied. Total rules applied 2942 place count 911 transition count 766
Applied a total of 2942 rules in 692 ms. Remains 911 /2343 variables (removed 1432) and now considering 766/2133 (removed 1367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 911/2343 places, 766/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 10) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 766 rows 911 cols
[2023-03-23 13:07:19] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-23 13:07:20] [INFO ] [Real]Absence check using 331 positive place invariants in 149 ms returned sat
[2023-03-23 13:07:20] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 13:07:20] [INFO ] [Nat]Absence check using 331 positive place invariants in 110 ms returned sat
[2023-03-23 13:07:21] [INFO ] After 929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 13:07:22] [INFO ] State equation strengthened by 135 read => feed constraints.
[2023-03-23 13:07:23] [INFO ] After 1469ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 13:07:23] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 2 ms to minimize.
[2023-03-23 13:07:24] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-23 13:07:24] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-23 13:07:24] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-23 13:07:24] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2023-03-23 13:07:25] [INFO ] Deduced a trap composed of 6 places in 563 ms of which 1 ms to minimize.
[2023-03-23 13:07:25] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 0 ms to minimize.
[2023-03-23 13:07:25] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-23 13:07:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2321 ms
[2023-03-23 13:07:26] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-23 13:07:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-23 13:07:26] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-23 13:07:26] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-23 13:07:27] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-23 13:07:27] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-23 13:07:27] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-23 13:07:27] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-23 13:07:27] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2023-03-23 13:07:28] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 23 ms to minimize.
[2023-03-23 13:07:28] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-23 13:07:28] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-23 13:07:28] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2023-03-23 13:07:28] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-23 13:07:29] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 12 ms to minimize.
[2023-03-23 13:07:29] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-03-23 13:07:29] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2886 ms
[2023-03-23 13:07:29] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-23 13:07:30] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-23 13:07:30] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-23 13:07:30] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-23 13:07:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 760 ms
[2023-03-23 13:07:30] [INFO ] After 8729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 691 ms.
[2023-03-23 13:07:31] [INFO ] After 10991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 302 ms.
Support contains 91 out of 911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 911/911 places, 766/766 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 911 transition count 761
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 906 transition count 761
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 906 transition count 750
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 895 transition count 750
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 76 place count 873 transition count 728
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 90 place count 866 transition count 728
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 866 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 865 transition count 727
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 865 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 864 transition count 726
Applied a total of 97 rules in 193 ms. Remains 864 /911 variables (removed 47) and now considering 726/766 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 864/911 places, 726/766 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 9) seen :3
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 726 rows 864 cols
[2023-03-23 13:07:32] [INFO ] Computed 331 place invariants in 6 ms
[2023-03-23 13:07:32] [INFO ] [Real]Absence check using 331 positive place invariants in 78 ms returned sat
[2023-03-23 13:07:32] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 13:07:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 187 ms returned sat
[2023-03-23 13:07:34] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 13:07:34] [INFO ] State equation strengthened by 127 read => feed constraints.
[2023-03-23 13:07:34] [INFO ] After 897ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 13:07:35] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 1 ms to minimize.
[2023-03-23 13:07:35] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-03-23 13:07:35] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-23 13:07:35] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-23 13:07:36] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2023-03-23 13:07:36] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-23 13:07:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1309 ms
[2023-03-23 13:07:36] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2023-03-23 13:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-23 13:07:37] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 14 ms to minimize.
[2023-03-23 13:07:37] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-23 13:07:37] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2023-03-23 13:07:37] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2023-03-23 13:07:37] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-23 13:07:37] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-23 13:07:37] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2023-03-23 13:07:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 971 ms
[2023-03-23 13:07:38] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-23 13:07:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-23 13:07:38] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2023-03-23 13:07:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-23 13:07:38] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2023-03-23 13:07:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-23 13:07:38] [INFO ] After 4486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 686 ms.
[2023-03-23 13:07:39] [INFO ] After 6352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 199 ms.
Support contains 86 out of 864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 864/864 places, 726/726 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 864 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 863 transition count 725
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 861 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 860 transition count 723
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 860 transition count 723
Applied a total of 9 rules in 69 ms. Remains 860 /864 variables (removed 4) and now considering 723/726 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 860/864 places, 723/726 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 6) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 723 rows 860 cols
[2023-03-23 13:07:40] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-23 13:07:40] [INFO ] [Real]Absence check using 331 positive place invariants in 60 ms returned sat
[2023-03-23 13:07:40] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 13:07:40] [INFO ] [Nat]Absence check using 331 positive place invariants in 227 ms returned sat
[2023-03-23 13:07:42] [INFO ] After 1626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 13:07:42] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-23 13:07:43] [INFO ] After 653ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 13:07:43] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2023-03-23 13:07:43] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2023-03-23 13:07:43] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-23 13:07:43] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2023-03-23 13:07:44] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 0 ms to minimize.
[2023-03-23 13:07:44] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2023-03-23 13:07:44] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-23 13:07:44] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-23 13:07:44] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-23 13:07:44] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-23 13:07:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1829 ms
[2023-03-23 13:07:45] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 0 ms to minimize.
[2023-03-23 13:07:45] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-23 13:07:46] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-03-23 13:07:46] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2023-03-23 13:07:46] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2023-03-23 13:07:46] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-23 13:07:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1398 ms
[2023-03-23 13:07:46] [INFO ] After 4564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 656 ms.
[2023-03-23 13:07:47] [INFO ] After 7358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 152 ms.
Support contains 80 out of 860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 860/860 places, 723/723 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 860 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 859 transition count 722
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 859 transition count 719
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 856 transition count 719
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 853 transition count 716
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 851 transition count 716
Applied a total of 18 rules in 46 ms. Remains 851 /860 variables (removed 9) and now considering 716/723 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 851/860 places, 716/723 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 138807 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138807 steps, saw 107916 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 716 rows 851 cols
[2023-03-23 13:07:51] [INFO ] Computed 331 place invariants in 9 ms
[2023-03-23 13:07:51] [INFO ] [Real]Absence check using 331 positive place invariants in 54 ms returned sat
[2023-03-23 13:07:51] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 13:07:51] [INFO ] [Nat]Absence check using 331 positive place invariants in 56 ms returned sat
[2023-03-23 13:07:52] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 13:07:52] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-23 13:07:53] [INFO ] After 671ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 13:07:53] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-23 13:07:53] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-23 13:07:53] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2023-03-23 13:07:54] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-23 13:07:54] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-23 13:07:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1133 ms
[2023-03-23 13:07:54] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2023-03-23 13:07:55] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-23 13:07:55] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-23 13:07:55] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2023-03-23 13:07:55] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2023-03-23 13:07:56] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-23 13:07:56] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2023-03-23 13:07:56] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-23 13:07:56] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2023-03-23 13:07:57] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2023-03-23 13:07:57] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2023-03-23 13:07:57] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-23 13:07:57] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-23 13:07:57] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2023-03-23 13:07:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3311 ms
[2023-03-23 13:07:58] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-23 13:07:58] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2023-03-23 13:07:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-03-23 13:07:58] [INFO ] After 6287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 571 ms.
[2023-03-23 13:07:59] [INFO ] After 7901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 107 ms.
Support contains 80 out of 851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 716/716 transitions.
Applied a total of 0 rules in 22 ms. Remains 851 /851 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 851/851 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 716/716 transitions.
Applied a total of 0 rules in 16 ms. Remains 851 /851 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2023-03-23 13:07:59] [INFO ] Invariant cache hit.
[2023-03-23 13:08:00] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-23 13:08:00] [INFO ] Invariant cache hit.
[2023-03-23 13:08:00] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-23 13:08:01] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 2424 ms to find 0 implicit places.
[2023-03-23 13:08:02] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-23 13:08:02] [INFO ] Invariant cache hit.
[2023-03-23 13:08:02] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2903 ms. Remains : 851/851 places, 716/716 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 851 transition count 715
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 850 transition count 715
Partial Free-agglomeration rule applied 155 times.
Drop transitions removed 155 transitions
Iterating global reduction 0 with 155 rules applied. Total rules applied 157 place count 850 transition count 715
Applied a total of 157 rules in 43 ms. Remains 850 /851 variables (removed 1) and now considering 715/716 (removed 1) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 715 rows 850 cols
[2023-03-23 13:08:02] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-23 13:08:02] [INFO ] [Real]Absence check using 331 positive place invariants in 79 ms returned sat
[2023-03-23 13:08:02] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 13:08:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 85 ms returned sat
[2023-03-23 13:08:03] [INFO ] After 767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 13:08:04] [INFO ] State equation strengthened by 139 read => feed constraints.
[2023-03-23 13:08:05] [INFO ] After 1413ms SMT Verify possible using 139 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 13:08:05] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-23 13:08:05] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2023-03-23 13:08:06] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2023-03-23 13:08:06] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-23 13:08:06] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2023-03-23 13:08:06] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-23 13:08:07] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2023-03-23 13:08:07] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 1 ms to minimize.
[2023-03-23 13:08:07] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-23 13:08:07] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-23 13:08:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2296 ms
[2023-03-23 13:08:08] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 1 ms to minimize.
[2023-03-23 13:08:08] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-23 13:08:08] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-23 13:08:08] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2023-03-23 13:08:08] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2023-03-23 13:08:09] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-23 13:08:09] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2023-03-23 13:08:09] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-23 13:08:09] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2023-03-23 13:08:10] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-23 13:08:10] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-23 13:08:10] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2023-03-23 13:08:10] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 14 ms to minimize.
[2023-03-23 13:08:10] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-03-23 13:08:10] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-23 13:08:11] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2023-03-23 13:08:11] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-23 13:08:11] [INFO ] Deduced a trap composed of 9 places in 498 ms of which 0 ms to minimize.
[2023-03-23 13:08:12] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2023-03-23 13:08:12] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2023-03-23 13:08:12] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-23 13:08:12] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4590 ms
[2023-03-23 13:08:12] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-23 13:08:13] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2023-03-23 13:08:13] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-23 13:08:13] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-23 13:08:13] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2023-03-23 13:08:14] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-23 13:08:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1287 ms
[2023-03-23 13:08:14] [INFO ] After 10215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 719 ms.
[2023-03-23 13:08:14] [INFO ] After 12156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-23 13:08:14] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2023-03-23 13:08:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 851 places, 716 transitions and 3054 arcs took 9 ms.
[2023-03-23 13:08:15] [INFO ] Flatten gal took : 108 ms
Total runtime 86930 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 030B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 851 places, 716 transitions, 3054 arcs.
Final Score: 47073.897
Took : 29 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679576925660

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 4666:
syntax error

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;