Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r013-tall-174853743000042.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is ASLink-PT-04a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 436K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748540241131

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:37:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 17:37:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:22] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2025-05-29 17:37:22] [INFO ] Transformed 1016 places.
[2025-05-29 17:37:22] [INFO ] Transformed 1554 transitions.
[2025-05-29 17:37:22] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:22] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1538 rows 1016 cols
[2025-05-29 17:37:22] [INFO ] Computed 194 invariants in 92 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (66 resets) in 67 ms. (147 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (52 resets) in 81 ms. (487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:37:23] [INFO ] Invariant cache hit.
[2025-05-29 17:37:23] [INFO ] [Real]Absence check using 46 positive place invariants in 36 ms returned sat
[2025-05-29 17:37:23] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 37 ms returned sat
[2025-05-29 17:37:23] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2025-05-29 17:37:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:24] [INFO ] [Nat]Absence check using 46 positive place invariants in 29 ms returned sat
[2025-05-29 17:37:24] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 34 ms returned sat
[2025-05-29 17:37:24] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2025-05-29 17:37:24] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 101 ms.
[2025-05-29 17:37:29] [INFO ] Added : 255 causal constraints over 51 iterations in 4168 ms. Result :unknown
[2025-05-29 17:37:29] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2025-05-29 17:37:29] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 35 ms returned sat
[2025-05-29 17:37:29] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2025-05-29 17:37:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:29] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2025-05-29 17:37:29] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 32 ms returned sat
[2025-05-29 17:37:30] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2025-05-29 17:37:30] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 109 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 17:37:34] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2025-05-29 17:37:34] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 54 ms returned sat
[2025-05-29 17:37:35] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2025-05-29 17:37:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:35] [INFO ] [Nat]Absence check using 46 positive place invariants in 21 ms returned sat
[2025-05-29 17:37:35] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 40 ms returned sat
[2025-05-29 17:37:36] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2025-05-29 17:37:36] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 16 ms to minimize.
[2025-05-29 17:37:36] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 5 ms to minimize.
[2025-05-29 17:37:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
[2025-05-29 17:37:37] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 83 ms.
[2025-05-29 17:37:40] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:37:40] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2025-05-29 17:37:40] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 36 ms returned sat
[2025-05-29 17:37:41] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2025-05-29 17:37:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:41] [INFO ] [Nat]Absence check using 46 positive place invariants in 25 ms returned sat
[2025-05-29 17:37:41] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 40 ms returned sat
[2025-05-29 17:37:42] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2025-05-29 17:37:42] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 90 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 992 transition count 1449
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 202 place count 903 transition count 1449
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 202 place count 903 transition count 1360
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 35 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 415 place count 779 transition count 1360
Drop transitions (Trivial Post-Agglo cleanup.) 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 416 place count 779 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 417 place count 778 transition count 1359
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 424 place count 771 transition count 1324
Ensure Unique test removed 1 places
Iterating global reduction 4 with 8 rules applied. Total rules applied 432 place count 770 transition count 1324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 437 place count 769 transition count 1320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 439 place count 767 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 440 place count 766 transition count 1312
Iterating global reduction 6 with 1 rules applied. Total rules applied 441 place count 766 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 442 place count 765 transition count 1304
Iterating global reduction 6 with 1 rules applied. Total rules applied 443 place count 765 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 444 place count 764 transition count 1296
Iterating global reduction 6 with 1 rules applied. Total rules applied 445 place count 764 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 446 place count 763 transition count 1288
Iterating global reduction 6 with 1 rules applied. Total rules applied 447 place count 763 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 448 place count 762 transition count 1280
Iterating global reduction 6 with 1 rules applied. Total rules applied 449 place count 762 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 450 place count 761 transition count 1272
Iterating global reduction 6 with 1 rules applied. Total rules applied 451 place count 761 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 452 place count 760 transition count 1264
Iterating global reduction 6 with 1 rules applied. Total rules applied 453 place count 760 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 454 place count 759 transition count 1256
Iterating global reduction 6 with 1 rules applied. Total rules applied 455 place count 759 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 456 place count 758 transition count 1248
Iterating global reduction 6 with 1 rules applied. Total rules applied 457 place count 758 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 458 place count 757 transition count 1240
Iterating global reduction 6 with 1 rules applied. Total rules applied 459 place count 757 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 460 place count 756 transition count 1232
Iterating global reduction 6 with 1 rules applied. Total rules applied 461 place count 756 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 462 place count 755 transition count 1224
Iterating global reduction 6 with 1 rules applied. Total rules applied 463 place count 755 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 464 place count 754 transition count 1216
Iterating global reduction 6 with 1 rules applied. Total rules applied 465 place count 754 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 466 place count 753 transition count 1208
Iterating global reduction 6 with 1 rules applied. Total rules applied 467 place count 753 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 468 place count 752 transition count 1200
Iterating global reduction 6 with 1 rules applied. Total rules applied 469 place count 752 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 470 place count 751 transition count 1192
Iterating global reduction 6 with 1 rules applied. Total rules applied 471 place count 751 transition count 1192
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 527 place count 723 transition count 1164
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 530 place count 723 transition count 1161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 533 place count 720 transition count 1161
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 538 place count 720 transition count 1161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 539 place count 719 transition count 1160
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 547 place count 711 transition count 1160
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 547 place count 711 transition count 1144
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 33 rules applied. Total rules applied 580 place count 694 transition count 1144
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 8 with 5 rules applied. Total rules applied 585 place count 689 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 585 place count 689 transition count 1143
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 587 place count 688 transition count 1143
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 595 place count 684 transition count 1139
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 598 place count 681 transition count 1136
Iterating global reduction 9 with 3 rules applied. Total rules applied 601 place count 681 transition count 1136
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 605 place count 681 transition count 1132
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 609 place count 677 transition count 1132
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 613 place count 677 transition count 1132
Applied a total of 613 rules in 1071 ms. Remains 677 /1016 variables (removed 339) and now considering 1132/1538 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1081 ms. Remains : 677/1016 places, 1132/1538 transitions.
// Phase 1: matrix 1132 rows 677 cols
[2025-05-29 17:37:48] [INFO ] Computed 119 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-04a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (12751 resets) in 2193 ms. (455 steps per ms)
BEST_FIRST walk for 3000003 steps (8827 resets) in 3002 ms. (999 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:37:53] [INFO ] Invariant cache hit.
[2025-05-29 17:37:53] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:37:53] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 18 ms returned sat
[2025-05-29 17:37:53] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2025-05-29 17:37:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 16 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-05-29 17:37:54] [INFO ] Computed and/alt/rep : 440/1700/440 causal constraints (skipped 667 transitions) in 94 ms.
[2025-05-29 17:37:58] [INFO ] Added : 295 causal constraints over 59 iterations in 3620 ms. Result :sat
Minimization took 744 ms.
[2025-05-29 17:37:59] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2025-05-29 17:37:59] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 18 ms returned sat
[2025-05-29 17:37:59] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2025-05-29 17:37:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:59] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:37:59] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 17 ms returned sat
[2025-05-29 17:37:59] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-05-29 17:37:59] [INFO ] Computed and/alt/rep : 440/1700/440 causal constraints (skipped 667 transitions) in 60 ms.
[2025-05-29 17:38:03] [INFO ] Added : 289 causal constraints over 58 iterations in 3677 ms. Result :sat
Minimization took 616 ms.
[2025-05-29 17:38:04] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 22 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2025-05-29 17:38:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:04] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 17 ms returned sat
[2025-05-29 17:38:05] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-05-29 17:38:05] [INFO ] Computed and/alt/rep : 440/1700/440 causal constraints (skipped 667 transitions) in 69 ms.
[2025-05-29 17:38:09] [INFO ] Added : 319 causal constraints over 64 iterations in 4799 ms. Result :sat
Minimization took 812 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1132/1132 transitions.
Applied a total of 0 rules in 20 ms. Remains 677 /677 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 677/677 places, 1132/1132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1132/1132 transitions.
Applied a total of 0 rules in 19 ms. Remains 677 /677 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2025-05-29 17:38:11] [INFO ] Invariant cache hit.
[2025-05-29 17:38:12] [INFO ] Implicit Places using invariants in 465 ms returned [0, 19, 20, 31, 49, 67, 136, 140, 149, 150, 151, 169, 187, 258, 262, 263, 274, 275, 276, 294, 312, 381, 385, 386, 397, 398, 399, 417, 435, 504, 508, 509, 512, 523, 524, 525, 543, 545, 548, 566, 567, 568, 569, 581, 587, 593, 599, 605, 611, 617, 623, 629, 635, 641]
[2025-05-29 17:38:12] [INFO ] Actually due to overlaps returned [543, 525, 151, 31, 49, 169, 276, 294, 399, 417, 548, 150, 275, 398, 524, 567, 149, 274, 397, 523, 545, 566, 0, 262, 263, 385, 386, 508, 509, 19, 20, 67, 187, 312, 435, 569, 611, 629, 641, 512, 568, 581, 587, 593, 599, 605, 617, 623, 635]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 469 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 628/677 places, 1132/1132 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 624 transition count 1041
Reduce places removed 91 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 92 rules applied. Total rules applied 187 place count 533 transition count 1040
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 532 transition count 1040
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 188 place count 532 transition count 1017
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 235 place count 508 transition count 1017
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 247 place count 504 transition count 1009
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 255 place count 496 transition count 1009
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 271 place count 480 transition count 993
Iterating global reduction 5 with 16 rules applied. Total rules applied 287 place count 480 transition count 993
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 291 place count 480 transition count 989
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 291 place count 480 transition count 988
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 293 place count 479 transition count 988
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 296 place count 476 transition count 985
Iterating global reduction 6 with 3 rules applied. Total rules applied 299 place count 476 transition count 985
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 300 place count 475 transition count 984
Iterating global reduction 6 with 1 rules applied. Total rules applied 301 place count 475 transition count 984
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 302 place count 474 transition count 983
Iterating global reduction 6 with 1 rules applied. Total rules applied 303 place count 474 transition count 983
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 379 place count 436 transition count 945
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 382 place count 436 transition count 942
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 385 place count 433 transition count 939
Iterating global reduction 7 with 3 rules applied. Total rules applied 388 place count 433 transition count 939
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 391 place count 433 transition count 936
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 401 place count 433 transition count 926
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 412 place count 422 transition count 926
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 413 place count 422 transition count 925
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 426 place count 422 transition count 925
Applied a total of 426 rules in 298 ms. Remains 422 /628 variables (removed 206) and now considering 925/1132 (removed 207) transitions.
// Phase 1: matrix 925 rows 422 cols
[2025-05-29 17:38:12] [INFO ] Computed 60 invariants in 11 ms
[2025-05-29 17:38:12] [INFO ] Implicit Places using invariants in 275 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 158, 175, 181, 184, 186, 192, 193, 245, 262, 268, 271, 273, 278, 279, 331, 348, 354, 357, 359]
[2025-05-29 17:38:12] [INFO ] Actually due to overlaps returned [105, 192, 278, 106, 193, 279, 90, 96, 101, 102, 175, 181, 186, 262, 268, 273, 348, 354, 359, 73, 158, 245, 331]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 278 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 399/677 places, 925/1132 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 383 transition count 909
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 383 transition count 909
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 379 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 379 transition count 905
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 371 transition count 897
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 371 transition count 885
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 359 transition count 885
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 359 transition count 881
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 355 transition count 881
Applied a total of 88 rules in 55 ms. Remains 355 /399 variables (removed 44) and now considering 881/925 (removed 44) transitions.
// Phase 1: matrix 881 rows 355 cols
[2025-05-29 17:38:12] [INFO ] Computed 37 invariants in 12 ms
[2025-05-29 17:38:12] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-05-29 17:38:12] [INFO ] Invariant cache hit.
[2025-05-29 17:38:13] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 355/677 places, 881/1132 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1915 ms. Remains : 355/677 places, 881/1132 transitions.
[2025-05-29 17:38:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (19513 resets) in 1564 ms. (638 steps per ms)
BEST_FIRST walk for 3000003 steps (17188 resets) in 2073 ms. (1446 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:38:17] [INFO ] Invariant cache hit.
[2025-05-29 17:38:17] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:17] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:17] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-05-29 17:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-29 17:38:17] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 7 ms returned sat
[2025-05-29 17:38:17] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2025-05-29 17:38:17] [INFO ] Computed and/alt/rep : 178/850/178 causal constraints (skipped 681 transitions) in 49 ms.
[2025-05-29 17:38:18] [INFO ] Added : 35 causal constraints over 8 iterations in 473 ms. Result :sat
Minimization took 425 ms.
[2025-05-29 17:38:18] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:18] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:18] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2025-05-29 17:38:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:19] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:19] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-05-29 17:38:19] [INFO ] Computed and/alt/rep : 178/850/178 causal constraints (skipped 681 transitions) in 60 ms.
[2025-05-29 17:38:19] [INFO ] Added : 26 causal constraints over 6 iterations in 428 ms. Result :sat
Minimization took 424 ms.
[2025-05-29 17:38:20] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 10 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2025-05-29 17:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 9 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2025-05-29 17:38:20] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2025-05-29 17:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-05-29 17:38:20] [INFO ] Computed and/alt/rep : 178/850/178 causal constraints (skipped 681 transitions) in 53 ms.
[2025-05-29 17:38:21] [INFO ] Added : 41 causal constraints over 9 iterations in 507 ms. Result :sat
Minimization took 395 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-04a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-29 17:38:22] [INFO ] Flatten gal took : 113 ms
[2025-05-29 17:38:22] [INFO ] Flatten gal took : 69 ms
[2025-05-29 17:38:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3337266682158225680.gal : 28 ms
[2025-05-29 17:38:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12509006817881658102.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3337266682158225680.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12509006817881658102.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 60205 ms.

BK_STOP 1748540302658

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-04a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ASLink-PT-04a, 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 r013-tall-174853743000042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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