About the Execution of Marcie+red for ASLink-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9293.132 | 3600000.00 | 3679948.00 | 133.50 | 1 1 1 1 1 1 1 1 1 1 ? 1 1 1 1 1 | normal |
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-167813598500037.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-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598500037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.4K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:12 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:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 12K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 417K 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-02b-UpperBounds-00
FORMULA_NAME ASLink-PT-02b-UpperBounds-01
FORMULA_NAME ASLink-PT-02b-UpperBounds-02
FORMULA_NAME ASLink-PT-02b-UpperBounds-03
FORMULA_NAME ASLink-PT-02b-UpperBounds-04
FORMULA_NAME ASLink-PT-02b-UpperBounds-05
FORMULA_NAME ASLink-PT-02b-UpperBounds-06
FORMULA_NAME ASLink-PT-02b-UpperBounds-07
FORMULA_NAME ASLink-PT-02b-UpperBounds-08
FORMULA_NAME ASLink-PT-02b-UpperBounds-09
FORMULA_NAME ASLink-PT-02b-UpperBounds-10
FORMULA_NAME ASLink-PT-02b-UpperBounds-11
FORMULA_NAME ASLink-PT-02b-UpperBounds-12
FORMULA_NAME ASLink-PT-02b-UpperBounds-13
FORMULA_NAME ASLink-PT-02b-UpperBounds-14
FORMULA_NAME ASLink-PT-02b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678655531909
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-02b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 21:12:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 21:12:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:12:15] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-12 21:12:15] [INFO ] Transformed 1242 places.
[2023-03-12 21:12:15] [INFO ] Transformed 1621 transitions.
[2023-03-12 21:12:15] [INFO ] Found NUPN structural information;
[2023-03-12 21:12:15] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1621 rows 1242 cols
[2023-03-12 21:12:15] [INFO ] Computed 121 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 38 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :9
FORMULA ASLink-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :2
FORMULA ASLink-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 21:12:15] [INFO ] Invariant cache hit.
[2023-03-12 21:12:16] [INFO ] [Real]Absence check using 27 positive place invariants in 26 ms returned sat
[2023-03-12 21:12:16] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 57 ms returned sat
[2023-03-12 21:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:16] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2023-03-12 21:12:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:12:17] [INFO ] [Nat]Absence check using 27 positive place invariants in 22 ms returned sat
[2023-03-12 21:12:17] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 28 ms returned sat
[2023-03-12 21:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:21] [INFO ] [Nat]Absence check using state equation in 3968 ms returned sat
[2023-03-12 21:12:22] [INFO ] Deduced a trap composed of 26 places in 512 ms of which 4 ms to minimize.
[2023-03-12 21:12:22] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 658 ms
[2023-03-12 21:12:22] [INFO ] [Real]Absence check using 27 positive place invariants in 33 ms returned sat
[2023-03-12 21:12:22] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 68 ms returned sat
[2023-03-12 21:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:23] [INFO ] [Real]Absence check using state equation in 898 ms returned sat
[2023-03-12 21:12:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:12:23] [INFO ] [Nat]Absence check using 27 positive place invariants in 34 ms returned sat
[2023-03-12 21:12:23] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 42 ms returned sat
[2023-03-12 21:12:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:25] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2023-03-12 21:12:25] [INFO ] Deduced a trap composed of 42 places in 609 ms of which 6 ms to minimize.
[2023-03-12 21:12:26] [INFO ] Deduced a trap composed of 144 places in 529 ms of which 1 ms to minimize.
[2023-03-12 21:12:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2208 ms
[2023-03-12 21:12:27] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 122 ms.
[2023-03-12 21:12:28] [INFO ] Added : 30 causal constraints over 6 iterations in 975 ms. Result :unknown
[2023-03-12 21:12:28] [INFO ] [Real]Absence check using 27 positive place invariants in 18 ms returned sat
[2023-03-12 21:12:28] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 84 ms returned sat
[2023-03-12 21:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:29] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2023-03-12 21:12:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:12:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 33 ms returned sat
[2023-03-12 21:12:30] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 34 ms returned sat
[2023-03-12 21:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:33] [INFO ] [Nat]Absence check using state equation in 3313 ms returned sat
[2023-03-12 21:12:34] [INFO ] Deduced a trap composed of 31 places in 785 ms of which 26 ms to minimize.
[2023-03-12 21:12:35] [INFO ] Deduced a trap composed of 110 places in 683 ms of which 17 ms to minimize.
[2023-03-12 21:12:35] [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.verifyPossible(DeadlockTester.java:916)
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:12:35] [INFO ] [Real]Absence check using 27 positive place invariants in 31 ms returned sat
[2023-03-12 21:12:35] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 30 ms returned sat
[2023-03-12 21:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:36] [INFO ] [Real]Absence check using state equation in 969 ms returned sat
[2023-03-12 21:12:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:12:36] [INFO ] [Nat]Absence check using 27 positive place invariants in 134 ms returned sat
[2023-03-12 21:12:36] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 45 ms returned sat
[2023-03-12 21:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:40] [INFO ] [Nat]Absence check using state equation in 3970 ms returned sat
[2023-03-12 21:12:41] [INFO ] Deduced a trap composed of 163 places in 439 ms of which 1 ms to minimize.
[2023-03-12 21:12:41] [INFO ] Deduced a trap composed of 221 places in 516 ms of which 1 ms to minimize.
[2023-03-12 21:12:41] [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 3
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.verifyPossible(DeadlockTester.java:916)
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:12:42] [INFO ] [Real]Absence check using 27 positive place invariants in 18 ms returned sat
[2023-03-12 21:12:42] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 50 ms returned sat
[2023-03-12 21:12:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:43] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2023-03-12 21:12:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:12:43] [INFO ] [Nat]Absence check using 27 positive place invariants in 19 ms returned sat
[2023-03-12 21:12:43] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 29 ms returned sat
[2023-03-12 21:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:48] [INFO ] [Nat]Absence check using state equation in 4732 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1242 transition count 1341
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 294 rules applied. Total rules applied 574 place count 962 transition count 1327
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 578 place count 958 transition count 1327
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 578 place count 958 transition count 1045
Deduced a syphon composed of 282 places in 2 ms
Ensure Unique test removed 22 places
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1164 place count 654 transition count 1045
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 20 rules applied. Total rules applied 1184 place count 650 transition count 1029
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1200 place count 634 transition count 1029
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1200 place count 634 transition count 1021
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1224 place count 618 transition count 1021
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1224 place count 618 transition count 1013
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1240 place count 610 transition count 1013
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1278 place count 572 transition count 975
Iterating global reduction 5 with 38 rules applied. Total rules applied 1316 place count 572 transition count 975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1317 place count 572 transition count 974
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1317 place count 572 transition count 960
Deduced a syphon composed of 14 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 29 rules applied. Total rules applied 1346 place count 557 transition count 960
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1346 place count 557 transition count 959
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1349 place count 555 transition count 959
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1351 place count 553 transition count 944
Iterating global reduction 6 with 2 rules applied. Total rules applied 1353 place count 553 transition count 944
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1353 place count 553 transition count 943
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1355 place count 552 transition count 943
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1356 place count 551 transition count 935
Iterating global reduction 6 with 1 rules applied. Total rules applied 1357 place count 551 transition count 935
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1358 place count 550 transition count 927
Iterating global reduction 6 with 1 rules applied. Total rules applied 1359 place count 550 transition count 927
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1360 place count 549 transition count 919
Iterating global reduction 6 with 1 rules applied. Total rules applied 1361 place count 549 transition count 919
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1362 place count 548 transition count 911
Iterating global reduction 6 with 1 rules applied. Total rules applied 1363 place count 548 transition count 911
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1364 place count 547 transition count 903
Iterating global reduction 6 with 1 rules applied. Total rules applied 1365 place count 547 transition count 903
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1366 place count 546 transition count 895
Iterating global reduction 6 with 1 rules applied. Total rules applied 1367 place count 546 transition count 895
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1368 place count 545 transition count 887
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 545 transition count 887
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1370 place count 544 transition count 879
Iterating global reduction 6 with 1 rules applied. Total rules applied 1371 place count 544 transition count 879
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1372 place count 543 transition count 871
Iterating global reduction 6 with 1 rules applied. Total rules applied 1373 place count 543 transition count 871
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1374 place count 542 transition count 863
Iterating global reduction 6 with 1 rules applied. Total rules applied 1375 place count 542 transition count 863
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1376 place count 541 transition count 855
Iterating global reduction 6 with 1 rules applied. Total rules applied 1377 place count 541 transition count 855
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1378 place count 540 transition count 847
Iterating global reduction 6 with 1 rules applied. Total rules applied 1379 place count 540 transition count 847
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1380 place count 539 transition count 839
Iterating global reduction 6 with 1 rules applied. Total rules applied 1381 place count 539 transition count 839
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1382 place count 538 transition count 831
Iterating global reduction 6 with 1 rules applied. Total rules applied 1383 place count 538 transition count 831
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1384 place count 537 transition count 823
Iterating global reduction 6 with 1 rules applied. Total rules applied 1385 place count 537 transition count 823
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1386 place count 536 transition count 815
Iterating global reduction 6 with 1 rules applied. Total rules applied 1387 place count 536 transition count 815
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 1519 place count 470 transition count 749
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1520 place count 469 transition count 748
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1522 place count 468 transition count 748
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1523 place count 467 transition count 747
Iterating global reduction 6 with 1 rules applied. Total rules applied 1524 place count 467 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1526 place count 467 transition count 745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1527 place count 466 transition count 745
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1529 place count 465 transition count 754
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1532 place count 465 transition count 751
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1535 place count 462 transition count 751
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1537 place count 462 transition count 749
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1539 place count 460 transition count 749
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1540 place count 459 transition count 748
Reduce places removed 3 places and 0 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 10 with 4 rules applied. Total rules applied 1544 place count 456 transition count 747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1545 place count 455 transition count 747
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 5 Pre rules applied. Total rules applied 1545 place count 455 transition count 742
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1555 place count 450 transition count 742
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 12 with 3 rules applied. Total rules applied 1558 place count 447 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1558 place count 447 transition count 741
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1560 place count 446 transition count 741
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1568 place count 442 transition count 737
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1570 place count 440 transition count 735
Iterating global reduction 13 with 2 rules applied. Total rules applied 1572 place count 440 transition count 735
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1573 place count 439 transition count 734
Iterating global reduction 13 with 1 rules applied. Total rules applied 1574 place count 439 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1575 place count 439 transition count 733
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1576 place count 439 transition count 732
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1577 place count 438 transition count 732
Applied a total of 1577 rules in 753 ms. Remains 438 /1242 variables (removed 804) and now considering 732/1621 (removed 889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 766 ms. Remains : 438/1242 places, 732/1621 transitions.
// Phase 1: matrix 732 rows 438 cols
[2023-03-12 21:12:49] [INFO ] Computed 78 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 16985 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties (out of 5) seen :1
FORMULA ASLink-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5806 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5886 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 4) seen :2
FORMULA ASLink-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 21:12:53] [INFO ] Invariant cache hit.
[2023-03-12 21:12:53] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-12 21:12:53] [INFO ] [Real]Absence check using 19 positive and 59 generalized place invariants in 14 ms returned sat
[2023-03-12 21:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:53] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2023-03-12 21:12:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:12:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-12 21:12:53] [INFO ] [Nat]Absence check using 19 positive and 59 generalized place invariants in 14 ms returned sat
[2023-03-12 21:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:53] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-12 21:12:53] [INFO ] Computed and/alt/rep : 297/1192/297 causal constraints (skipped 417 transitions) in 96 ms.
[2023-03-12 21:12:55] [INFO ] Added : 105 causal constraints over 21 iterations in 1912 ms. Result :sat
Minimization took 330 ms.
[2023-03-12 21:12:56] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-12 21:12:56] [INFO ] [Real]Absence check using 19 positive and 59 generalized place invariants in 24 ms returned sat
[2023-03-12 21:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:56] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2023-03-12 21:12:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:12:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-12 21:12:56] [INFO ] [Nat]Absence check using 19 positive and 59 generalized place invariants in 18 ms returned sat
[2023-03-12 21:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:12:57] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2023-03-12 21:12:57] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2023-03-12 21:12:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-12 21:12:57] [INFO ] Computed and/alt/rep : 297/1192/297 causal constraints (skipped 417 transitions) in 74 ms.
[2023-03-12 21:12:58] [INFO ] Added : 84 causal constraints over 17 iterations in 1647 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 732/732 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 438 transition count 731
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 436 transition count 731
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 436 transition count 729
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 434 transition count 729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 433 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 433 transition count 723
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 432 transition count 723
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 3 with 4 rules applied. Total rules applied 14 place count 430 transition count 721
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 429 transition count 720
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 429 transition count 720
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 429 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 428 transition count 719
Applied a total of 18 rules in 66 ms. Remains 428 /438 variables (removed 10) and now considering 719/732 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 428/438 places, 719/732 transitions.
// Phase 1: matrix 719 rows 428 cols
[2023-03-12 21:12:59] [INFO ] Computed 76 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 16118 resets, run finished after 1958 ms. (steps per millisecond=510 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5614 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5582 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 2) seen :0
[2023-03-12 21:13:03] [INFO ] Invariant cache hit.
[2023-03-12 21:13:03] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-12 21:13:03] [INFO ] [Real]Absence check using 19 positive and 57 generalized place invariants in 19 ms returned sat
[2023-03-12 21:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:03] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-12 21:13:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:13:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-12 21:13:04] [INFO ] [Nat]Absence check using 19 positive and 57 generalized place invariants in 28 ms returned sat
[2023-03-12 21:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:04] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-12 21:13:04] [INFO ] Computed and/alt/rep : 287/1191/287 causal constraints (skipped 415 transitions) in 98 ms.
[2023-03-12 21:13:05] [INFO ] Added : 74 causal constraints over 15 iterations in 1179 ms. Result :sat
Minimization took 216 ms.
[2023-03-12 21:13:05] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-12 21:13:05] [INFO ] [Real]Absence check using 19 positive and 57 generalized place invariants in 15 ms returned sat
[2023-03-12 21:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:06] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2023-03-12 21:13:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:13:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-12 21:13:06] [INFO ] [Nat]Absence check using 19 positive and 57 generalized place invariants in 39 ms returned sat
[2023-03-12 21:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:06] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2023-03-12 21:13:06] [INFO ] Computed and/alt/rep : 287/1191/287 causal constraints (skipped 415 transitions) in 56 ms.
[2023-03-12 21:13:09] [INFO ] Deduced a trap composed of 100 places in 218 ms of which 1 ms to minimize.
[2023-03-12 21:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-12 21:13:10] [INFO ] Added : 178 causal constraints over 36 iterations in 3290 ms. Result :sat
Minimization took 280 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 719/719 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 428 transition count 718
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 427 transition count 718
Applied a total of 2 rules in 19 ms. Remains 427 /428 variables (removed 1) and now considering 718/719 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 427/428 places, 718/719 transitions.
// Phase 1: matrix 718 rows 427 cols
[2023-03-12 21:13:11] [INFO ] Computed 76 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 16242 resets, run finished after 1784 ms. (steps per millisecond=560 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5524 resets, run finished after 847 ms. (steps per millisecond=1180 ) properties (out of 1) seen :0
[2023-03-12 21:13:14] [INFO ] Invariant cache hit.
[2023-03-12 21:13:14] [INFO ] [Real]Absence check using 19 positive place invariants in 106 ms returned sat
[2023-03-12 21:13:14] [INFO ] [Real]Absence check using 19 positive and 57 generalized place invariants in 25 ms returned sat
[2023-03-12 21:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:14] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-12 21:13:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:13:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-12 21:13:14] [INFO ] [Nat]Absence check using 19 positive and 57 generalized place invariants in 18 ms returned sat
[2023-03-12 21:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:15] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-12 21:13:15] [INFO ] Computed and/alt/rep : 278/1111/278 causal constraints (skipped 423 transitions) in 48 ms.
[2023-03-12 21:13:17] [INFO ] Added : 142 causal constraints over 29 iterations in 2032 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 718/718 transitions.
Applied a total of 0 rules in 12 ms. Remains 427 /427 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 427/427 places, 718/718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 718/718 transitions.
Applied a total of 0 rules in 11 ms. Remains 427 /427 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2023-03-12 21:13:17] [INFO ] Invariant cache hit.
[2023-03-12 21:13:18] [INFO ] Implicit Places using invariants in 679 ms returned [1, 18, 19, 31, 48, 66, 85, 135, 146, 147, 149, 166, 184, 253, 257, 258, 261, 272, 273, 274, 292, 294, 298, 316, 317, 318, 319, 331, 337, 343, 349, 355, 361, 367, 373, 379, 385, 391]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 698 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 389/427 places, 718/718 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 389 transition count 656
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 126 place count 327 transition count 654
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 126 place count 327 transition count 639
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 157 place count 311 transition count 639
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 2 with 12 rules applied. Total rules applied 169 place count 307 transition count 631
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 177 place count 299 transition count 631
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 192 place count 284 transition count 616
Iterating global reduction 4 with 15 rules applied. Total rules applied 207 place count 284 transition count 616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 210 place count 284 transition count 613
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 210 place count 284 transition count 612
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 212 place count 283 transition count 612
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 215 place count 280 transition count 606
Iterating global reduction 5 with 3 rules applied. Total rules applied 218 place count 280 transition count 606
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 219 place count 279 transition count 605
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 279 transition count 605
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 221 place count 278 transition count 603
Iterating global reduction 5 with 1 rules applied. Total rules applied 222 place count 278 transition count 603
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 266 place count 256 transition count 581
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 267 place count 255 transition count 580
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 255 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 269 place count 255 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 273 place count 253 transition count 580
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 278 place count 253 transition count 575
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 284 place count 247 transition count 575
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 290 place count 247 transition count 575
Applied a total of 290 rules in 90 ms. Remains 247 /389 variables (removed 142) and now considering 575/718 (removed 143) transitions.
// Phase 1: matrix 575 rows 247 cols
[2023-03-12 21:13:18] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-12 21:13:18] [INFO ] Implicit Places using invariants in 194 ms returned [86, 92, 95, 97, 102, 103, 155, 172, 178, 181, 183]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 196 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 236/427 places, 575/718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 230 transition count 569
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 230 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 228 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 228 transition count 567
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 225 transition count 564
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 225 transition count 558
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 219 transition count 558
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 219 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 218 transition count 557
Applied a total of 36 rules in 40 ms. Remains 218 /236 variables (removed 18) and now considering 557/575 (removed 18) transitions.
// Phase 1: matrix 557 rows 218 cols
[2023-03-12 21:13:18] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-12 21:13:18] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-12 21:13:18] [INFO ] Invariant cache hit.
[2023-03-12 21:13:19] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/427 places, 557/718 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1728 ms. Remains : 218/427 places, 557/718 transitions.
Successfully produced net in file /tmp/petri1000_3381419691154692769.dot
Successfully produced net in file /tmp/petri1001_5348991980944824084.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 555 rows 218 cols
[2023-03-12 21:13:19] [INFO ] Computed 21 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 25558 resets, run finished after 1436 ms. (steps per millisecond=696 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9667 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 1) seen :0
[2023-03-12 21:13:21] [INFO ] Invariant cache hit.
[2023-03-12 21:13:21] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-12 21:13:21] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-12 21:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:21] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-12 21:13:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:13:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 21:13:22] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 10 ms returned sat
[2023-03-12 21:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:22] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2023-03-12 21:13:22] [INFO ] Computed and/alt/rep : 97/563/97 causal constraints (skipped 441 transitions) in 48 ms.
[2023-03-12 21:13:22] [INFO ] Added : 30 causal constraints over 7 iterations in 550 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 555/555 transitions.
Graph (complete) has 1363 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 216 transition count 555
Applied a total of 3 rules in 20 ms. Remains 216 /218 variables (removed 2) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 216/218 places, 555/555 transitions.
// Phase 1: matrix 555 rows 216 cols
[2023-03-12 21:13:23] [INFO ] Computed 21 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 25647 resets, run finished after 1470 ms. (steps per millisecond=680 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9653 resets, run finished after 753 ms. (steps per millisecond=1328 ) properties (out of 1) seen :0
[2023-03-12 21:13:25] [INFO ] Invariant cache hit.
[2023-03-12 21:13:25] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-12 21:13:25] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-12 21:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:25] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-12 21:13:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:13:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 21:13:25] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-12 21:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:26] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-12 21:13:26] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 58 ms.
[2023-03-12 21:13:26] [INFO ] Added : 17 causal constraints over 4 iterations in 457 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 216/216 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-12 21:13:26] [INFO ] Invariant cache hit.
[2023-03-12 21:13:27] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-12 21:13:27] [INFO ] Invariant cache hit.
[2023-03-12 21:13:27] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-12 21:13:27] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-12 21:13:27] [INFO ] Invariant cache hit.
[2023-03-12 21:13:28] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1278 ms. Remains : 216/216 places, 555/555 transitions.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-10
[2023-03-12 21:13:28] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 259 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-12 21:13:28] [INFO ] Invariant cache hit.
[2023-03-12 21:13:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 21:13:28] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-12 21:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:28] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-12 21:13:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:13:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 21:13:28] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-12 21:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:29] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2023-03-12 21:13:29] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 50 ms.
[2023-03-12 21:13:29] [INFO ] Added : 17 causal constraints over 4 iterations in 465 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 216/216 places, 555/555 transitions.
[2023-03-12 21:13:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 25431 resets, run finished after 1521 ms. (steps per millisecond=657 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9593 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 1) seen :0
[2023-03-12 21:13:32] [INFO ] Invariant cache hit.
[2023-03-12 21:13:32] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 21:13:32] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-12 21:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:32] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-12 21:13:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:13:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 21:13:32] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-12 21:13:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:13:33] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-12 21:13:33] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 48 ms.
[2023-03-12 21:13:33] [INFO ] Added : 17 causal constraints over 4 iterations in 337 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 216/216 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 5 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-12 21:13:33] [INFO ] Invariant cache hit.
[2023-03-12 21:13:33] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-12 21:13:33] [INFO ] Invariant cache hit.
[2023-03-12 21:13:34] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-12 21:13:34] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 21:13:34] [INFO ] Invariant cache hit.
[2023-03-12 21:13:34] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 216/216 places, 555/555 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-10 in 6562 ms.
[2023-03-12 21:13:35] [INFO ] Flatten gal took : 107 ms
[2023-03-12 21:13:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 21:13:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 216 places, 555 transitions and 2272 arcs took 3 ms.
Total runtime 80217 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_02b
(NrP: 216 NrTr: 555 NrArc: 2272)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.011sec
net check time: 0m 0.000sec
init dd package: 0m 3.161sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6855948 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102380 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
3943 2918 2859 3206 3143 3367 2786 3170 3213 3300 2597 3015 3270 3381 3266 2935 3409 3463 3362 2833 3365 3523 3588 3413 3126 3638 3581 3466 3022 3547 3618 3657 3252 3395 3711 3832 3585 3285 3837 3876 3902 3126 3741 3968 4025 3901 3436 4049 4015 3904 3322 4004 4060 4089 3997 3572 4157 4249 4308 3594 4188 4306 4342 3935 4136 4394 4457 4515 3791 4445 4428 4344 3660 4385 4496 4521 4506 3835 4589 4687 4349 3851 4565 4738 4774 4167 4501 4822 4889 4936 4134 4873 4860 4854 3883 4761 4934 4964 5005 4269 5000 5114 4929 4166 4937 5170 5219 4624 4399 5252 5285 4805 4363 5250 5381 5311 4745 5141 5370 5408 5076 4618 5404 5446 5550 4467 5313 5602 5644 5013 4760 5663 5717 5252 4665 5634 5814 5747 5711 4957 5804
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-02b"
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-02b, 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-167813598500037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b 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 '
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 ;