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.r006-tajo-165245688700037.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 itstools
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 r006-tajo-165245688700037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 6.9K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.5K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 417K 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-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 1652644639919

Running Version 202205111006
[2022-05-15 19:57:21] [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-15 19:57:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:57:21] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-05-15 19:57:21] [INFO ] Transformed 1242 places.
[2022-05-15 19:57:21] [INFO ] Transformed 1621 transitions.
[2022-05-15 19:57:21] [INFO ] Found NUPN structural information;
[2022-05-15 19:57:21] [INFO ] Parsed PT model containing 1242 places and 1621 transitions in 269 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1621 rows 1242 cols
[2022-05-15 19:57:21] [INFO ] Computed 121 place invariants in 101 ms
Incomplete random walk after 10000 steps, including 38 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :13
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-10 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-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-05 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 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
// Phase 1: matrix 1621 rows 1242 cols
[2022-05-15 19:57:21] [INFO ] Computed 121 place invariants in 54 ms
[2022-05-15 19:57:22] [INFO ] [Real]Absence check using 27 positive place invariants in 28 ms returned sat
[2022-05-15 19:57:22] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 31 ms returned sat
[2022-05-15 19:57:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:23] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2022-05-15 19:57:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:57:23] [INFO ] [Nat]Absence check using 27 positive place invariants in 20 ms returned sat
[2022-05-15 19:57:23] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 27 ms returned sat
[2022-05-15 19:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:24] [INFO ] [Nat]Absence check using state equation in 932 ms returned sat
[2022-05-15 19:57:25] [INFO ] Deduced a trap composed of 139 places in 539 ms of which 5 ms to minimize.
[2022-05-15 19:57:25] [INFO ] Deduced a trap composed of 185 places in 540 ms of which 2 ms to minimize.
[2022-05-15 19:57:28] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3772 ms
[2022-05-15 19:57:28] [INFO ] [Real]Absence check using 27 positive place invariants in 26 ms returned sat
[2022-05-15 19:57:28] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 34 ms returned sat
[2022-05-15 19:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:29] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2022-05-15 19:57:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:57:29] [INFO ] [Nat]Absence check using 27 positive place invariants in 25 ms returned sat
[2022-05-15 19:57:29] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 34 ms returned sat
[2022-05-15 19:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:30] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2022-05-15 19:57:30] [INFO ] Deduced a trap composed of 28 places in 584 ms of which 2 ms to minimize.
[2022-05-15 19:57:31] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 2 ms to minimize.
[2022-05-15 19:57:31] [INFO ] Deduced a trap composed of 78 places in 281 ms of which 0 ms to minimize.
[2022-05-15 19:57:31] [INFO ] Deduced a trap composed of 73 places in 294 ms of which 1 ms to minimize.
[2022-05-15 19:57:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1757 ms
[2022-05-15 19:57:32] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 172 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-15 19:57:34] [INFO ] Deduced a trap composed of 12 places in 586 ms of which 1 ms to minimize.
[2022-05-15 19:57:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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: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)
[2022-05-15 19:57:35] [INFO ] [Real]Absence check using 27 positive place invariants in 16 ms returned sat
[2022-05-15 19:57:35] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 24 ms returned sat
[2022-05-15 19:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:35] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2022-05-15 19:57:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:57:35] [INFO ] [Nat]Absence check using 27 positive place invariants in 27 ms returned sat
[2022-05-15 19:57:36] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 34 ms returned sat
[2022-05-15 19:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:37] [INFO ] [Nat]Absence check using state equation in 1955 ms returned sat
[2022-05-15 19:57:38] [INFO ] Deduced a trap composed of 259 places in 488 ms of which 2 ms to minimize.
[2022-05-15 19:57:39] [INFO ] Deduced a trap composed of 171 places in 525 ms of which 2 ms to minimize.
[2022-05-15 19:57:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1267 ms
[2022-05-15 19:57:39] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 151 ms.
[2022-05-15 19:57:40] [INFO ] Added : 5 causal constraints over 1 iterations in 1520 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 579 place count 958 transition count 1326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 580 place count 957 transition count 1326
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 580 place count 957 transition count 1044
Deduced a syphon composed of 282 places in 4 ms
Ensure Unique test removed 23 places
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 4 with 587 rules applied. Total rules applied 1167 place count 652 transition count 1044
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 1185 place count 650 transition count 1028
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1201 place count 634 transition count 1028
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1201 place count 634 transition count 1020
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 6 with 24 rules applied. Total rules applied 1225 place count 618 transition count 1020
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1225 place count 618 transition count 1012
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1241 place count 610 transition count 1012
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1279 place count 572 transition count 974
Iterating global reduction 6 with 38 rules applied. Total rules applied 1317 place count 572 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1318 place count 572 transition count 973
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1318 place count 572 transition count 959
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 7 with 29 rules applied. Total rules applied 1347 place count 557 transition count 959
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1347 place count 557 transition count 958
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1350 place count 555 transition count 958
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1353 place count 552 transition count 937
Iterating global reduction 7 with 3 rules applied. Total rules applied 1356 place count 552 transition count 937
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1356 place count 552 transition count 935
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1360 place count 550 transition count 935
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1361 place count 549 transition count 927
Iterating global reduction 7 with 1 rules applied. Total rules applied 1362 place count 549 transition count 927
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1363 place count 548 transition count 919
Iterating global reduction 7 with 1 rules applied. Total rules applied 1364 place count 548 transition count 919
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1365 place count 547 transition count 911
Iterating global reduction 7 with 1 rules applied. Total rules applied 1366 place count 547 transition count 911
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1367 place count 546 transition count 903
Iterating global reduction 7 with 1 rules applied. Total rules applied 1368 place count 546 transition count 903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1369 place count 545 transition count 895
Iterating global reduction 7 with 1 rules applied. Total rules applied 1370 place count 545 transition count 895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1371 place count 544 transition count 887
Iterating global reduction 7 with 1 rules applied. Total rules applied 1372 place count 544 transition count 887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1373 place count 543 transition count 879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1374 place count 543 transition count 879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1375 place count 542 transition count 871
Iterating global reduction 7 with 1 rules applied. Total rules applied 1376 place count 542 transition count 871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1377 place count 541 transition count 863
Iterating global reduction 7 with 1 rules applied. Total rules applied 1378 place count 541 transition count 863
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1379 place count 540 transition count 855
Iterating global reduction 7 with 1 rules applied. Total rules applied 1380 place count 540 transition count 855
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1381 place count 539 transition count 847
Iterating global reduction 7 with 1 rules applied. Total rules applied 1382 place count 539 transition count 847
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1383 place count 538 transition count 839
Iterating global reduction 7 with 1 rules applied. Total rules applied 1384 place count 538 transition count 839
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1385 place count 537 transition count 831
Iterating global reduction 7 with 1 rules applied. Total rules applied 1386 place count 537 transition count 831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1387 place count 536 transition count 823
Iterating global reduction 7 with 1 rules applied. Total rules applied 1388 place count 536 transition count 823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1389 place count 535 transition count 815
Iterating global reduction 7 with 1 rules applied. Total rules applied 1390 place count 535 transition count 815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1391 place count 534 transition count 807
Iterating global reduction 7 with 1 rules applied. Total rules applied 1392 place count 534 transition count 807
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 7 with 132 rules applied. Total rules applied 1524 place count 468 transition count 741
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1525 place count 467 transition count 740
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 1527 place count 466 transition count 740
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1528 place count 465 transition count 739
Iterating global reduction 7 with 1 rules applied. Total rules applied 1529 place count 465 transition count 739
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 7 with 2 rules applied. Total rules applied 1531 place count 465 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1532 place count 464 transition count 737
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 9 with 2 rules applied. Total rules applied 1534 place count 463 transition count 746
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1537 place count 463 transition count 743
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1540 place count 460 transition count 743
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1541 place count 460 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1542 place count 459 transition count 742
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1543 place count 458 transition count 741
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 11 with 6 rules applied. Total rules applied 1549 place count 454 transition count 739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1551 place count 452 transition count 739
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1551 place count 452 transition count 733
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1564 place count 445 transition count 733
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1567 place count 442 transition count 733
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1567 place count 442 transition count 732
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1569 place count 441 transition count 732
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1579 place count 436 transition count 727
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1581 place count 434 transition count 725
Iterating global reduction 14 with 2 rules applied. Total rules applied 1583 place count 434 transition count 725
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 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 14 with 2 rules applied. Total rules applied 1587 place count 432 transition count 723
Applied a total of 1587 rules in 834 ms. Remains 432 /1242 variables (removed 810) and now considering 723/1621 (removed 898) transitions.
Finished structural reductions, in 1 iterations. Remains : 432/1242 places, 723/1621 transitions.
// Phase 1: matrix 723 rows 432 cols
[2022-05-15 19:57:42] [INFO ] Computed 77 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 16173 resets, run finished after 1561 ms. (steps per millisecond=640 ) properties (out of 3) seen :2
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5535 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 432 cols
[2022-05-15 19:57:44] [INFO ] Computed 77 place invariants in 15 ms
[2022-05-15 19:57:44] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2022-05-15 19:57:44] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 24 ms returned sat
[2022-05-15 19:57:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:44] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-05-15 19:57:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:57:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2022-05-15 19:57:45] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 23 ms returned sat
[2022-05-15 19:57:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:45] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-15 19:57:45] [INFO ] Computed and/alt/rep : 275/1073/275 causal constraints (skipped 431 transitions) in 54 ms.
[2022-05-15 19:57:47] [INFO ] Added : 151 causal constraints over 31 iterations in 1857 ms. Result :sat
Minimization took 212 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 SAFETY mode, iteration 0 : 432/432 places, 723/723 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 722
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 431 transition count 720
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 429 transition count 720
Applied a total of 6 rules in 33 ms. Remains 429 /432 variables (removed 3) and now considering 720/723 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/432 places, 720/723 transitions.
// Phase 1: matrix 720 rows 429 cols
[2022-05-15 19:57:47] [INFO ] Computed 77 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 16336 resets, run finished after 1514 ms. (steps per millisecond=660 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5521 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :0
// Phase 1: matrix 720 rows 429 cols
[2022-05-15 19:57:49] [INFO ] Computed 77 place invariants in 14 ms
[2022-05-15 19:57:49] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-05-15 19:57:49] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 14 ms returned sat
[2022-05-15 19:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:50] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-05-15 19:57:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:57:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-15 19:57:50] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 14 ms returned sat
[2022-05-15 19:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:50] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-05-15 19:57:50] [INFO ] Computed and/alt/rep : 272/1069/272 causal constraints (skipped 431 transitions) in 50 ms.
[2022-05-15 19:57:52] [INFO ] Added : 187 causal constraints over 38 iterations in 1753 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 429 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 429/429 places, 720/720 transitions.
Applied a total of 0 rules in 15 ms. Remains 429 /429 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 720/720 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 429/429 places, 720/720 transitions.
Applied a total of 0 rules in 36 ms. Remains 429 /429 variables (removed 0) and now considering 720/720 (removed 0) transitions.
// Phase 1: matrix 720 rows 429 cols
[2022-05-15 19:57:52] [INFO ] Computed 77 place invariants in 5 ms
[2022-05-15 19:57:52] [INFO ] Implicit Places using invariants in 312 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 263, 274, 275, 276, 294, 296, 300, 318, 319, 320, 321, 333, 339, 345, 351, 357, 363, 369, 375, 381, 387, 393]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 317 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 391/429 places, 720/720 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 391 transition count 658
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 329 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 328 transition count 655
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 128 place count 328 transition count 640
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 159 place count 312 transition count 640
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 171 place count 308 transition count 632
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 179 place count 300 transition count 632
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 194 place count 285 transition count 617
Iterating global reduction 5 with 15 rules applied. Total rules applied 209 place count 285 transition count 617
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 212 place count 285 transition count 614
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 212 place count 285 transition count 613
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 214 place count 284 transition count 613
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 217 place count 281 transition count 607
Iterating global reduction 6 with 3 rules applied. Total rules applied 220 place count 281 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 221 place count 280 transition count 606
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 280 transition count 606
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 279 transition count 604
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 279 transition count 604
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 6 with 42 rules applied. Total rules applied 266 place count 258 transition count 583
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 268 place count 256 transition count 581
Iterating global reduction 6 with 2 rules applied. Total rules applied 270 place count 256 transition count 581
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 272 place count 256 transition count 579
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 7 with 4 rules applied. Total rules applied 276 place count 254 transition count 580
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 281 place count 254 transition count 575
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 287 place count 248 transition count 575
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 293 place count 248 transition count 575
Applied a total of 293 rules in 127 ms. Remains 248 /391 variables (removed 143) and now considering 575/720 (removed 145) transitions.
// Phase 1: matrix 575 rows 248 cols
[2022-05-15 19:57:53] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-15 19:57:53] [INFO ] Implicit Places using invariants in 146 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 149 ms to find 12 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 236/429 places, 575/720 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 230 transition count 569
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 230 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 228 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 228 transition count 567
Performed 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 224 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 224 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 218 transition count 557
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 218 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 216 transition count 555
Applied a total of 40 rules in 59 ms. Remains 216 /236 variables (removed 20) and now considering 555/575 (removed 20) transitions.
// Phase 1: matrix 555 rows 216 cols
[2022-05-15 19:57:53] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 19:57:53] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 555 rows 216 cols
[2022-05-15 19:57:53] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-15 19:57:53] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 216/429 places, 555/720 transitions.
Finished structural reductions, in 3 iterations. Remains : 216/429 places, 555/720 transitions.
Successfully produced net in file /tmp/petri1000_4053885377093407607.dot
Successfully produced net in file /tmp/petri1001_3004933853736505727.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 553 rows 216 cols
[2022-05-15 19:57:53] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 25336 resets, run finished after 1417 ms. (steps per millisecond=705 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9652 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
// Phase 1: matrix 553 rows 216 cols
[2022-05-15 19:57:56] [INFO ] Computed 21 place invariants in 11 ms
[2022-05-15 19:57:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 19:57:56] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 5 ms returned sat
[2022-05-15 19:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:56] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-05-15 19:57:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:57:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 19:57:56] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 4 ms returned sat
[2022-05-15 19:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:56] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2022-05-15 19:57:56] [INFO ] Computed and/alt/rep : 95/561/95 causal constraints (skipped 441 transitions) in 64 ms.
[2022-05-15 19:57:57] [INFO ] Added : 28 causal constraints over 9 iterations in 415 ms. Result :sat
Minimization took 103 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 SAFETY mode, iteration 0 : 216/216 places, 553/553 transitions.
Graph (complete) has 1361 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 214 transition count 553
Applied a total of 3 rules in 28 ms. Remains 214 /216 variables (removed 2) and now considering 553/553 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/216 places, 553/553 transitions.
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:57:57] [INFO ] Computed 21 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 25521 resets, run finished after 1561 ms. (steps per millisecond=640 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9646 resets, run finished after 583 ms. (steps per millisecond=1715 ) properties (out of 1) seen :0
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:57:59] [INFO ] Computed 21 place invariants in 13 ms
[2022-05-15 19:57:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-15 19:57:59] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-15 19:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:59] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-15 19:57:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:57:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-15 19:57:59] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 6 ms returned sat
[2022-05-15 19:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:59] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-05-15 19:57:59] [INFO ] Computed and/alt/rep : 95/559/95 causal constraints (skipped 441 transitions) in 33 ms.
[2022-05-15 19:58:00] [INFO ] Added : 15 causal constraints over 4 iterations in 240 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 21 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 11 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:00] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-15 19:58:00] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:00] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-15 19:58:00] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2022-05-15 19:58:00] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:00] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-15 19:58:01] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-07
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:01] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 255 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:01] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-15 19:58:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-15 19:58:01] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 5 ms returned sat
[2022-05-15 19:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:58:01] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-05-15 19:58:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:58:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-05-15 19:58:01] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 6 ms returned sat
[2022-05-15 19:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:58:01] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-15 19:58:01] [INFO ] Computed and/alt/rep : 95/559/95 causal constraints (skipped 441 transitions) in 39 ms.
[2022-05-15 19:58:01] [INFO ] Added : 15 causal constraints over 4 iterations in 289 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 10 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:02] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 25571 resets, run finished after 1358 ms. (steps per millisecond=736 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9739 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 1) seen :0
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:04] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-15 19:58:04] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-05-15 19:58:04] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 5 ms returned sat
[2022-05-15 19:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:58:04] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-05-15 19:58:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:58:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-15 19:58:04] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 6 ms returned sat
[2022-05-15 19:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:58:04] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-05-15 19:58:04] [INFO ] Computed and/alt/rep : 95/559/95 causal constraints (skipped 441 transitions) in 29 ms.
[2022-05-15 19:58:04] [INFO ] Added : 15 causal constraints over 4 iterations in 272 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 10 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 8 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:04] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-15 19:58:05] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:05] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-15 19:58:05] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2022-05-15 19:58:05] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 553 rows 214 cols
[2022-05-15 19:58:05] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-15 19:58:05] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-07 in 4712 ms.
[2022-05-15 19:58:06] [INFO ] Flatten gal took : 102 ms
[2022-05-15 19:58:06] [INFO ] Applying decomposition
[2022-05-15 19:58:06] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1855654823824132767.txt' '-o' '/tmp/graph1855654823824132767.bin' '-w' '/tmp/graph1855654823824132767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1855654823824132767.bin' '-l' '-1' '-v' '-w' '/tmp/graph1855654823824132767.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:58:06] [INFO ] Decomposing Gal with order
[2022-05-15 19:58:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:58:06] [INFO ] Removed a total of 1170 redundant transitions.
[2022-05-15 19:58:06] [INFO ] Flatten gal took : 91 ms
[2022-05-15 19:58:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 9 ms.
[2022-05-15 19:58:06] [INFO ] Time to serialize gal into /tmp/UpperBounds14971079450354004660.gal : 6 ms
[2022-05-15 19:58:06] [INFO ] Time to serialize properties into /tmp/UpperBounds5834938980680496321.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14971079450354004660.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5834938980680496321.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds5834938980680496321.prop.
Detected timeout of ITS tools.
[2022-05-15 20:18:20] [INFO ] Applying decomposition
[2022-05-15 20:18:20] [INFO ] Flatten gal took : 56 ms
[2022-05-15 20:18:20] [INFO ] Decomposing Gal with order
[2022-05-15 20:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:18:21] [INFO ] Removed a total of 1026 redundant transitions.
[2022-05-15 20:18:21] [INFO ] Flatten gal took : 88 ms
[2022-05-15 20:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 15 ms.
[2022-05-15 20:18:21] [INFO ] Time to serialize gal into /tmp/UpperBounds582105975661754399.gal : 3 ms
[2022-05-15 20:18:21] [INFO ] Time to serialize properties into /tmp/UpperBounds17971095040662103488.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds582105975661754399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17971095040662103488.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds17971095040662103488.prop.
Detected timeout of ITS tools.
[2022-05-15 20:38:35] [INFO ] Flatten gal took : 58 ms
[2022-05-15 20:38:35] [INFO ] Input system was already deterministic with 553 transitions.
[2022-05-15 20:38:35] [INFO ] Transformed 214 places.
[2022-05-15 20:38:35] [INFO ] Transformed 553 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 20:38:35] [INFO ] Time to serialize gal into /tmp/UpperBounds2819228587941270152.gal : 5 ms
[2022-05-15 20:38:35] [INFO ] Time to serialize properties into /tmp/UpperBounds9750060905949578899.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2819228587941270152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9750060905949578899.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9750060905949578899.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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 itstools"
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 r006-tajo-165245688700037"
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 ;