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.r394-oct2-167903718200655.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 marciexred
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 r394-oct2-167903718200655
=====================================================================

--------------------
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 1679527696766

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:28:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 23:28:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:28:20] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2023-03-22 23:28:20] [INFO ] Transformed 2343 places.
[2023-03-22 23:28:20] [INFO ] Transformed 2133 transitions.
[2023-03-22 23:28:20] [INFO ] Found NUPN structural information;
[2023-03-22 23:28:20] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 16) seen :5
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
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 32 ms. (steps per millisecond=312 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2023-03-22 23:28:22] [INFO ] Computed 331 place invariants in 91 ms
[2023-03-22 23:28:24] [INFO ] [Real]Absence check using 331 positive place invariants in 362 ms returned sat
[2023-03-22 23:28:24] [INFO ] After 1992ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 23:28:25] [INFO ] [Nat]Absence check using 331 positive place invariants in 200 ms returned sat
[2023-03-22 23:28:34] [INFO ] After 8213ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-22 23:28:35] [INFO ] Deduced a trap composed of 25 places in 1063 ms of which 10 ms to minimize.
[2023-03-22 23:28:36] [INFO ] Deduced a trap composed of 31 places in 525 ms of which 1 ms to minimize.
[2023-03-22 23:28:37] [INFO ] Deduced a trap composed of 15 places in 1555 ms of which 2 ms to minimize.
[2023-03-22 23:28:38] [INFO ] Deduced a trap composed of 23 places in 981 ms of which 2 ms to minimize.
[2023-03-22 23:28:40] [INFO ] Deduced a trap composed of 25 places in 1665 ms of which 11 ms to minimize.
[2023-03-22 23:28:41] [INFO ] Deduced a trap composed of 19 places in 848 ms of which 1 ms to minimize.
[2023-03-22 23:28:42] [INFO ] Deduced a trap composed of 27 places in 626 ms of which 1 ms to minimize.
[2023-03-22 23:28:43] [INFO ] Deduced a trap composed of 18 places in 873 ms of which 1 ms to minimize.
[2023-03-22 23:28:44] [INFO ] Deduced a trap composed of 22 places in 604 ms of which 2 ms to minimize.
[2023-03-22 23:28:44] [INFO ] Deduced a trap composed of 20 places in 495 ms of which 1 ms to minimize.
[2023-03-22 23:28:45] [INFO ] Deduced a trap composed of 33 places in 463 ms of which 1 ms to minimize.
[2023-03-22 23:28:46] [INFO ] Deduced a trap composed of 30 places in 508 ms of which 1 ms to minimize.
[2023-03-22 23:28:46] [INFO ] Deduced a trap composed of 27 places in 601 ms of which 1 ms to minimize.
[2023-03-22 23:28:47] [INFO ] Deduced a trap composed of 35 places in 521 ms of which 1 ms to minimize.
[2023-03-22 23:28:48] [INFO ] Deduced a trap composed of 28 places in 484 ms of which 2 ms to minimize.
[2023-03-22 23:28:49] [INFO ] Deduced a trap composed of 19 places in 832 ms of which 2 ms to minimize.
[2023-03-22 23:28:49] [INFO ] Deduced a trap composed of 36 places in 521 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-22 23:28:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 23:28:49] [INFO ] After 25228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 1223 ms.
Support contains 129 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 2343 transition count 1666
Reduce places removed 467 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 469 rules applied. Total rules applied 936 place count 1876 transition count 1664
Reduce places removed 1 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 2 with 36 rules applied. Total rules applied 972 place count 1875 transition count 1629
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 1007 place count 1840 transition count 1629
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 128 Pre rules applied. Total rules applied 1007 place count 1840 transition count 1501
Deduced a syphon composed of 128 places in 7 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 1263 place count 1712 transition count 1501
Discarding 187 places :
Symmetric choice reduction at 4 with 187 rule applications. Total rules 1450 place count 1525 transition count 1314
Iterating global reduction 4 with 187 rules applied. Total rules applied 1637 place count 1525 transition count 1314
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 1637 place count 1525 transition count 1242
Deduced a syphon composed of 72 places in 6 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 1781 place count 1453 transition count 1242
Performed 458 Post agglomeration using F-continuation condition.Transition count delta: 458
Deduced a syphon composed of 458 places in 3 ms
Reduce places removed 458 places and 0 transitions.
Iterating global reduction 4 with 916 rules applied. Total rules applied 2697 place count 995 transition count 784
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 3 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 2829 place count 929 transition count 784
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 2839 place count 929 transition count 774
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2849 place count 919 transition count 774
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 5 with 77 rules applied. Total rules applied 2926 place count 919 transition count 774
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2927 place count 918 transition count 773
Applied a total of 2927 rules in 846 ms. Remains 918 /2343 variables (removed 1425) and now considering 773/2133 (removed 1360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 847 ms. Remains : 918/2343 places, 773/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 773 rows 918 cols
[2023-03-22 23:28:52] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-22 23:28:53] [INFO ] [Real]Absence check using 331 positive place invariants in 77 ms returned sat
[2023-03-22 23:28:53] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 23:28:53] [INFO ] [Nat]Absence check using 331 positive place invariants in 96 ms returned sat
[2023-03-22 23:28:55] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 23:28:55] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-22 23:28:56] [INFO ] After 1184ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 23:28:56] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 1 ms to minimize.
[2023-03-22 23:28:56] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 14 ms to minimize.
[2023-03-22 23:28:57] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 2 ms to minimize.
[2023-03-22 23:28:57] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
[2023-03-22 23:28:57] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 22 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 0 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 0 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-22 23:28:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2338 ms
[2023-03-22 23:28:58] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-22 23:28:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 975 ms
[2023-03-22 23:28:59] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 11 ms to minimize.
[2023-03-22 23:29:00] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-22 23:29:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2023-03-22 23:29:00] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-22 23:29:00] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-22 23:29:01] [INFO ] Deduced a trap composed of 6 places in 501 ms of which 1 ms to minimize.
[2023-03-22 23:29:01] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 15 ms to minimize.
[2023-03-22 23:29:02] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2023-03-22 23:29:02] [INFO ] Deduced a trap composed of 6 places in 462 ms of which 0 ms to minimize.
[2023-03-22 23:29:02] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-22 23:29:02] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2023-03-22 23:29:03] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 14 ms to minimize.
[2023-03-22 23:29:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2723 ms
[2023-03-22 23:29:03] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 1 ms to minimize.
[2023-03-22 23:29:04] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2023-03-22 23:29:04] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-22 23:29:04] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 0 ms to minimize.
[2023-03-22 23:29:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1087 ms
[2023-03-22 23:29:04] [INFO ] After 9666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 961 ms.
[2023-03-22 23:29:05] [INFO ] After 12600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 292 ms.
Support contains 91 out of 918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 918/918 places, 773/773 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 918 transition count 762
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 907 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 906 transition count 761
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 906 transition count 753
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 898 transition count 753
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 897 transition count 752
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 897 transition count 752
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 94 place count 871 transition count 726
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 104 place count 866 transition count 726
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 866 transition count 726
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 864 transition count 724
Applied a total of 110 rules in 212 ms. Remains 864 /918 variables (removed 54) and now considering 724/773 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 864/918 places, 724/773 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 724 rows 864 cols
[2023-03-22 23:29:07] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 23:29:07] [INFO ] [Real]Absence check using 331 positive place invariants in 354 ms returned sat
[2023-03-22 23:29:07] [INFO ] After 593ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 23:29:08] [INFO ] [Nat]Absence check using 331 positive place invariants in 89 ms returned sat
[2023-03-22 23:29:09] [INFO ] After 1128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 23:29:09] [INFO ] State equation strengthened by 123 read => feed constraints.
[2023-03-22 23:29:11] [INFO ] After 1359ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 23:29:11] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-22 23:29:13] [INFO ] Deduced a trap composed of 5 places in 1863 ms of which 1 ms to minimize.
[2023-03-22 23:29:13] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-22 23:29:13] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-22 23:29:13] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2023-03-22 23:29:14] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 23 ms to minimize.
[2023-03-22 23:29:14] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 0 ms to minimize.
[2023-03-22 23:29:15] [INFO ] Deduced a trap composed of 7 places in 727 ms of which 1 ms to minimize.
[2023-03-22 23:29:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4163 ms
[2023-03-22 23:29:15] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2023-03-22 23:29:17] [INFO ] Deduced a trap composed of 9 places in 1768 ms of which 6 ms to minimize.
[2023-03-22 23:29:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2091 ms
[2023-03-22 23:29:17] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 31 ms to minimize.
[2023-03-22 23:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-22 23:29:18] [INFO ] Deduced a trap composed of 6 places in 568 ms of which 1 ms to minimize.
[2023-03-22 23:29:19] [INFO ] Deduced a trap composed of 7 places in 457 ms of which 1 ms to minimize.
[2023-03-22 23:29:19] [INFO ] Deduced a trap composed of 5 places in 565 ms of which 1 ms to minimize.
[2023-03-22 23:29:20] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-22 23:29:20] [INFO ] Deduced a trap composed of 5 places in 544 ms of which 1 ms to minimize.
[2023-03-22 23:29:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2584 ms
[2023-03-22 23:29:21] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2023-03-22 23:29:21] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-22 23:29:21] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 13 ms to minimize.
[2023-03-22 23:29:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 766 ms
[2023-03-22 23:29:22] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2023-03-22 23:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-22 23:29:22] [INFO ] After 12464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 765 ms.
[2023-03-22 23:29:22] [INFO ] After 15040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 318 ms.
Support contains 90 out of 864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 864/864 places, 724/724 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 863 transition count 723
Applied a total of 2 rules in 84 ms. Remains 863 /864 variables (removed 1) and now considering 723/724 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 863/864 places, 723/724 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 76364 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76364 steps, saw 59437 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 723 rows 863 cols
[2023-03-22 23:29:27] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 23:29:27] [INFO ] [Real]Absence check using 331 positive place invariants in 391 ms returned sat
[2023-03-22 23:29:27] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 23:29:28] [INFO ] [Nat]Absence check using 331 positive place invariants in 108 ms returned sat
[2023-03-22 23:29:29] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 23:29:29] [INFO ] State equation strengthened by 124 read => feed constraints.
[2023-03-22 23:29:30] [INFO ] After 935ms SMT Verify possible using 124 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 23:29:30] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 2 ms to minimize.
[2023-03-22 23:29:30] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 14 ms to minimize.
[2023-03-22 23:29:30] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 0 ms to minimize.
[2023-03-22 23:29:31] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 13 ms to minimize.
[2023-03-22 23:29:31] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-22 23:29:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 986 ms
[2023-03-22 23:29:31] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-22 23:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-22 23:29:32] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-22 23:29:32] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 1 ms to minimize.
[2023-03-22 23:29:32] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-22 23:29:33] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-22 23:29:33] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2023-03-22 23:29:33] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2023-03-22 23:29:33] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2023-03-22 23:29:33] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-22 23:29:34] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-22 23:29:34] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 1 ms to minimize.
[2023-03-22 23:29:34] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-22 23:29:35] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 0 ms to minimize.
[2023-03-22 23:29:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3094 ms
[2023-03-22 23:29:35] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-22 23:29:35] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2023-03-22 23:29:35] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2023-03-22 23:29:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 780 ms
[2023-03-22 23:29:36] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2023-03-22 23:29:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-22 23:29:36] [INFO ] After 7145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 755 ms.
[2023-03-22 23:29:37] [INFO ] After 9357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 273 ms.
Support contains 90 out of 863 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 863/863 places, 723/723 transitions.
Applied a total of 0 rules in 19 ms. Remains 863 /863 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 863/863 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 863/863 places, 723/723 transitions.
Applied a total of 0 rules in 17 ms. Remains 863 /863 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-22 23:29:37] [INFO ] Invariant cache hit.
[2023-03-22 23:29:37] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-22 23:29:37] [INFO ] Invariant cache hit.
[2023-03-22 23:29:38] [INFO ] State equation strengthened by 124 read => feed constraints.
[2023-03-22 23:29:40] [INFO ] Implicit Places using invariants and state equation in 2941 ms returned []
Implicit Place search using SMT with State Equation took 3372 ms to find 0 implicit places.
[2023-03-22 23:29:40] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-22 23:29:40] [INFO ] Invariant cache hit.
[2023-03-22 23:29:41] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3929 ms. Remains : 863/863 places, 723/723 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 863 transition count 722
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 862 transition count 722
Partial Free-agglomeration rule applied 141 times.
Drop transitions removed 141 transitions
Iterating global reduction 0 with 141 rules applied. Total rules applied 143 place count 862 transition count 722
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 862 transition count 721
Applied a total of 144 rules in 123 ms. Remains 862 /863 variables (removed 1) and now considering 721/723 (removed 2) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 721 rows 862 cols
[2023-03-22 23:29:41] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 23:29:41] [INFO ] [Real]Absence check using 331 positive place invariants in 119 ms returned sat
[2023-03-22 23:29:41] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 23:29:42] [INFO ] [Nat]Absence check using 331 positive place invariants in 85 ms returned sat
[2023-03-22 23:29:43] [INFO ] After 1194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 23:29:43] [INFO ] State equation strengthened by 123 read => feed constraints.
[2023-03-22 23:29:44] [INFO ] After 927ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 23:29:44] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 2 ms to minimize.
[2023-03-22 23:29:45] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2023-03-22 23:29:45] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 1 ms to minimize.
[2023-03-22 23:29:46] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
[2023-03-22 23:29:46] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-22 23:29:46] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 0 ms to minimize.
[2023-03-22 23:29:46] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-22 23:29:47] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-22 23:29:47] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 2 ms to minimize.
[2023-03-22 23:29:47] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-22 23:29:47] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-22 23:29:48] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 1 ms to minimize.
[2023-03-22 23:29:50] [INFO ] Deduced a trap composed of 6 places in 2421 ms of which 2 ms to minimize.
[2023-03-22 23:29:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6031 ms
[2023-03-22 23:29:50] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2023-03-22 23:29:51] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 1 ms to minimize.
[2023-03-22 23:29:53] [INFO ] Deduced a trap composed of 7 places in 1652 ms of which 0 ms to minimize.
[2023-03-22 23:29:53] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 0 ms to minimize.
[2023-03-22 23:29:53] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-22 23:29:53] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 1 ms to minimize.
[2023-03-22 23:29:53] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-22 23:29:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3276 ms
[2023-03-22 23:29:55] [INFO ] Deduced a trap composed of 11 places in 1078 ms of which 26 ms to minimize.
[2023-03-22 23:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1176 ms
[2023-03-22 23:29:57] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 1 ms to minimize.
[2023-03-22 23:29:57] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 0 ms to minimize.
[2023-03-22 23:29:57] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-22 23:29:58] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-22 23:29:58] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2023-03-22 23:29:58] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 1 ms to minimize.
[2023-03-22 23:29:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2001 ms
[2023-03-22 23:29:59] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2023-03-22 23:29:59] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 1 ms to minimize.
[2023-03-22 23:30:00] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 1 ms to minimize.
[2023-03-22 23:30:00] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-22 23:30:00] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 0 ms to minimize.
[2023-03-22 23:30:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1555 ms
[2023-03-22 23:30:00] [INFO ] After 17271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1203 ms.
[2023-03-22 23:30:02] [INFO ] After 20146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-22 23:30:02] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-22 23:30:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 863 places, 723 transitions and 3038 arcs took 10 ms.
[2023-03-22 23:30:02] [INFO ] Flatten gal took : 183 ms
Total runtime 102269 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldPPPt_PT_030B
(NrP: 863 NrTr: 723 NrArc: 3038)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.057sec

