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.r007-oct2-167813594900037.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 lolaxred
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 r007-oct2-167813594900037
=====================================================================

--------------------
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 1678334494831

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 04:01:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 04:01:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:01:37] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-09 04:01:37] [INFO ] Transformed 1242 places.
[2023-03-09 04:01:37] [INFO ] Transformed 1621 transitions.
[2023-03-09 04:01:37] [INFO ] Found NUPN structural information;
[2023-03-09 04:01:37] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 1621 rows 1242 cols
[2023-03-09 04:01:37] [INFO ] Computed 121 place invariants in 81 ms
Incomplete random walk after 10000 steps, including 36 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :14
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-09 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-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-03 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
FORMULA ASLink-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
[2023-03-09 04:01:37] [INFO ] Invariant cache hit.
[2023-03-09 04:01:37] [INFO ] [Real]Absence check using 27 positive place invariants in 29 ms returned sat
[2023-03-09 04:01:37] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 46 ms returned sat
[2023-03-09 04:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:01:38] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2023-03-09 04:01:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:01:39] [INFO ] [Nat]Absence check using 27 positive place invariants in 21 ms returned sat
[2023-03-09 04:01:39] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 30 ms returned sat
[2023-03-09 04:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:01:43] [INFO ] [Nat]Absence check using state equation in 4126 ms returned sat
[2023-03-09 04:01:44] [INFO ] Deduced a trap composed of 163 places in 695 ms of which 5 ms to minimize.
[2023-03-09 04:01:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-09 04:01:44] [INFO ] [Real]Absence check using 27 positive place invariants in 19 ms returned sat
[2023-03-09 04:01:44] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 54 ms returned sat
[2023-03-09 04:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:01:45] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2023-03-09 04:01:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:01:46] [INFO ] [Nat]Absence check using 27 positive place invariants in 28 ms returned sat
[2023-03-09 04:01:46] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 37 ms returned sat
[2023-03-09 04:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:01:50] [INFO ] [Nat]Absence check using state equation in 4717 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 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 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 578 place count 958 transition count 1043
Deduced a syphon composed of 284 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 591 rules applied. Total rules applied 1169 place count 651 transition count 1043
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 20 rules applied. Total rules applied 1189 place count 648 transition count 1026
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1206 place count 631 transition count 1026
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1206 place count 631 transition count 1018
Deduced a syphon composed of 8 places in 4 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 1230 place count 615 transition count 1018
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1230 place count 615 transition count 1010
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 1246 place count 607 transition count 1010
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1284 place count 569 transition count 972
Iterating global reduction 5 with 38 rules applied. Total rules applied 1322 place count 569 transition count 972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1323 place count 569 transition count 971
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1323 place count 569 transition count 957
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 1352 place count 554 transition count 957
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1352 place count 554 transition count 956
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 1355 place count 552 transition count 956
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1358 place count 549 transition count 935
Iterating global reduction 6 with 3 rules applied. Total rules applied 1361 place count 549 transition count 935
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1361 place count 549 transition count 933
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1365 place count 547 transition count 933
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1366 place count 546 transition count 925
Iterating global reduction 6 with 1 rules applied. Total rules applied 1367 place count 546 transition count 925
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1368 place count 545 transition count 917
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 545 transition count 917
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1370 place count 544 transition count 909
Iterating global reduction 6 with 1 rules applied. Total rules applied 1371 place count 544 transition count 909
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1372 place count 543 transition count 901
Iterating global reduction 6 with 1 rules applied. Total rules applied 1373 place count 543 transition count 901
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1374 place count 542 transition count 893
Iterating global reduction 6 with 1 rules applied. Total rules applied 1375 place count 542 transition count 893
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1376 place count 541 transition count 885
Iterating global reduction 6 with 1 rules applied. Total rules applied 1377 place count 541 transition count 885
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1378 place count 540 transition count 877
Iterating global reduction 6 with 1 rules applied. Total rules applied 1379 place count 540 transition count 877
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1380 place count 539 transition count 869
Iterating global reduction 6 with 1 rules applied. Total rules applied 1381 place count 539 transition count 869
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1382 place count 538 transition count 861
Iterating global reduction 6 with 1 rules applied. Total rules applied 1383 place count 538 transition count 861
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1384 place count 537 transition count 853
Iterating global reduction 6 with 1 rules applied. Total rules applied 1385 place count 537 transition count 853
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1386 place count 536 transition count 845
Iterating global reduction 6 with 1 rules applied. Total rules applied 1387 place count 536 transition count 845
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1388 place count 535 transition count 837
Iterating global reduction 6 with 1 rules applied. Total rules applied 1389 place count 535 transition count 837
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1390 place count 534 transition count 829
Iterating global reduction 6 with 1 rules applied. Total rules applied 1391 place count 534 transition count 829
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1392 place count 533 transition count 821
Iterating global reduction 6 with 1 rules applied. Total rules applied 1393 place count 533 transition count 821
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1394 place count 532 transition count 813
Iterating global reduction 6 with 1 rules applied. Total rules applied 1395 place count 532 transition count 813
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1396 place count 531 transition count 805
Iterating global reduction 6 with 1 rules applied. Total rules applied 1397 place count 531 transition count 805
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 1527 place count 466 transition count 740
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1528 place count 465 transition count 739
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1530 place count 464 transition count 739
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1531 place count 463 transition count 738
Iterating global reduction 6 with 1 rules applied. Total rules applied 1532 place count 463 transition count 738
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 1534 place count 463 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1535 place count 462 transition count 736
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 461 transition count 745
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1540 place count 461 transition count 742
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1543 place count 458 transition count 742
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1544 place count 458 transition count 741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1545 place count 457 transition count 741
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1546 place count 456 transition count 740
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 1552 place count 452 transition count 738
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1554 place count 450 transition count 738
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 1554 place count 450 transition count 732
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 1566 place count 444 transition count 732
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 12 with 3 rules applied. Total rules applied 1569 place count 441 transition count 732
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1569 place count 441 transition count 731
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 1571 place count 440 transition count 731
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 13 with 8 rules applied. Total rules applied 1579 place count 436 transition count 727
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1581 place count 434 transition count 725
Iterating global reduction 13 with 2 rules applied. Total rules applied 1583 place count 434 transition count 725
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1585 place count 434 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1587 place count 432 transition count 723
Applied a total of 1587 rules in 791 ms. Remains 432 /1242 variables (removed 810) and now considering 723/1621 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 791 ms. Remains : 432/1242 places, 723/1621 transitions.
// Phase 1: matrix 723 rows 432 cols
[2023-03-09 04:01:51] [INFO ] Computed 77 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 16104 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 2) seen :1
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5589 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 1) seen :0
[2023-03-09 04:01:54] [INFO ] Invariant cache hit.
[2023-03-09 04:01:54] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-09 04:01:54] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 51 ms returned sat
[2023-03-09 04:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:01:54] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-09 04:01:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:01:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-09 04:01:55] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 15 ms returned sat
[2023-03-09 04:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:01:55] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-09 04:01:55] [INFO ] Computed and/alt/rep : 283/1151/283 causal constraints (skipped 423 transitions) in 87 ms.
[2023-03-09 04:01:57] [INFO ] Added : 106 causal constraints over 22 iterations in 1518 ms. Result :sat
Minimization took 223 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 723/723 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 432 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 431 transition count 722
Applied a total of 2 rules in 31 ms. Remains 431 /432 variables (removed 1) and now considering 722/723 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 431/432 places, 722/723 transitions.
// Phase 1: matrix 722 rows 431 cols
[2023-03-09 04:01:57] [INFO ] Computed 77 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 16200 resets, run finished after 1774 ms. (steps per millisecond=563 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5525 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 1) seen :0
[2023-03-09 04:02:00] [INFO ] Invariant cache hit.
[2023-03-09 04:02:00] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-09 04:02:00] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 69 ms returned sat
[2023-03-09 04:02:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:01] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-09 04:02:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:02:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-09 04:02:01] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 72 ms returned sat
[2023-03-09 04:02:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:02] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2023-03-09 04:02:02] [INFO ] Computed and/alt/rep : 274/1071/274 causal constraints (skipped 431 transitions) in 51 ms.
[2023-03-09 04:02:04] [INFO ] Added : 180 causal constraints over 36 iterations in 2193 ms. Result :sat
Minimization took 206 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 722/722 transitions.
Applied a total of 0 rules in 12 ms. Remains 431 /431 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 431/431 places, 722/722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 722/722 transitions.
Applied a total of 0 rules in 10 ms. Remains 431 /431 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-09 04:02:04] [INFO ] Invariant cache hit.
[2023-03-09 04:02:05] [INFO ] Implicit Places using invariants in 412 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 150, 151, 153, 170, 188, 257, 261, 262, 265, 276, 277, 278, 296, 298, 302, 320, 321, 322, 323, 335, 341, 347, 353, 359, 365, 371, 377, 383, 389, 395]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 415 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 393/431 places, 722/722 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 393 transition count 658
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 130 place count 329 transition count 656
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 130 place count 329 transition count 641
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 161 place count 313 transition count 641
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 173 place count 309 transition count 633
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 301 transition count 633
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 196 place count 286 transition count 618
Iterating global reduction 4 with 15 rules applied. Total rules applied 211 place count 286 transition count 618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 286 transition count 615
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 214 place count 286 transition count 614
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 216 place count 285 transition count 614
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 282 transition count 608
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 282 transition count 608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 281 transition count 607
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 281 transition count 607
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 225 place count 280 transition count 605
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 280 transition count 605
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 268 place count 259 transition count 584
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 270 place count 257 transition count 582
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 257 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 274 place count 257 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 278 place count 255 transition count 581
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 282 place count 255 transition count 577
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 287 place count 250 transition count 577
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 293 place count 250 transition count 577
Applied a total of 293 rules in 65 ms. Remains 250 /393 variables (removed 143) and now considering 577/722 (removed 145) transitions.
// Phase 1: matrix 577 rows 250 cols
[2023-03-09 04:02:05] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-09 04:02:05] [INFO ] Implicit Places using invariants in 197 ms returned [72, 89, 95, 98, 100, 105, 106, 158, 175, 181, 184, 186]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 200 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 238/431 places, 577/722 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 232 transition count 571
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 232 transition count 571
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 230 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 230 transition count 569
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 0 with 8 rules applied. Total rules applied 24 place count 226 transition count 565
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 226 transition count 559
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 220 transition count 559
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 220 transition count 557
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 218 transition count 557
Applied a total of 40 rules in 33 ms. Remains 218 /238 variables (removed 20) and now considering 557/577 (removed 20) transitions.
// Phase 1: matrix 557 rows 218 cols
[2023-03-09 04:02:05] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-09 04:02:05] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-09 04:02:05] [INFO ] Invariant cache hit.
[2023-03-09 04:02:06] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/431 places, 557/722 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1359 ms. Remains : 218/431 places, 557/722 transitions.
Successfully produced net in file /tmp/petri1000_4993305066205951091.dot
Successfully produced net in file /tmp/petri1001_13260323277188320144.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 555 rows 218 cols
[2023-03-09 04:02:06] [INFO ] Computed 21 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 25458 resets, run finished after 1312 ms. (steps per millisecond=762 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9630 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 1) seen :0
[2023-03-09 04:02:08] [INFO ] Invariant cache hit.
[2023-03-09 04:02:08] [INFO ] [Real]Absence check using 7 positive place invariants in 23 ms returned sat
[2023-03-09 04:02:08] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-09 04:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:08] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-09 04:02:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:02:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 04:02:08] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 14 ms returned sat
[2023-03-09 04:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:08] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-09 04:02:08] [INFO ] Computed and/alt/rep : 97/563/97 causal constraints (skipped 441 transitions) in 52 ms.
[2023-03-09 04:02:09] [INFO ] Added : 46 causal constraints over 10 iterations in 544 ms. Result :sat
Minimization took 104 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 33 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 33 ms. Remains : 216/218 places, 555/555 transitions.
// Phase 1: matrix 555 rows 216 cols
[2023-03-09 04:02:09] [INFO ] Computed 21 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 25516 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9560 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 1) seen :0
[2023-03-09 04:02:11] [INFO ] Invariant cache hit.
[2023-03-09 04:02:11] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2023-03-09 04:02:11] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 15 ms returned sat
[2023-03-09 04:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:12] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2023-03-09 04:02:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:02:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 59 ms returned sat
[2023-03-09 04:02:12] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-09 04:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:13] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2023-03-09 04:02:13] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 54 ms.
[2023-03-09 04:02:13] [INFO ] Added : 28 causal constraints over 7 iterations in 433 ms. Result :sat
Minimization took 105 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 6 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-09 04:02:13] [INFO ] Invariant cache hit.
[2023-03-09 04:02:14] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-09 04:02:14] [INFO ] Invariant cache hit.
[2023-03-09 04:02:14] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2023-03-09 04:02:14] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-09 04:02:14] [INFO ] Invariant cache hit.
[2023-03-09 04:02:14] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1148 ms. Remains : 216/216 places, 555/555 transitions.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-10
[2023-03-09 04:02:14] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-09 04:02:14] [INFO ] Invariant cache hit.
[2023-03-09 04:02:15] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2023-03-09 04:02:15] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-09 04:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:15] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-09 04:02:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:02:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 04:02:15] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 17 ms returned sat
[2023-03-09 04:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:16] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2023-03-09 04:02:16] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 45 ms.
[2023-03-09 04:02:16] [INFO ] Added : 28 causal constraints over 7 iterations in 322 ms. Result :sat
Minimization took 87 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 10 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 10 ms. Remains : 216/216 places, 555/555 transitions.
[2023-03-09 04:02:16] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 25531 resets, run finished after 1517 ms. (steps per millisecond=659 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9674 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 1) seen :0
[2023-03-09 04:02:19] [INFO ] Invariant cache hit.
[2023-03-09 04:02:19] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2023-03-09 04:02:19] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 17 ms returned sat
[2023-03-09 04:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:19] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-09 04:02:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:02:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 04:02:19] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-09 04:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:19] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-09 04:02:19] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 64 ms.
[2023-03-09 04:02:20] [INFO ] Added : 28 causal constraints over 7 iterations in 522 ms. Result :sat
Minimization took 105 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-09 04:02:20] [INFO ] Invariant cache hit.
[2023-03-09 04:02:21] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-09 04:02:21] [INFO ] Invariant cache hit.
[2023-03-09 04:02:22] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2023-03-09 04:02:22] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-09 04:02:22] [INFO ] Invariant cache hit.
[2023-03-09 04:02:22] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2212 ms. Remains : 216/216 places, 555/555 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-10 in 7880 ms.
[2023-03-09 04:02:23] [INFO ] Flatten gal took : 121 ms
[2023-03-09 04:02:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 04:02:23] [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 46267 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-02b
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
Upper Bounds

FORMULA ASLink-PT-02b-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678334543474

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 ASLink-PT-02b-UpperBounds-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ASLink-PT-02b-UpperBounds-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ASLink-PT-02b-UpperBounds-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for ASLink-PT-02b-UpperBounds-10
lola: markings : 108
lola: fired transitions : 107
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ASLink-PT-02b-UpperBounds-10 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ASLink-PT-02b-UpperBounds-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-02b-UpperBounds-10: BOUND 1 state space


Time elapsed: 0 secs. Pages in use: 1

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="lolaxred"
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 lolaxred"
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 r007-oct2-167813594900037"
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 '' 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 ;