Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701500016.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ASLink-PT-03a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701500016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.5K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 07:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 357K May 10 09:33 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-03a-UpperBounds-00
FORMULA_NAME ASLink-PT-03a-UpperBounds-01
FORMULA_NAME ASLink-PT-03a-UpperBounds-02
FORMULA_NAME ASLink-PT-03a-UpperBounds-03
FORMULA_NAME ASLink-PT-03a-UpperBounds-04
FORMULA_NAME ASLink-PT-03a-UpperBounds-05
FORMULA_NAME ASLink-PT-03a-UpperBounds-06
FORMULA_NAME ASLink-PT-03a-UpperBounds-07
FORMULA_NAME ASLink-PT-03a-UpperBounds-08
FORMULA_NAME ASLink-PT-03a-UpperBounds-09
FORMULA_NAME ASLink-PT-03a-UpperBounds-10
FORMULA_NAME ASLink-PT-03a-UpperBounds-11
FORMULA_NAME ASLink-PT-03a-UpperBounds-12
FORMULA_NAME ASLink-PT-03a-UpperBounds-13
FORMULA_NAME ASLink-PT-03a-UpperBounds-14
FORMULA_NAME ASLink-PT-03a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652727396151

Running Version 0
[2022-05-16 18:56:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 18:56:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:56:38] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2022-05-16 18:56:38] [INFO ] Transformed 821 places.
[2022-05-16 18:56:38] [INFO ] Transformed 1281 transitions.
[2022-05-16 18:56:38] [INFO ] Found NUPN structural information;
[2022-05-16 18:56:38] [INFO ] Parsed PT model containing 821 places and 1281 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
// Phase 1: matrix 1268 rows 821 cols
[2022-05-16 18:56:38] [INFO ] Computed 156 place invariants in 198 ms
Incomplete random walk after 10000 steps, including 84 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 16) seen :12
FORMULA ASLink-PT-03a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
// Phase 1: matrix 1268 rows 821 cols
[2022-05-16 18:56:38] [INFO ] Computed 156 place invariants in 53 ms
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 33 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2022-05-16 18:56:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 24 ms returned sat
[2022-05-16 18:56:40] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 397 ms returned sat
[2022-05-16 18:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:43] [INFO ] [Nat]Absence check using state equation in 2937 ms returned sat
[2022-05-16 18:56:44] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 4 ms to minimize.
[2022-05-16 18:56:46] [INFO ] Deduced a trap composed of 5 places in 1072 ms of which 2 ms to minimize.
[2022-05-16 18:56:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:56:46] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2022-05-16 18:56:46] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 37 ms returned sat
[2022-05-16 18:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:46] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2022-05-16 18:56:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2022-05-16 18:56:47] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 32 ms returned sat
[2022-05-16 18:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:48] [INFO ] [Nat]Absence check using state equation in 1933 ms returned sat
[2022-05-16 18:56:49] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 95 ms.
[2022-05-16 18:56:51] [INFO ] Added : 25 causal constraints over 5 iterations in 2844 ms. Result :unknown
[2022-05-16 18:56:52] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-16 18:56:52] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 28 ms returned sat
[2022-05-16 18:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:52] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2022-05-16 18:56:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-16 18:56:52] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 29 ms returned sat
[2022-05-16 18:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:57] [INFO ] [Nat]Absence check using state equation in 4801 ms returned unknown
[2022-05-16 18:56:57] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-16 18:56:57] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 35 ms returned sat
[2022-05-16 18:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:58] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2022-05-16 18:56:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-16 18:56:58] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 30 ms returned sat
[2022-05-16 18:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:03] [INFO ] [Nat]Absence check using state equation in 4769 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 118700 steps, including 2123 resets, run finished after 452 ms. (steps per millisecond=262 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 821 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 803 transition count 1198
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 158 place count 733 transition count 1198
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 158 place count 733 transition count 1129
Deduced a syphon composed of 69 places in 17 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 323 place count 637 transition count 1129
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 637 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 325 place count 636 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 331 place count 630 transition count 1099
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 338 place count 629 transition count 1099
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 344 place count 628 transition count 1094
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 347 place count 625 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 624 transition count 1086
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 624 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 350 place count 623 transition count 1078
Iterating global reduction 6 with 1 rules applied. Total rules applied 351 place count 623 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 352 place count 622 transition count 1070
Iterating global reduction 6 with 1 rules applied. Total rules applied 353 place count 622 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 621 transition count 1062
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 621 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 620 transition count 1054
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 620 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 619 transition count 1046
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 619 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 618 transition count 1038
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 618 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 617 transition count 1030
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 617 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 616 transition count 1022
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 616 transition count 1022
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 615 transition count 1014
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 615 transition count 1014
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 614 transition count 1006
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 614 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 613 transition count 998
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 613 transition count 998
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 612 transition count 990
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 612 transition count 990
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 374 place count 611 transition count 982
Iterating global reduction 6 with 1 rules applied. Total rules applied 375 place count 611 transition count 982
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 376 place count 610 transition count 974
Iterating global reduction 6 with 1 rules applied. Total rules applied 377 place count 610 transition count 974
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 378 place count 609 transition count 966
Iterating global reduction 6 with 1 rules applied. Total rules applied 379 place count 609 transition count 966
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 421 place count 588 transition count 945
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 423 place count 588 transition count 943
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 425 place count 586 transition count 943
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 429 place count 586 transition count 943
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 430 place count 585 transition count 942
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 436 place count 579 transition count 942
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 436 place count 579 transition count 930
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 25 rules applied. Total rules applied 461 place count 566 transition count 930
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 465 place count 562 transition count 930
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 465 place count 562 transition count 929
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 467 place count 561 transition count 929
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 475 place count 557 transition count 925
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 478 place count 554 transition count 922
Iterating global reduction 9 with 3 rules applied. Total rules applied 481 place count 554 transition count 922
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 484 place count 554 transition count 919
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 487 place count 551 transition count 919
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 490 place count 551 transition count 919
Applied a total of 490 rules in 1511 ms. Remains 551 /821 variables (removed 270) and now considering 919/1268 (removed 349) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/821 places, 919/1268 transitions.
// Phase 1: matrix 919 rows 551 cols
[2022-05-16 18:57:05] [INFO ] Computed 98 place invariants in 92 ms
Incomplete random walk after 1000000 steps, including 13896 resets, run finished after 2479 ms. (steps per millisecond=403 ) properties (out of 4) seen :3
FORMULA ASLink-PT-03a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3845 resets, run finished after 1288 ms. (steps per millisecond=776 ) properties (out of 1) seen :0
// Phase 1: matrix 919 rows 551 cols
[2022-05-16 18:57:09] [INFO ] Computed 98 place invariants in 29 ms
[2022-05-16 18:57:09] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-16 18:57:09] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 27 ms returned sat
[2022-05-16 18:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:10] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2022-05-16 18:57:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-16 18:57:10] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 16 ms returned sat
[2022-05-16 18:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:10] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-05-16 18:57:10] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 108 ms.
[2022-05-16 18:57:17] [INFO ] Added : 20 causal constraints over 4 iterations in 7111 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 161200 steps, including 3005 resets, run finished after 477 ms. (steps per millisecond=337 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 22 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/551 places, 919/919 transitions.
// Phase 1: matrix 919 rows 551 cols
[2022-05-16 18:57:18] [INFO ] Computed 98 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 14202 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3901 resets, run finished after 898 ms. (steps per millisecond=1113 ) properties (out of 1) seen :0
// Phase 1: matrix 919 rows 551 cols
[2022-05-16 18:57:21] [INFO ] Computed 98 place invariants in 29 ms
[2022-05-16 18:57:21] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2022-05-16 18:57:21] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 19 ms returned sat
[2022-05-16 18:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:21] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-05-16 18:57:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-16 18:57:21] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 19 ms returned sat
[2022-05-16 18:57:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:22] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2022-05-16 18:57:22] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 105 ms.
[2022-05-16 18:57:29] [INFO ] Added : 20 causal constraints over 4 iterations in 7193 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 161200 steps, including 2965 resets, run finished after 436 ms. (steps per millisecond=369 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 27 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/551 places, 919/919 transitions.
Starting structural reductions, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 58 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
// Phase 1: matrix 919 rows 551 cols
[2022-05-16 18:57:29] [INFO ] Computed 98 place invariants in 26 ms
[2022-05-16 18:57:30] [INFO ] Implicit Places using invariants in 788 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 386, 397, 398, 399, 417, 419, 422, 440, 441, 442, 443, 455, 461, 467, 473, 479, 485, 491, 497, 503, 509, 515]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 800 ms to find 46 implicit places.
[2022-05-16 18:57:30] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 919 rows 505 cols
[2022-05-16 18:57:30] [INFO ] Computed 52 place invariants in 9 ms
[2022-05-16 18:57:31] [INFO ] Dead Transitions using invariants and state equation in 374 ms returned []
Starting structural reductions, iteration 1 : 505/551 places, 919/919 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 505 transition count 842
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 428 transition count 842
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 154 place count 428 transition count 823
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 193 place count 408 transition count 823
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 205 place count 404 transition count 815
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 213 place count 396 transition count 815
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 228 place count 381 transition count 800
Iterating global reduction 4 with 15 rules applied. Total rules applied 243 place count 381 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 246 place count 381 transition count 797
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 246 place count 381 transition count 796
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 248 place count 380 transition count 796
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 251 place count 377 transition count 793
Iterating global reduction 5 with 3 rules applied. Total rules applied 254 place count 377 transition count 793
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 255 place count 376 transition count 792
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 376 transition count 792
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 257 place count 375 transition count 791
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 375 transition count 791
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 322 place count 343 transition count 759
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 325 place count 343 transition count 756
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 328 place count 340 transition count 753
Iterating global reduction 6 with 3 rules applied. Total rules applied 331 place count 340 transition count 753
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 334 place count 340 transition count 750
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 340 place count 340 transition count 744
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 347 place count 333 transition count 744
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 357 place count 333 transition count 744
Applied a total of 357 rules in 138 ms. Remains 333 /505 variables (removed 172) and now considering 744/919 (removed 175) transitions.
// Phase 1: matrix 744 rows 333 cols
[2022-05-16 18:57:31] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-16 18:57:31] [INFO ] Implicit Places using invariants in 350 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184, 189, 190, 242, 259, 265, 268, 270]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 352 ms to find 19 implicit places.
Starting structural reductions, iteration 2 : 314/551 places, 744/919 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 305 transition count 735
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 305 transition count 735
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 302 transition count 732
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 302 transition count 732
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 296 transition count 726
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 296 transition count 717
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 287 transition count 717
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 287 transition count 714
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 284 transition count 714
Applied a total of 60 rules in 83 ms. Remains 284 /314 variables (removed 30) and now considering 714/744 (removed 30) transitions.
// Phase 1: matrix 714 rows 284 cols
[2022-05-16 18:57:31] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-16 18:57:32] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 714 rows 284 cols
[2022-05-16 18:57:32] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-16 18:57:32] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 284/551 places, 714/919 transitions.
Successfully produced net in file /tmp/petri1000_11569881215254861552.dot
Successfully produced net in file /tmp/petri1001_5324176159733510845.dot
Successfully produced net in file /tmp/petri1002_5477782257885381648.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
// Phase 1: matrix 711 rows 284 cols
[2022-05-16 18:57:32] [INFO ] Computed 27 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 21465 resets, run finished after 1643 ms. (steps per millisecond=608 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7249 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 1) seen :0
// Phase 1: matrix 711 rows 284 cols
[2022-05-16 18:57:34] [INFO ] Computed 27 place invariants in 16 ms
[2022-05-16 18:57:34] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-16 18:57:34] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-16 18:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:35] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-16 18:57:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-16 18:57:35] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-16 18:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:35] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-05-16 18:57:35] [INFO ] Computed and/alt/rep : 133/676/133 causal constraints (skipped 560 transitions) in 91 ms.
[2022-05-16 18:57:35] [INFO ] Added : 7 causal constraints over 2 iterations in 270 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 44300 steps, including 1392 resets, run finished after 163 ms. (steps per millisecond=271 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA ASLink-PT-03a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652727456509

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-03a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is ASLink-PT-03a, 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-tajo-165245701500016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03a.tgz
mv ASLink-PT-03a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;