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.r106-tall-167814482800485.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DES-PT-50b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482800485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 127K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678406665023

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 00:04:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 00:04:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 00:04:26] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-10 00:04:26] [INFO ] Transformed 479 places.
[2023-03-10 00:04:26] [INFO ] Transformed 430 transitions.
[2023-03-10 00:04:26] [INFO ] Found NUPN structural information;
[2023-03-10 00:04:26] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 430 rows 479 cols
[2023-03-10 00:04:26] [INFO ] Computed 65 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 84 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :11
FORMULA DES-PT-50b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
[2023-03-10 00:04:27] [INFO ] Invariant cache hit.
[2023-03-10 00:04:27] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2023-03-10 00:04:27] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-10 00:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:27] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-10 00:04:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:04:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-10 00:04:27] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-10 00:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:27] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-10 00:04:27] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 28 ms.
[2023-03-10 00:04:30] [INFO ] Added : 230 causal constraints over 46 iterations in 2461 ms. Result :sat
Minimization took 214 ms.
[2023-03-10 00:04:30] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-10 00:04:30] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-10 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:30] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-10 00:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:04:30] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-10 00:04:30] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-10 00:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:31] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-10 00:04:31] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 10 ms to minimize.
[2023-03-10 00:04:31] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-03-10 00:04:31] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2023-03-10 00:04:31] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2023-03-10 00:04:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 531 ms
[2023-03-10 00:04:31] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 27 ms.
[2023-03-10 00:04:34] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 0 ms to minimize.
[2023-03-10 00:04:34] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-10 00:04:34] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2023-03-10 00:04:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 405 ms
[2023-03-10 00:04:34] [INFO ] Added : 238 causal constraints over 48 iterations in 3116 ms. Result :sat
Minimization took 727 ms.
[2023-03-10 00:04:35] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-10 00:04:35] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-10 00:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:35] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-10 00:04:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:04:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-10 00:04:35] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-10 00:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:36] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-10 00:04:36] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2023-03-10 00:04:36] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2023-03-10 00:04:36] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-10 00:04:36] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2023-03-10 00:04:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 477 ms
[2023-03-10 00:04:36] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 23 ms.
[2023-03-10 00:04:39] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2023-03-10 00:04:39] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2023-03-10 00:04:40] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-10 00:04:40] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2023-03-10 00:04:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 490 ms
[2023-03-10 00:04:40] [INFO ] Added : 272 causal constraints over 55 iterations in 3786 ms. Result :sat
Minimization took 200 ms.
[2023-03-10 00:04:40] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-10 00:04:40] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-10 00:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:40] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-10 00:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:04:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-10 00:04:40] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-10 00:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:41] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-10 00:04:41] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-10 00:04:41] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 0 ms to minimize.
[2023-03-10 00:04:41] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 0 ms to minimize.
[2023-03-10 00:04:41] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 1 ms to minimize.
[2023-03-10 00:04:41] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 0 ms to minimize.
[2023-03-10 00:04:41] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 1 ms to minimize.
[2023-03-10 00:04:41] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 0 ms to minimize.
[2023-03-10 00:04:41] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 0 ms to minimize.
[2023-03-10 00:04:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 868 ms
[2023-03-10 00:04:41] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 23 ms.
[2023-03-10 00:04:44] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2023-03-10 00:04:45] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2023-03-10 00:04:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2023-03-10 00:04:45] [INFO ] Added : 279 causal constraints over 57 iterations in 3370 ms. Result :sat
Minimization took 410 ms.
[2023-03-10 00:04:45] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-10 00:04:45] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-10 00:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:46] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-10 00:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:04:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-10 00:04:46] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-10 00:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:46] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2023-03-10 00:04:46] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-10 00:04:47] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2023-03-10 00:04:47] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2023-03-10 00:04:47] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2023-03-10 00:04:47] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-03-10 00:04:47] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2023-03-10 00:04:47] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2023-03-10 00:04:48] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-03-10 00:04:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1555 ms
[2023-03-10 00:04:48] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 23 ms.
[2023-03-10 00:04:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 468 transition count 402
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 447 transition count 402
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 447 transition count 393
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 438 transition count 393
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 419 transition count 374
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 419 transition count 374
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 419 transition count 373
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 418 transition count 373
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 403 transition count 358
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 403 transition count 358
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 403 transition count 343
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 401 transition count 342
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 401 transition count 339
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 398 transition count 339
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 321 transition count 262
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 4 with 4 rules applied. Total rules applied 315 place count 319 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 318 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 317 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 316 transition count 262
Applied a total of 320 rules in 237 ms. Remains 316 /479 variables (removed 163) and now considering 262/430 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 316/479 places, 262/430 transitions.
// Phase 1: matrix 262 rows 316 cols
[2023-03-10 00:04:53] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47823 resets, run finished after 1940 ms. (steps per millisecond=515 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9151 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9119 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9096 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9143 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9296 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 5) seen :0
[2023-03-10 00:04:59] [INFO ] Invariant cache hit.
[2023-03-10 00:04:59] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-10 00:04:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 00:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:04:59] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-10 00:04:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:04:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:04:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-10 00:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:00] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2023-03-10 00:05:00] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-10 00:05:00] [INFO ] Added : 102 causal constraints over 21 iterations in 395 ms. Result :sat
Minimization took 102 ms.
[2023-03-10 00:05:00] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:00] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-10 00:05:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-10 00:05:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 92 ms returned sat
[2023-03-10 00:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:01] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-10 00:05:01] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-10 00:05:01] [INFO ] Added : 111 causal constraints over 23 iterations in 466 ms. Result :sat
Minimization took 125 ms.
[2023-03-10 00:05:01] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-10 00:05:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:01] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-10 00:05:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-10 00:05:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 95 ms returned sat
[2023-03-10 00:05:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:02] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-10 00:05:02] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-10 00:05:03] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-10 00:05:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-10 00:05:03] [INFO ] Added : 141 causal constraints over 29 iterations in 692 ms. Result :sat
Minimization took 86 ms.
[2023-03-10 00:05:03] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-10 00:05:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-10 00:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:03] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-10 00:05:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-10 00:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:03] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2023-03-10 00:05:03] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-10 00:05:04] [INFO ] Added : 109 causal constraints over 22 iterations in 498 ms. Result :sat
Minimization took 132 ms.
[2023-03-10 00:05:04] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-10 00:05:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:04] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-10 00:05:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 113 ms returned sat
[2023-03-10 00:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:05] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-03-10 00:05:05] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
[2023-03-10 00:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-10 00:05:05] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-10 00:05:05] [INFO ] Added : 123 causal constraints over 25 iterations in 553 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-10 00:05:06] [INFO ] Invariant cache hit.
[2023-03-10 00:05:06] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-10 00:05:06] [INFO ] Invariant cache hit.
[2023-03-10 00:05:07] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-10 00:05:07] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 00:05:07] [INFO ] Invariant cache hit.
[2023-03-10 00:05:07] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 316/316 places, 262/262 transitions.
Starting property specific reduction for DES-PT-50b-UpperBounds-05
[2023-03-10 00:05:07] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 471 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-10 00:05:07] [INFO ] Invariant cache hit.
[2023-03-10 00:05:07] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-10 00:05:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 00:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:07] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-10 00:05:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-10 00:05:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 92 ms returned sat
[2023-03-10 00:05:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:08] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-10 00:05:08] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-10 00:05:08] [INFO ] Added : 102 causal constraints over 21 iterations in 390 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 21 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-10 00:05:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47722 resets, run finished after 1851 ms. (steps per millisecond=540 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9003 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties (out of 1) seen :0
[2023-03-10 00:05:11] [INFO ] Invariant cache hit.
[2023-03-10 00:05:11] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:11] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-10 00:05:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-10 00:05:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-10 00:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:12] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2023-03-10 00:05:12] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-10 00:05:12] [INFO ] Added : 102 causal constraints over 21 iterations in 393 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-10 00:05:12] [INFO ] Invariant cache hit.
[2023-03-10 00:05:12] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-10 00:05:12] [INFO ] Invariant cache hit.
[2023-03-10 00:05:13] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-10 00:05:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 00:05:13] [INFO ] Invariant cache hit.
[2023-03-10 00:05:13] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 685 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-05 in 5919 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-07
[2023-03-10 00:05:13] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 475 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-10 00:05:13] [INFO ] Invariant cache hit.
[2023-03-10 00:05:13] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:13] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-10 00:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-10 00:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:13] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-10 00:05:14] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-10 00:05:14] [INFO ] Added : 111 causal constraints over 23 iterations in 448 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-10 00:05:14] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47931 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9125 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties (out of 1) seen :0
[2023-03-10 00:05:17] [INFO ] Invariant cache hit.
[2023-03-10 00:05:17] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:17] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-10 00:05:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2023-03-10 00:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:18] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2023-03-10 00:05:18] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 19 ms.
[2023-03-10 00:05:18] [INFO ] Added : 111 causal constraints over 23 iterations in 477 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-10 00:05:18] [INFO ] Invariant cache hit.
[2023-03-10 00:05:18] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-10 00:05:18] [INFO ] Invariant cache hit.
[2023-03-10 00:05:19] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-10 00:05:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 00:05:19] [INFO ] Invariant cache hit.
[2023-03-10 00:05:19] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-07 in 6159 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-08
[2023-03-10 00:05:19] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 480 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-10 00:05:19] [INFO ] Invariant cache hit.
[2023-03-10 00:05:19] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-10 00:05:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:19] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-10 00:05:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-10 00:05:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:20] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-10 00:05:20] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 21 ms.
[2023-03-10 00:05:20] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2023-03-10 00:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-10 00:05:20] [INFO ] Added : 141 causal constraints over 29 iterations in 718 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-10 00:05:21] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47730 resets, run finished after 1751 ms. (steps per millisecond=571 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9100 resets, run finished after 847 ms. (steps per millisecond=1180 ) properties (out of 1) seen :0
[2023-03-10 00:05:23] [INFO ] Invariant cache hit.
[2023-03-10 00:05:24] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:24] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-10 00:05:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-10 00:05:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2023-03-10 00:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:24] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2023-03-10 00:05:24] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-10 00:05:25] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2023-03-10 00:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-10 00:05:25] [INFO ] Added : 141 causal constraints over 29 iterations in 662 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 18 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-10 00:05:25] [INFO ] Invariant cache hit.
[2023-03-10 00:05:25] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-10 00:05:25] [INFO ] Invariant cache hit.
[2023-03-10 00:05:26] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-10 00:05:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 00:05:26] [INFO ] Invariant cache hit.
[2023-03-10 00:05:26] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-08 in 7017 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-09
[2023-03-10 00:05:26] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 465 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-10 00:05:26] [INFO ] Invariant cache hit.
[2023-03-10 00:05:26] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:26] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-10 00:05:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-10 00:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:27] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-10 00:05:27] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-10 00:05:27] [INFO ] Added : 109 causal constraints over 22 iterations in 492 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-10 00:05:27] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47812 resets, run finished after 1862 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9066 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 1) seen :0
[2023-03-10 00:05:30] [INFO ] Invariant cache hit.
[2023-03-10 00:05:30] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:30] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-10 00:05:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-10 00:05:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 97 ms returned sat
[2023-03-10 00:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:31] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-10 00:05:31] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-10 00:05:31] [INFO ] Added : 109 causal constraints over 22 iterations in 488 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-10 00:05:32] [INFO ] Invariant cache hit.
[2023-03-10 00:05:32] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-10 00:05:32] [INFO ] Invariant cache hit.
[2023-03-10 00:05:32] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-10 00:05:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 00:05:32] [INFO ] Invariant cache hit.
[2023-03-10 00:05:32] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 673 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-09 in 6173 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-10
[2023-03-10 00:05:32] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 478 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-10 00:05:32] [INFO ] Invariant cache hit.
[2023-03-10 00:05:32] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-10 00:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:32] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-10 00:05:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 114 ms returned sat
[2023-03-10 00:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:33] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-03-10 00:05:33] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2023-03-10 00:05:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-10 00:05:33] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-10 00:05:34] [INFO ] Added : 123 causal constraints over 25 iterations in 587 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-10 00:05:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47985 resets, run finished after 1774 ms. (steps per millisecond=563 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9198 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 1) seen :0
[2023-03-10 00:05:36] [INFO ] Invariant cache hit.
[2023-03-10 00:05:37] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 00:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:37] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-10 00:05:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 00:05:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 110 ms returned sat
[2023-03-10 00:05:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:37] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-10 00:05:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2023-03-10 00:05:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-10 00:05:37] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-10 00:05:38] [INFO ] Added : 123 causal constraints over 25 iterations in 542 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-10 00:05:38] [INFO ] Invariant cache hit.
[2023-03-10 00:05:38] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-10 00:05:38] [INFO ] Invariant cache hit.
[2023-03-10 00:05:39] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-10 00:05:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 00:05:39] [INFO ] Invariant cache hit.
[2023-03-10 00:05:39] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-10 in 6414 ms.
[2023-03-10 00:05:39] [INFO ] Flatten gal took : 57 ms
[2023-03-10 00:05:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-10 00:05:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 316 places, 262 transitions and 1275 arcs took 2 ms.
Total runtime 72882 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=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DES_PT_50b
(NrP: 316 NrTr: 262 NrArc: 1275)

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

net check time: 0m 0.000sec

init dd package: 0m 2.719sec


before gc: list nodes free: 1708908

after gc: idd nodes used:331749, unused:63668251; list nodes free:289992638
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6164376 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100160 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 UpperBounds -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.000sec

368538 479180 442020 654814 504663 501995 728509

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="DES-PT-50b"
export BK_EXAMINATION="UpperBounds"
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 DES-PT-50b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814482800485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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