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.r010-oct2-167813598500029.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 ASLink-PT-02a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598500029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 13:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 279K 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 ASLink-PT-02a-UpperBounds-00
FORMULA_NAME ASLink-PT-02a-UpperBounds-01
FORMULA_NAME ASLink-PT-02a-UpperBounds-02
FORMULA_NAME ASLink-PT-02a-UpperBounds-03
FORMULA_NAME ASLink-PT-02a-UpperBounds-04
FORMULA_NAME ASLink-PT-02a-UpperBounds-05
FORMULA_NAME ASLink-PT-02a-UpperBounds-06
FORMULA_NAME ASLink-PT-02a-UpperBounds-07
FORMULA_NAME ASLink-PT-02a-UpperBounds-08
FORMULA_NAME ASLink-PT-02a-UpperBounds-09
FORMULA_NAME ASLink-PT-02a-UpperBounds-10
FORMULA_NAME ASLink-PT-02a-UpperBounds-11
FORMULA_NAME ASLink-PT-02a-UpperBounds-12
FORMULA_NAME ASLink-PT-02a-UpperBounds-13
FORMULA_NAME ASLink-PT-02a-UpperBounds-14
FORMULA_NAME ASLink-PT-02a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678655392925

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=ASLink-PT-02a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 21:09:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 21:09:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:09:55] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-12 21:09:55] [INFO ] Transformed 626 places.
[2023-03-12 21:09:55] [INFO ] Transformed 1008 transitions.
[2023-03-12 21:09:55] [INFO ] Found NUPN structural information;
[2023-03-12 21:09:55] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
// Phase 1: matrix 998 rows 626 cols
[2023-03-12 21:09:55] [INFO ] Computed 118 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 101 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :12
FORMULA ASLink-PT-02a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
[2023-03-12 21:09:55] [INFO ] Invariant cache hit.
[2023-03-12 21:09:56] [INFO ] [Real]Absence check using 28 positive place invariants in 42 ms returned sat
[2023-03-12 21:09:56] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 42 ms returned sat
[2023-03-12 21:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:09:56] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-12 21:09:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:09:56] [INFO ] [Nat]Absence check using 28 positive place invariants in 23 ms returned sat
[2023-03-12 21:09:57] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 68 ms returned sat
[2023-03-12 21:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:09:57] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2023-03-12 21:09:57] [INFO ] Deduced a trap composed of 112 places in 331 ms of which 5 ms to minimize.
[2023-03-12 21:09:58] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2023-03-12 21:09:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 700 ms
[2023-03-12 21:09:58] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 100 ms.
[2023-03-12 21:10:02] [INFO ] Deduced a trap composed of 5 places in 443 ms of which 1 ms to minimize.
[2023-03-12 21:10:02] [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: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1177)
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)
[2023-03-12 21:10:02] [INFO ] [Real]Absence check using 28 positive place invariants in 10 ms returned sat
[2023-03-12 21:10:02] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 20 ms returned sat
[2023-03-12 21:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:02] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-12 21:10:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:02] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2023-03-12 21:10:02] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 26 ms returned sat
[2023-03-12 21:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:03] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2023-03-12 21:10:03] [INFO ] Deduced a trap composed of 28 places in 310 ms of which 2 ms to minimize.
[2023-03-12 21:10:04] [INFO ] Deduced a trap composed of 117 places in 292 ms of which 14 ms to minimize.
[2023-03-12 21:10:05] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 1 ms to minimize.
[2023-03-12 21:10:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2240 ms
[2023-03-12 21:10:05] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 102 ms.
[2023-03-12 21:10:07] [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: Stream close... while checking expression at index 1
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.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)
[2023-03-12 21:10:07] [INFO ] [Real]Absence check using 28 positive place invariants in 10 ms returned sat
[2023-03-12 21:10:08] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 22 ms returned sat
[2023-03-12 21:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:08] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-12 21:10:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:08] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-12 21:10:08] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 37 ms returned sat
[2023-03-12 21:10:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:09] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2023-03-12 21:10:09] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 0 ms to minimize.
[2023-03-12 21:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2023-03-12 21:10:09] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 91 ms.
[2023-03-12 21:10:13] [INFO ] Deduced a trap composed of 5 places in 424 ms of which 14 ms to minimize.
[2023-03-12 21:10:13] [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: Stream close... while checking expression at index 2
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.refineWithCausalOrder(DeadlockTester.java:1177)
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)
[2023-03-12 21:10:14] [INFO ] [Real]Absence check using 28 positive place invariants in 9 ms returned sat
[2023-03-12 21:10:14] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 17 ms returned sat
[2023-03-12 21:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:14] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-12 21:10:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:14] [INFO ] [Nat]Absence check using 28 positive place invariants in 11 ms returned sat
[2023-03-12 21:10:14] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 74 ms returned sat
[2023-03-12 21:10:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:15] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2023-03-12 21:10:15] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 86 ms.
[2023-03-12 21:10:19] [INFO ] Added : 20 causal constraints over 4 iterations in 4049 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-02a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 614 transition count 947
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 114 place count 563 transition count 947
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 114 place count 563 transition count 898
Deduced a syphon composed of 49 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 231 place count 495 transition count 898
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 495 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 494 transition count 897
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 489 transition count 874
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 488 transition count 874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 250 place count 487 transition count 869
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 253 place count 484 transition count 869
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 483 transition count 861
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 483 transition count 861
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 256 place count 482 transition count 853
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 482 transition count 853
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 258 place count 481 transition count 845
Iterating global reduction 6 with 1 rules applied. Total rules applied 259 place count 481 transition count 845
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 260 place count 480 transition count 837
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 480 transition count 837
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 262 place count 479 transition count 829
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 479 transition count 829
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 478 transition count 821
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 478 transition count 821
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 477 transition count 813
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 477 transition count 813
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 476 transition count 805
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 476 transition count 805
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 475 transition count 797
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 475 transition count 797
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 272 place count 474 transition count 789
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 474 transition count 789
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 274 place count 473 transition count 781
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 473 transition count 781
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 276 place count 472 transition count 773
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 472 transition count 773
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 278 place count 471 transition count 765
Iterating global reduction 6 with 1 rules applied. Total rules applied 279 place count 471 transition count 765
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 470 transition count 757
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 470 transition count 757
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 282 place count 469 transition count 749
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 469 transition count 749
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 284 place count 468 transition count 741
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 468 transition count 741
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 313 place count 454 transition count 727
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 314 place count 454 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 315 place count 453 transition count 726
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 317 place count 453 transition count 726
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 318 place count 452 transition count 725
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 322 place count 448 transition count 725
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 322 place count 448 transition count 717
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 339 place count 439 transition count 717
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 342 place count 436 transition count 717
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 342 place count 436 transition count 716
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 344 place count 435 transition count 716
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 350 place count 432 transition count 713
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 352 place count 430 transition count 711
Iterating global reduction 9 with 2 rules applied. Total rules applied 354 place count 430 transition count 711
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 356 place count 430 transition count 709
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 358 place count 428 transition count 709
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 360 place count 428 transition count 709
Applied a total of 360 rules in 619 ms. Remains 428 /626 variables (removed 198) and now considering 709/998 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 620 ms. Remains : 428/626 places, 709/998 transitions.
// Phase 1: matrix 709 rows 428 cols
[2023-03-12 21:10:20] [INFO ] Computed 77 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 16133 resets, run finished after 1753 ms. (steps per millisecond=570 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5494 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 3) seen :1
FORMULA ASLink-PT-02a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 5592 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 2) seen :0
[2023-03-12 21:10:23] [INFO ] Invariant cache hit.
[2023-03-12 21:10:24] [INFO ] [Real]Absence check using 20 positive place invariants in 52 ms returned sat
[2023-03-12 21:10:24] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 12 ms returned sat
[2023-03-12 21:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:24] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-12 21:10:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 34 ms returned sat
[2023-03-12 21:10:24] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 54 ms returned sat
[2023-03-12 21:10:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:24] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-03-12 21:10:24] [INFO ] Computed and/alt/rep : 265/1057/265 causal constraints (skipped 427 transitions) in 63 ms.
[2023-03-12 21:10:27] [INFO ] Added : 179 causal constraints over 36 iterations in 2447 ms. Result :sat
Minimization took 181 ms.
[2023-03-12 21:10:27] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 21:10:27] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 65 ms returned sat
[2023-03-12 21:10:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:27] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-12 21:10:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 21:10:27] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 12 ms returned sat
[2023-03-12 21:10:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:28] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2023-03-12 21:10:28] [INFO ] Computed and/alt/rep : 265/1057/265 causal constraints (skipped 427 transitions) in 74 ms.
[2023-03-12 21:10:30] [INFO ] Added : 155 causal constraints over 32 iterations in 1875 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 709/709 transitions.
Applied a total of 0 rules in 13 ms. Remains 428 /428 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 428/428 places, 709/709 transitions.
[2023-03-12 21:10:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16286 resets, run finished after 1667 ms. (steps per millisecond=599 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5548 resets, run finished after 930 ms. (steps per millisecond=1075 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5592 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 2) seen :0
[2023-03-12 21:10:34] [INFO ] Invariant cache hit.
[2023-03-12 21:10:34] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-12 21:10:34] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 20 ms returned sat
[2023-03-12 21:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:34] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2023-03-12 21:10:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 58 ms returned sat
[2023-03-12 21:10:34] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 29 ms returned sat
[2023-03-12 21:10:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:35] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2023-03-12 21:10:35] [INFO ] Computed and/alt/rep : 265/1057/265 causal constraints (skipped 427 transitions) in 52 ms.
[2023-03-12 21:10:37] [INFO ] Added : 179 causal constraints over 36 iterations in 2607 ms. Result :sat
Minimization took 155 ms.
[2023-03-12 21:10:37] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-12 21:10:38] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2023-03-12 21:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:38] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-12 21:10:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-12 21:10:38] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 42 ms returned sat
[2023-03-12 21:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:38] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-12 21:10:38] [INFO ] Computed and/alt/rep : 265/1057/265 causal constraints (skipped 427 transitions) in 56 ms.
[2023-03-12 21:10:40] [INFO ] Added : 155 causal constraints over 32 iterations in 2059 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 709/709 transitions.
Applied a total of 0 rules in 10 ms. Remains 428 /428 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 428/428 places, 709/709 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 709/709 transitions.
Applied a total of 0 rules in 11 ms. Remains 428 /428 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2023-03-12 21:10:41] [INFO ] Invariant cache hit.
[2023-03-12 21:10:41] [INFO ] Implicit Places using invariants in 518 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 263, 274, 275, 276, 294, 296, 299, 317, 318, 319, 320, 332, 338, 344, 350, 356, 362, 368, 374, 380, 386, 392]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 523 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 390/428 places, 709/709 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 390 transition count 649
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 121 place count 330 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 329 transition count 648
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 122 place count 329 transition count 633
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 153 place count 313 transition count 633
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 165 place count 309 transition count 625
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 173 place count 301 transition count 625
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 188 place count 286 transition count 610
Iterating global reduction 5 with 15 rules applied. Total rules applied 203 place count 286 transition count 610
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 206 place count 286 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 206 place count 286 transition count 606
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 208 place count 285 transition count 606
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 211 place count 282 transition count 603
Iterating global reduction 6 with 3 rules applied. Total rules applied 214 place count 282 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 215 place count 281 transition count 602
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 281 transition count 602
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 280 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 280 transition count 601
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 266 place count 256 transition count 577
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 268 place count 256 transition count 575
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 270 place count 254 transition count 573
Iterating global reduction 7 with 2 rules applied. Total rules applied 272 place count 254 transition count 573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 274 place count 254 transition count 571
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 278 place count 254 transition count 567
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 283 place count 249 transition count 567
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 289 place count 249 transition count 567
Applied a total of 289 rules in 89 ms. Remains 249 /390 variables (removed 141) and now considering 567/709 (removed 142) transitions.
// Phase 1: matrix 567 rows 249 cols
[2023-03-12 21:10:41] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-12 21:10:42] [INFO ] Implicit Places using invariants in 272 ms returned [73, 91, 97, 100, 102, 105, 106, 158, 175, 181, 184, 186]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 272 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 237/428 places, 567/709 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 231 transition count 561
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 231 transition count 561
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 229 transition count 559
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 229 transition count 559
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 225 transition count 555
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 225 transition count 549
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 219 transition count 549
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 219 transition count 547
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 217 transition count 547
Applied a total of 40 rules in 39 ms. Remains 217 /237 variables (removed 20) and now considering 547/567 (removed 20) transitions.
// Phase 1: matrix 547 rows 217 cols
[2023-03-12 21:10:42] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-12 21:10:42] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-12 21:10:42] [INFO ] Invariant cache hit.
[2023-03-12 21:10:42] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 217/428 places, 547/709 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1517 ms. Remains : 217/428 places, 547/709 transitions.
Successfully produced net in file /tmp/petri1000_329245817017195639.dot
Successfully produced net in file /tmp/petri1001_4346314439554895236.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 545 rows 217 cols
[2023-03-12 21:10:42] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 23898 resets, run finished after 1238 ms. (steps per millisecond=807 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10014 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 10090 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 2) seen :0
[2023-03-12 21:10:45] [INFO ] Invariant cache hit.
[2023-03-12 21:10:45] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 21:10:45] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-12 21:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:45] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-12 21:10:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 21:10:45] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 17 ms returned sat
[2023-03-12 21:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:46] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-12 21:10:46] [INFO ] Computed and/alt/rep : 92/514/92 causal constraints (skipped 439 transitions) in 24 ms.
[2023-03-12 21:10:46] [INFO ] Added : 9 causal constraints over 2 iterations in 161 ms. Result :sat
Minimization took 87 ms.
[2023-03-12 21:10:46] [INFO ] [Real]Absence check using 7 positive place invariants in 24 ms returned sat
[2023-03-12 21:10:46] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-12 21:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:46] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-12 21:10:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 21:10:46] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 18 ms returned sat
[2023-03-12 21:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:46] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-12 21:10:47] [INFO ] Computed and/alt/rep : 92/514/92 causal constraints (skipped 439 transitions) in 34 ms.
[2023-03-12 21:10:47] [INFO ] Added : 37 causal constraints over 8 iterations in 482 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 545/545 transitions.
Graph (complete) has 1349 edges and 217 vertex of which 215 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 215 transition count 545
Applied a total of 3 rules in 28 ms. Remains 215 /217 variables (removed 2) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 215/217 places, 545/545 transitions.
// Phase 1: matrix 545 rows 215 cols
[2023-03-12 21:10:47] [INFO ] Computed 21 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 23827 resets, run finished after 1276 ms. (steps per millisecond=783 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10062 resets, run finished after 598 ms. (steps per millisecond=1672 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10044 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 2) seen :0
[2023-03-12 21:10:50] [INFO ] Invariant cache hit.
[2023-03-12 21:10:50] [INFO ] [Real]Absence check using 7 positive place invariants in 47 ms returned sat
[2023-03-12 21:10:50] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 19 ms returned sat
[2023-03-12 21:10:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:50] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-12 21:10:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 21:10:50] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-12 21:10:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:51] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-12 21:10:51] [INFO ] Computed and/alt/rep : 92/512/92 causal constraints (skipped 439 transitions) in 38 ms.
[2023-03-12 21:10:51] [INFO ] Added : 8 causal constraints over 2 iterations in 141 ms. Result :sat
Minimization took 110 ms.
[2023-03-12 21:10:51] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-12 21:10:51] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-12 21:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:51] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-12 21:10:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 21:10:51] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 65 ms returned sat
[2023-03-12 21:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:51] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2023-03-12 21:10:52] [INFO ] Computed and/alt/rep : 92/512/92 causal constraints (skipped 439 transitions) in 56 ms.
[2023-03-12 21:10:52] [INFO ] Added : 15 causal constraints over 3 iterations in 283 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 545/545 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 215/215 places, 545/545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 545/545 transitions.
Applied a total of 0 rules in 4 ms. Remains 215 /215 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2023-03-12 21:10:52] [INFO ] Invariant cache hit.
[2023-03-12 21:10:52] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-12 21:10:52] [INFO ] Invariant cache hit.
[2023-03-12 21:10:53] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-12 21:10:53] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 21:10:53] [INFO ] Invariant cache hit.
[2023-03-12 21:10:53] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1139 ms. Remains : 215/215 places, 545/545 transitions.
Starting property specific reduction for ASLink-PT-02a-UpperBounds-11
[2023-03-12 21:10:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-12 21:10:53] [INFO ] Invariant cache hit.
[2023-03-12 21:10:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 21:10:53] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-12 21:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:53] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-12 21:10:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 21:10:53] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-12 21:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:54] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-12 21:10:54] [INFO ] Computed and/alt/rep : 92/512/92 causal constraints (skipped 439 transitions) in 45 ms.
[2023-03-12 21:10:54] [INFO ] Added : 8 causal constraints over 2 iterations in 160 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 545/545 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 215 transition count 544
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 214 transition count 544
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 214 transition count 544
Applied a total of 3 rules in 13 ms. Remains 214 /215 variables (removed 1) and now considering 544/545 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 214/215 places, 544/545 transitions.
// Phase 1: matrix 544 rows 214 cols
[2023-03-12 21:10:54] [INFO ] Computed 21 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 23899 resets, run finished after 1205 ms. (steps per millisecond=829 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 10070 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties (out of 1) seen :0
[2023-03-12 21:10:56] [INFO ] Invariant cache hit.
[2023-03-12 21:10:56] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 21:10:56] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-12 21:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:56] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-12 21:10:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 21:10:56] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-12 21:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:56] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2023-03-12 21:10:57] [INFO ] Computed and/alt/rep : 91/510/91 causal constraints (skipped 439 transitions) in 40 ms.
[2023-03-12 21:10:57] [INFO ] Added : 12 causal constraints over 3 iterations in 242 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 544/544 transitions.
Applied a total of 0 rules in 7 ms. Remains 214 /214 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 214/214 places, 544/544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 544/544 transitions.
Applied a total of 0 rules in 7 ms. Remains 214 /214 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2023-03-12 21:10:57] [INFO ] Invariant cache hit.
[2023-03-12 21:10:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-12 21:10:57] [INFO ] Invariant cache hit.
[2023-03-12 21:10:57] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-12 21:10:57] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 21:10:57] [INFO ] Invariant cache hit.
[2023-03-12 21:10:58] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 793 ms. Remains : 214/214 places, 544/544 transitions.
Ending property specific reduction for ASLink-PT-02a-UpperBounds-11 in 4557 ms.
Starting property specific reduction for ASLink-PT-02a-UpperBounds-14
// Phase 1: matrix 545 rows 215 cols
[2023-03-12 21:10:58] [INFO ] Computed 21 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 227 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-12 21:10:58] [INFO ] Invariant cache hit.
[2023-03-12 21:10:58] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-12 21:10:58] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-12 21:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:58] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-12 21:10:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:10:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 21:10:58] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-12 21:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:10:58] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2023-03-12 21:10:58] [INFO ] Computed and/alt/rep : 92/512/92 causal constraints (skipped 439 transitions) in 32 ms.
[2023-03-12 21:10:59] [INFO ] Added : 15 causal constraints over 3 iterations in 199 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 545/545 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 214 transition count 544
Applied a total of 2 rules in 11 ms. Remains 214 /215 variables (removed 1) and now considering 544/545 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 214/215 places, 544/545 transitions.
// Phase 1: matrix 544 rows 214 cols
[2023-03-12 21:10:59] [INFO ] Computed 21 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 23823 resets, run finished after 1246 ms. (steps per millisecond=802 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10055 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 1) seen :0
[2023-03-12 21:11:01] [INFO ] Invariant cache hit.
[2023-03-12 21:11:01] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 21:11:01] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 15 ms returned sat
[2023-03-12 21:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:11:01] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-12 21:11:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:11:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-12 21:11:01] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-12 21:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:11:01] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-12 21:11:01] [INFO ] Computed and/alt/rep : 91/511/91 causal constraints (skipped 439 transitions) in 39 ms.
[2023-03-12 21:11:01] [INFO ] Added : 15 causal constraints over 3 iterations in 245 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 544/544 transitions.
Applied a total of 0 rules in 5 ms. Remains 214 /214 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 214/214 places, 544/544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 544/544 transitions.
Applied a total of 0 rules in 5 ms. Remains 214 /214 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2023-03-12 21:11:02] [INFO ] Invariant cache hit.
[2023-03-12 21:11:02] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-12 21:11:02] [INFO ] Invariant cache hit.
[2023-03-12 21:11:02] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2023-03-12 21:11:02] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-12 21:11:02] [INFO ] Invariant cache hit.
[2023-03-12 21:11:03] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 990 ms. Remains : 214/214 places, 544/544 transitions.
Ending property specific reduction for ASLink-PT-02a-UpperBounds-14 in 4968 ms.
[2023-03-12 21:11:03] [INFO ] Flatten gal took : 98 ms
[2023-03-12 21:11:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 21:11:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 215 places, 545 transitions and 2223 arcs took 2 ms.
Total runtime 68393 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: ASLink_PT_02a
(NrP: 215 NrTr: 545 NrArc: 2223)

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

net check time: 0m 0.000sec

init dd package: 0m 2.817sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6590268 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16099240 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.002sec

2822 2905 3037 2595 3086 2679 3114 3046 2965 3197 2574 3234 3324 3249 3255 2830 3371 3149 3386 3272 3185 3415 2795 3526 3295 3498 3501 3049 3550 3486 3583 3589 3434 3688 2994 3710 3930 3621 3777 3275 3811 3623 3856 3957 3359 4025 3092 3966 3781 3879 4126 3452 4154 4086 4185 4270 3570 4297 3654 4315 4029 4165 4430 3556 4426 4449 4454 4453 3806 4484 4349 4619 4322 4404 4609 3775 4644 4270 4698 4728 4022 4731 4611 4777 4692 4547 4870 3937 4917 5055 4821 5053 4243 5006 4556 5040 5158 4811 5213 4121 5246 4776 5073 5337 4428 5355 5325 5381 5470 4549 5485 4608 5520 4981 5366 5543 4532 5659 5574 5648 5649 4795 5684 5551 5819 5284 5612 5782 4753 5838 5265 5811 5905 5001 5957 5736 5977 5819 5745 6065

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="ASLink-PT-02a"
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 ASLink-PT-02a, 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 r010-oct2-167813598500029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;