net check time: 0m 0.000sec

init dd package: 0m 3.092sec


before gc: list nodes free: 627871

after gc: idd nodes used:47946, unused:63952054; list nodes free:266117461

before gc: list nodes free: 1180903

after gc: idd nodes used:133974, unused:63866026; list nodes free:272021161

before gc: list nodes free: 1460016

after gc: idd nodes used:107361, unused:63892639; list nodes free:272147169

before gc: list nodes free: 6357414

after gc: idd nodes used:118657, unused:63881343; list nodes free:272096553

before gc: list nodes free: 1538267

after gc: idd nodes used:147986, unused:63852014; list nodes free:271969068

before gc: list nodes free: 64801

after gc: idd nodes used:168376, unused:63831624; list nodes free:271868647

before gc: list nodes free: 666830

after gc: idd nodes used:239946, unused:63760054; list nodes free:277817524

before gc: list nodes free: 1489010

after gc: idd nodes used:312573, unused:63687427; list nodes free:277492286

before gc: list nodes free: 2910110

after gc: idd nodes used:287636, unused:63712364; list nodes free:277620321

before gc: list nodes free: 3853528

after gc: idd nodes used:166500, unused:63833500; list nodes free:278165402

before gc: list nodes free: 1688203

after gc: idd nodes used:361690, unused:63638310; list nodes free:287737563
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6160592 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099280 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.014sec

26701 33102 33233 43910 44387 88992 130045 111720 93484 105567 111541 115478 114836 118419 115808 115216 152163 135042 114810 279540 149747 139743 144264 221470 188964

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="marciexred"
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 marciexred"
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 r394-oct2-167903718200655"
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 ;