Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 279K May 18 16:42 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-02a-UpperBounds-00
FORMULA_NAME ASLink-PT-02a-UpperBounds-01
FORMULA_NAME ASLink-PT-02a-UpperBounds-02
FORMULA_NAME ASLink-PT-02a-UpperBounds-03
FORMULA_NAME ASLink-PT-02a-UpperBounds-04
FORMULA_NAME ASLink-PT-02a-UpperBounds-05
FORMULA_NAME ASLink-PT-02a-UpperBounds-06
FORMULA_NAME ASLink-PT-02a-UpperBounds-07
FORMULA_NAME ASLink-PT-02a-UpperBounds-08
FORMULA_NAME ASLink-PT-02a-UpperBounds-09
FORMULA_NAME ASLink-PT-02a-UpperBounds-10
FORMULA_NAME ASLink-PT-02a-UpperBounds-11
FORMULA_NAME ASLink-PT-02a-UpperBounds-12
FORMULA_NAME ASLink-PT-02a-UpperBounds-13
FORMULA_NAME ASLink-PT-02a-UpperBounds-14
FORMULA_NAME ASLink-PT-02a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716366028244

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 08:20:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 08:20:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:20:32] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2024-05-22 08:20:32] [INFO ] Transformed 626 places.
[2024-05-22 08:20:32] [INFO ] Transformed 1008 transitions.
[2024-05-22 08:20:32] [INFO ] Found NUPN structural information;
[2024-05-22 08:20:32] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
// Phase 1: matrix 998 rows 626 cols
[2024-05-22 08:20:32] [INFO ] Computed 118 invariants in 115 ms
Incomplete random walk after 10000 steps, including 112 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 16) seen :11
FORMULA ASLink-PT-02a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :1
FORMULA ASLink-PT-02a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
[2024-05-22 08:20:32] [INFO ] Invariant cache hit.
[2024-05-22 08:20:33] [INFO ] [Real]Absence check using 28 positive place invariants in 42 ms returned sat
[2024-05-22 08:20:33] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 62 ms returned sat
[2024-05-22 08:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:20:34] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2024-05-22 08:20:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:20:34] [INFO ] [Nat]Absence check using 28 positive place invariants in 39 ms returned sat
[2024-05-22 08:20:34] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 63 ms returned sat
[2024-05-22 08:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:20:35] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2024-05-22 08:20:35] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 117 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2024-05-22 08:20:40] [INFO ] Deduced a trap composed of 5 places in 809 ms of which 7 ms to minimize.
[2024-05-22 08:20:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 08:20:40] [INFO ] [Real]Absence check using 28 positive place invariants in 30 ms returned sat
[2024-05-22 08:20:40] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 53 ms returned sat
[2024-05-22 08:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:20:41] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2024-05-22 08:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:20:41] [INFO ] [Nat]Absence check using 28 positive place invariants in 22 ms returned sat
[2024-05-22 08:20:41] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 38 ms returned sat
[2024-05-22 08:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:20:42] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2024-05-22 08:20:42] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 84 ms.
[2024-05-22 08:20:46] [INFO ] Deduced a trap composed of 5 places in 663 ms of which 3 ms to minimize.
[2024-05-22 08:20:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 08:20:47] [INFO ] [Real]Absence check using 28 positive place invariants in 32 ms returned sat
[2024-05-22 08:20:47] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 56 ms returned sat
[2024-05-22 08:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:20:47] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2024-05-22 08:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:20:48] [INFO ] [Nat]Absence check using 28 positive place invariants in 19 ms returned sat
[2024-05-22 08:20:48] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 34 ms returned sat
[2024-05-22 08:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:20:49] [INFO ] [Nat]Absence check using state equation in 1519 ms returned sat
[2024-05-22 08:20:49] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 81 ms.
[2024-05-22 08:20:52] [INFO ] Added : 40 causal constraints over 8 iterations in 3240 ms. Result :unknown
[2024-05-22 08:20:53] [INFO ] [Real]Absence check using 28 positive place invariants in 19 ms returned sat
[2024-05-22 08:20:53] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 34 ms returned sat
[2024-05-22 08:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:20:53] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2024-05-22 08:20:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:20:53] [INFO ] [Nat]Absence check using 28 positive place invariants in 19 ms returned sat
[2024-05-22 08:20:53] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 34 ms returned sat
[2024-05-22 08:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:20:54] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2024-05-22 08:20:54] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-05-22 08:20:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-05-22 08:20:54] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 88 ms.
[2024-05-22 08:20:58] [INFO ] Added : 25 causal constraints over 5 iterations in 3914 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-02a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 614 transition count 948
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 112 place count 564 transition count 948
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 112 place count 564 transition count 899
Deduced a syphon composed of 49 places in 5 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 229 place count 496 transition count 899
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 496 transition count 898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 495 transition count 898
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 236 place count 490 transition count 875
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 242 place count 489 transition count 875
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 247 place count 488 transition count 871
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 250 place count 486 transition count 870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 485 transition count 870
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 252 place count 484 transition count 862
Iterating global reduction 7 with 1 rules applied. Total rules applied 253 place count 484 transition count 862
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 254 place count 483 transition count 854
Iterating global reduction 7 with 1 rules applied. Total rules applied 255 place count 483 transition count 854
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 256 place count 482 transition count 846
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 482 transition count 846
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 258 place count 481 transition count 838
Iterating global reduction 7 with 1 rules applied. Total rules applied 259 place count 481 transition count 838
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 260 place count 480 transition count 830
Iterating global reduction 7 with 1 rules applied. Total rules applied 261 place count 480 transition count 830
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 262 place count 479 transition count 822
Iterating global reduction 7 with 1 rules applied. Total rules applied 263 place count 479 transition count 822
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 264 place count 478 transition count 814
Iterating global reduction 7 with 1 rules applied. Total rules applied 265 place count 478 transition count 814
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 266 place count 477 transition count 806
Iterating global reduction 7 with 1 rules applied. Total rules applied 267 place count 477 transition count 806
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 268 place count 476 transition count 798
Iterating global reduction 7 with 1 rules applied. Total rules applied 269 place count 476 transition count 798
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 270 place count 475 transition count 790
Iterating global reduction 7 with 1 rules applied. Total rules applied 271 place count 475 transition count 790
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 272 place count 474 transition count 782
Iterating global reduction 7 with 1 rules applied. Total rules applied 273 place count 474 transition count 782
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 274 place count 473 transition count 774
Iterating global reduction 7 with 1 rules applied. Total rules applied 275 place count 473 transition count 774
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 276 place count 472 transition count 766
Iterating global reduction 7 with 1 rules applied. Total rules applied 277 place count 472 transition count 766
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 278 place count 471 transition count 758
Iterating global reduction 7 with 1 rules applied. Total rules applied 279 place count 471 transition count 758
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 280 place count 470 transition count 750
Iterating global reduction 7 with 1 rules applied. Total rules applied 281 place count 470 transition count 750
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 282 place count 469 transition count 742
Iterating global reduction 7 with 1 rules applied. Total rules applied 283 place count 469 transition count 742
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 311 place count 455 transition count 728
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 312 place count 455 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 313 place count 454 transition count 727
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 316 place count 454 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 317 place count 453 transition count 726
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 320 place count 450 transition count 726
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 320 place count 450 transition count 721
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 330 place count 445 transition count 721
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 332 place count 443 transition count 721
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 336 place count 441 transition count 719
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 338 place count 439 transition count 717
Iterating global reduction 10 with 2 rules applied. Total rules applied 340 place count 439 transition count 717
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 342 place count 439 transition count 715
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 344 place count 437 transition count 715
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 346 place count 437 transition count 715
Applied a total of 346 rules in 1005 ms. Remains 437 /626 variables (removed 189) and now considering 715/998 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1005 ms. Remains : 437/626 places, 715/998 transitions.
// Phase 1: matrix 715 rows 437 cols
[2024-05-22 08:21:01] [INFO ] Computed 80 invariants in 21 ms
Incomplete random walk after 1000000 steps, including 16325 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 3) seen :1
FORMULA ASLink-PT-02a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5609 resets, run finished after 934 ms. (steps per millisecond=1070 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5483 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 2) seen :0
[2024-05-22 08:21:05] [INFO ] Invariant cache hit.
[2024-05-22 08:21:05] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-22 08:21:05] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 21 ms returned sat
[2024-05-22 08:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:05] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2024-05-22 08:21:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-05-22 08:21:05] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 32 ms returned sat
[2024-05-22 08:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:06] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2024-05-22 08:21:06] [INFO ] Computed and/alt/rep : 271/1066/271 causal constraints (skipped 427 transitions) in 85 ms.
[2024-05-22 08:21:08] [INFO ] Added : 107 causal constraints over 22 iterations in 1985 ms. Result :sat
Minimization took 362 ms.
[2024-05-22 08:21:08] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-22 08:21:08] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2024-05-22 08:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:09] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2024-05-22 08:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-22 08:21:09] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 35 ms returned sat
[2024-05-22 08:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:09] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-05-22 08:21:10] [INFO ] Computed and/alt/rep : 271/1066/271 causal constraints (skipped 427 transitions) in 85 ms.
[2024-05-22 08:21:12] [INFO ] Added : 151 causal constraints over 31 iterations in 2642 ms. Result :sat
Minimization took 328 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 715/715 transitions.
Applied a total of 0 rules in 30 ms. Remains 437 /437 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 437/437 places, 715/715 transitions.
[2024-05-22 08:21:16] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16318 resets, run finished after 2334 ms. (steps per millisecond=428 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5612 resets, run finished after 1523 ms. (steps per millisecond=656 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5568 resets, run finished after 1485 ms. (steps per millisecond=673 ) properties (out of 2) seen :0
[2024-05-22 08:21:21] [INFO ] Invariant cache hit.
[2024-05-22 08:21:21] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-22 08:21:21] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2024-05-22 08:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:21] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2024-05-22 08:21:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-22 08:21:22] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 34 ms returned sat
[2024-05-22 08:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:22] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2024-05-22 08:21:22] [INFO ] Computed and/alt/rep : 271/1066/271 causal constraints (skipped 427 transitions) in 75 ms.
[2024-05-22 08:21:24] [INFO ] Added : 107 causal constraints over 22 iterations in 1884 ms. Result :sat
Minimization took 359 ms.
[2024-05-22 08:21:25] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-22 08:21:25] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 37 ms returned sat
[2024-05-22 08:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:25] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-05-22 08:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-22 08:21:25] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 32 ms returned sat
[2024-05-22 08:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:26] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-05-22 08:21:26] [INFO ] Computed and/alt/rep : 271/1066/271 causal constraints (skipped 427 transitions) in 70 ms.
[2024-05-22 08:21:28] [INFO ] Added : 151 causal constraints over 31 iterations in 2202 ms. Result :sat
Minimization took 337 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 715/715 transitions.
Applied a total of 0 rules in 18 ms. Remains 437 /437 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 437/437 places, 715/715 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 715/715 transitions.
Applied a total of 0 rules in 17 ms. Remains 437 /437 variables (removed 0) and now considering 715/715 (removed 0) transitions.
[2024-05-22 08:21:31] [INFO ] Invariant cache hit.
[2024-05-22 08:21:31] [INFO ] Implicit Places using invariants in 585 ms returned [0, 18, 19, 21, 31, 49, 67, 142, 157, 158, 159, 177, 195, 264, 268, 269, 272, 283, 284, 285, 303, 305, 308, 326, 327, 328, 329, 341, 347, 353, 359, 365, 371, 377, 383, 389, 395, 401]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 592 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 399/437 places, 715/715 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 399 transition count 656
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 340 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 118 place count 340 transition count 641
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 149 place count 324 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 161 place count 320 transition count 633
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 169 place count 312 transition count 633
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 184 place count 297 transition count 618
Iterating global reduction 4 with 15 rules applied. Total rules applied 199 place count 297 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 202 place count 297 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 202 place count 297 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 204 place count 296 transition count 614
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 207 place count 293 transition count 611
Iterating global reduction 5 with 3 rules applied. Total rules applied 210 place count 293 transition count 611
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 211 place count 292 transition count 610
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 292 transition count 610
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 213 place count 291 transition count 609
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 291 transition count 609
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 268 place count 264 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 269 place count 264 transition count 581
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 263 transition count 580
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 263 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 272 place count 263 transition count 579
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 278 place count 263 transition count 573
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 285 place count 256 transition count 573
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 286 place count 256 transition count 572
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 292 place count 256 transition count 572
Applied a total of 292 rules in 159 ms. Remains 256 /399 variables (removed 143) and now considering 572/715 (removed 143) transitions.
// Phase 1: matrix 572 rows 256 cols
[2024-05-22 08:21:32] [INFO ] Computed 36 invariants in 6 ms
[2024-05-22 08:21:32] [INFO ] Implicit Places using invariants in 269 ms returned [89, 95, 98, 100, 103, 110, 111, 165, 182, 188, 191, 193]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 272 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 244/437 places, 572/715 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 237 transition count 565
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 237 transition count 565
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 235 transition count 563
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 235 transition count 563
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 232 transition count 560
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 232 transition count 559
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 232 transition count 553
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 37 place count 226 transition count 553
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 226 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 225 transition count 552
Applied a total of 39 rules in 83 ms. Remains 225 /244 variables (removed 19) and now considering 552/572 (removed 20) transitions.
// Phase 1: matrix 552 rows 225 cols
[2024-05-22 08:21:32] [INFO ] Computed 24 invariants in 5 ms
[2024-05-22 08:21:32] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 08:21:32] [INFO ] Invariant cache hit.
[2024-05-22 08:21:33] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 225/437 places, 552/715 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2006 ms. Remains : 225/437 places, 552/715 transitions.
Successfully produced net in file /tmp/petri1000_12377894858515133724.dot
Successfully produced net in file /tmp/petri1001_2013748867014193644.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 550 rows 225 cols
[2024-05-22 08:21:33] [INFO ] Computed 24 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 23938 resets, run finished after 1952 ms. (steps per millisecond=512 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10037 resets, run finished after 1132 ms. (steps per millisecond=883 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9962 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 2) seen :0
[2024-05-22 08:21:37] [INFO ] Invariant cache hit.
[2024-05-22 08:21:37] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-22 08:21:37] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-22 08:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:37] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-22 08:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-22 08:21:37] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 19 ms returned sat
[2024-05-22 08:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:37] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-05-22 08:21:37] [INFO ] Computed and/alt/rep : 104/592/104 causal constraints (skipped 432 transitions) in 38 ms.
[2024-05-22 08:21:38] [INFO ] Added : 45 causal constraints over 10 iterations in 809 ms. Result :sat
Minimization took 241 ms.
[2024-05-22 08:21:38] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-22 08:21:38] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-22 08:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:39] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-22 08:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-22 08:21:39] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 10 ms returned sat
[2024-05-22 08:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:39] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-05-22 08:21:39] [INFO ] Computed and/alt/rep : 104/592/104 causal constraints (skipped 432 transitions) in 56 ms.
[2024-05-22 08:21:39] [INFO ] Added : 27 causal constraints over 6 iterations in 432 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 550/550 transitions.
Graph (complete) has 1350 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 223 transition count 550
Applied a total of 3 rules in 31 ms. Remains 223 /225 variables (removed 2) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 223/225 places, 550/550 transitions.
// Phase 1: matrix 550 rows 223 cols
[2024-05-22 08:21:40] [INFO ] Computed 24 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 24096 resets, run finished after 1618 ms. (steps per millisecond=618 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9964 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9984 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 2) seen :0
[2024-05-22 08:21:43] [INFO ] Invariant cache hit.
[2024-05-22 08:21:43] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-22 08:21:43] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-22 08:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:43] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-22 08:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-22 08:21:43] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-22 08:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:44] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-05-22 08:21:44] [INFO ] Computed and/alt/rep : 104/590/104 causal constraints (skipped 432 transitions) in 59 ms.
[2024-05-22 08:21:44] [INFO ] Added : 41 causal constraints over 9 iterations in 825 ms. Result :sat
Minimization took 206 ms.
[2024-05-22 08:21:45] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-22 08:21:45] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-22 08:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:45] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-22 08:21:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-22 08:21:45] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 10 ms returned sat
[2024-05-22 08:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:46] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2024-05-22 08:21:46] [INFO ] Computed and/alt/rep : 104/590/104 causal constraints (skipped 432 transitions) in 59 ms.
[2024-05-22 08:21:46] [INFO ] Added : 11 causal constraints over 3 iterations in 330 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 550/550 transitions.
Applied a total of 0 rules in 16 ms. Remains 223 /223 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 223/223 places, 550/550 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 550/550 transitions.
Applied a total of 0 rules in 14 ms. Remains 223 /223 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-05-22 08:21:46] [INFO ] Invariant cache hit.
[2024-05-22 08:21:47] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-22 08:21:47] [INFO ] Invariant cache hit.
[2024-05-22 08:21:47] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2024-05-22 08:21:47] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-22 08:21:47] [INFO ] Invariant cache hit.
[2024-05-22 08:21:48] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1348 ms. Remains : 223/223 places, 550/550 transitions.
Starting property specific reduction for ASLink-PT-02a-UpperBounds-01
[2024-05-22 08:21:48] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2024-05-22 08:21:48] [INFO ] Invariant cache hit.
[2024-05-22 08:21:48] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-22 08:21:48] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-22 08:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:48] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-22 08:21:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-22 08:21:48] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 9 ms returned sat
[2024-05-22 08:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:48] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2024-05-22 08:21:48] [INFO ] Computed and/alt/rep : 104/590/104 causal constraints (skipped 432 transitions) in 54 ms.
[2024-05-22 08:21:49] [INFO ] Added : 41 causal constraints over 9 iterations in 773 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 550/550 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 223 transition count 549
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 222 transition count 549
Applied a total of 2 rules in 18 ms. Remains 222 /223 variables (removed 1) and now considering 549/550 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 222/223 places, 549/550 transitions.
// Phase 1: matrix 549 rows 222 cols
[2024-05-22 08:21:50] [INFO ] Computed 24 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 24165 resets, run finished after 1746 ms. (steps per millisecond=572 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9952 resets, run finished after 734 ms. (steps per millisecond=1362 ) properties (out of 1) seen :0
[2024-05-22 08:21:52] [INFO ] Invariant cache hit.
[2024-05-22 08:21:52] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-22 08:21:52] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-22 08:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:52] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-22 08:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-22 08:21:52] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-22 08:21:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:53] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2024-05-22 08:21:53] [INFO ] Computed and/alt/rep : 103/589/103 causal constraints (skipped 432 transitions) in 56 ms.
[2024-05-22 08:21:54] [INFO ] Added : 42 causal constraints over 10 iterations in 819 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 549/549 transitions.
Applied a total of 0 rules in 12 ms. Remains 222 /222 variables (removed 0) and now considering 549/549 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 222/222 places, 549/549 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 549/549 transitions.
Applied a total of 0 rules in 11 ms. Remains 222 /222 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-05-22 08:21:54] [INFO ] Invariant cache hit.
[2024-05-22 08:21:54] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-22 08:21:54] [INFO ] Invariant cache hit.
[2024-05-22 08:21:55] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2024-05-22 08:21:55] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-22 08:21:55] [INFO ] Invariant cache hit.
[2024-05-22 08:21:56] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1962 ms. Remains : 222/222 places, 549/549 transitions.
Ending property specific reduction for ASLink-PT-02a-UpperBounds-01 in 8286 ms.
Starting property specific reduction for ASLink-PT-02a-UpperBounds-10
// Phase 1: matrix 550 rows 223 cols
[2024-05-22 08:21:56] [INFO ] Computed 24 invariants in 9 ms
Incomplete random walk after 10000 steps, including 228 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2024-05-22 08:21:56] [INFO ] Invariant cache hit.
[2024-05-22 08:21:56] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-22 08:21:56] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 10 ms returned sat
[2024-05-22 08:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:56] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-05-22 08:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:21:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-22 08:21:56] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 10 ms returned sat
[2024-05-22 08:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:21:57] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2024-05-22 08:21:57] [INFO ] Computed and/alt/rep : 104/590/104 causal constraints (skipped 432 transitions) in 56 ms.
[2024-05-22 08:21:57] [INFO ] Added : 11 causal constraints over 3 iterations in 304 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 550/550 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 223 transition count 549
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 221 transition count 549
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 221 transition count 547
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 7 place count 219 transition count 547
Applied a total of 7 rules in 20 ms. Remains 219 /223 variables (removed 4) and now considering 547/550 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 219/223 places, 547/550 transitions.
// Phase 1: matrix 547 rows 219 cols
[2024-05-22 08:21:57] [INFO ] Computed 23 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 23942 resets, run finished after 1764 ms. (steps per millisecond=566 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9977 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 1) seen :0
[2024-05-22 08:22:00] [INFO ] Invariant cache hit.
[2024-05-22 08:22:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 08:22:00] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-22 08:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:22:00] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-22 08:22:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:22:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 08:22:00] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-22 08:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:22:00] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2024-05-22 08:22:00] [INFO ] Computed and/alt/rep : 101/587/101 causal constraints (skipped 432 transitions) in 35 ms.
[2024-05-22 08:22:01] [INFO ] Added : 14 causal constraints over 3 iterations in 196 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 547/547 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 219/219 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 547/547 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2024-05-22 08:22:01] [INFO ] Invariant cache hit.
[2024-05-22 08:22:01] [INFO ] Implicit Places using invariants in 252 ms returned [87, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 254 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/219 places, 547/547 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 215 transition count 545
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 215 transition count 544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 214 transition count 544
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 214 transition count 544
Applied a total of 7 rules in 34 ms. Remains 214 /217 variables (removed 3) and now considering 544/547 (removed 3) transitions.
// Phase 1: matrix 544 rows 214 cols
[2024-05-22 08:22:01] [INFO ] Computed 21 invariants in 6 ms
[2024-05-22 08:22:01] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 08:22:01] [INFO ] Invariant cache hit.
[2024-05-22 08:22:02] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 214/219 places, 544/547 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1323 ms. Remains : 214/219 places, 544/547 transitions.
[2024-05-22 08:22:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 23896 resets, run finished after 1659 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9993 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 1) seen :0
[2024-05-22 08:22:04] [INFO ] Invariant cache hit.
[2024-05-22 08:22:04] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-22 08:22:04] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-22 08:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 08:22:05] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-22 08:22:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:22:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-22 08:22:05] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-22 08:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 08:22:05] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-22 08:22:05] [INFO ] Computed and/alt/rep : 91/510/91 causal constraints (skipped 439 transitions) in 63 ms.
[2024-05-22 08:22:05] [INFO ] Added : 10 causal constraints over 2 iterations in 215 ms. Result :sat
Minimization took 188 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 REACHABILITY mode, iteration 0 : 214/214 places, 544/544 transitions.
Applied a total of 0 rules in 12 ms. Remains 214 /214 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 214/214 places, 544/544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 544/544 transitions.
Applied a total of 0 rules in 11 ms. Remains 214 /214 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2024-05-22 08:22:05] [INFO ] Invariant cache hit.
[2024-05-22 08:22:06] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-22 08:22:06] [INFO ] Invariant cache hit.
[2024-05-22 08:22:07] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2024-05-22 08:22:07] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 08:22:07] [INFO ] Invariant cache hit.
[2024-05-22 08:22:07] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1862 ms. Remains : 214/214 places, 544/544 transitions.
Ending property specific reduction for ASLink-PT-02a-UpperBounds-10 in 11391 ms.
[2024-05-22 08:22:08] [INFO ] Flatten gal took : 191 ms
[2024-05-22 08:22:08] [INFO ] Applying decomposition
[2024-05-22 08:22:08] [INFO ] Flatten gal took : 103 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16249193272200749939.txt' '-o' '/tmp/graph16249193272200749939.bin' '-w' '/tmp/graph16249193272200749939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16249193272200749939.bin' '-l' '-1' '-v' '-w' '/tmp/graph16249193272200749939.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:22:08] [INFO ] Decomposing Gal with order
[2024-05-22 08:22:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:22:09] [INFO ] Removed a total of 1122 redundant transitions.
[2024-05-22 08:22:09] [INFO ] Flatten gal took : 133 ms
[2024-05-22 08:22:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 13 ms.
[2024-05-22 08:22:09] [INFO ] Time to serialize gal into /tmp/UpperBounds2297720139286346395.gal : 10 ms
[2024-05-22 08:22:09] [INFO ] Time to serialize properties into /tmp/UpperBounds6070953288321111864.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2297720139286346395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6070953288321111864.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6070953288321111864.prop.
Detected timeout of ITS tools.
[2024-05-22 08:42:41] [INFO ] Applying decomposition
[2024-05-22 08:42:41] [INFO ] Flatten gal took : 47 ms
[2024-05-22 08:42:41] [INFO ] Decomposing Gal with order
[2024-05-22 08:42:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:42:41] [INFO ] Removed a total of 961 redundant transitions.
[2024-05-22 08:42:41] [INFO ] Flatten gal took : 125 ms
[2024-05-22 08:42:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 15 ms.
[2024-05-22 08:42:41] [INFO ] Time to serialize gal into /tmp/UpperBounds13785997258071766874.gal : 4 ms
[2024-05-22 08:42:41] [INFO ] Time to serialize properties into /tmp/UpperBounds4128010012185960614.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13785997258071766874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4128010012185960614.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds4128010012185960614.prop.
Detected timeout of ITS tools.
[2024-05-22 09:03:14] [INFO ] Flatten gal took : 41 ms
[2024-05-22 09:03:14] [INFO ] Input system was already deterministic with 550 transitions.
[2024-05-22 09:03:14] [INFO ] Transformed 223 places.
[2024-05-22 09:03:14] [INFO ] Transformed 550 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-22 09:03:14] [INFO ] Time to serialize gal into /tmp/UpperBounds17612712021703696541.gal : 7 ms
[2024-05-22 09:03:14] [INFO ] Time to serialize properties into /tmp/UpperBounds4478025834088387042.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17612712021703696541.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4478025834088387042.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4478025834088387042.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8248476 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103872 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ASLink-PT-02a, 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 r021-smll-171620127700016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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