Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r031-oct2-167813615300004.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r031-oct2-167813615300004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 13:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 279K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-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 1678866302520

Running Version 202205111006
[2023-03-15 07:45:04] [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]
[2023-03-15 07:45:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:45:04] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2023-03-15 07:45:04] [INFO ] Transformed 626 places.
[2023-03-15 07:45:04] [INFO ] Transformed 1008 transitions.
[2023-03-15 07:45:04] [INFO ] Found NUPN structural information;
[2023-03-15 07:45:04] [INFO ] Parsed PT model containing 626 places and 1008 transitions in 460 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
// Phase 1: matrix 998 rows 626 cols
[2023-03-15 07:45:04] [INFO ] Computed 118 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 117 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :11
FORMULA ASLink-PT-02a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-09 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-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
// Phase 1: matrix 998 rows 626 cols
[2023-03-15 07:45:04] [INFO ] Computed 118 place invariants in 58 ms
[2023-03-15 07:45:05] [INFO ] [Real]Absence check using 28 positive place invariants in 15 ms returned sat
[2023-03-15 07:45:05] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 25 ms returned sat
[2023-03-15 07:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:05] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-15 07:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:05] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-15 07:45:05] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 25 ms returned sat
[2023-03-15 07:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:06] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-15 07:45:06] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 98 ms.
[2023-03-15 07:45:10] [INFO ] Added : 175 causal constraints over 35 iterations in 4425 ms. Result :unknown
[2023-03-15 07:45:10] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-15 07:45:10] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 22 ms returned sat
[2023-03-15 07:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:11] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-15 07:45:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:11] [INFO ] [Nat]Absence check using 28 positive place invariants in 15 ms returned sat
[2023-03-15 07:45:11] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 74 ms returned sat
[2023-03-15 07:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:12] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-15 07:45:12] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 4 ms to minimize.
[2023-03-15 07:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-15 07:45:12] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 89 ms.
[2023-03-15 07:45:16] [INFO ] Deduced a trap composed of 5 places in 502 ms of which 1 ms to minimize.
[2023-03-15 07:45:16] [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)
[2023-03-15 07:45:17] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2023-03-15 07:45:17] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 27 ms returned sat
[2023-03-15 07:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:17] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2023-03-15 07:45:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:17] [INFO ] [Nat]Absence check using 28 positive place invariants in 12 ms returned sat
[2023-03-15 07:45:17] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 32 ms returned sat
[2023-03-15 07:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:18] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-15 07:45:18] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 82 ms.
[2023-03-15 07:45:23] [INFO ] Deduced a trap composed of 5 places in 457 ms of which 2 ms to minimize.
[2023-03-15 07:45:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2023-03-15 07:45:23] [INFO ] [Real]Absence check using 28 positive place invariants in 15 ms returned sat
[2023-03-15 07:45:23] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 35 ms returned sat
[2023-03-15 07:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:23] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2023-03-15 07:45:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:23] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-15 07:45:23] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 45 ms returned sat
[2023-03-15 07:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:24] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2023-03-15 07:45:24] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2023-03-15 07:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-15 07:45:24] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 106 ms.
[2023-03-15 07:45:28] [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: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
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)
[2023-03-15 07:45:28] [INFO ] [Real]Absence check using 28 positive place invariants in 21 ms returned sat
[2023-03-15 07:45:28] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 30 ms returned sat
[2023-03-15 07:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:29] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-15 07:45:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:29] [INFO ] [Nat]Absence check using 28 positive place invariants in 15 ms returned sat
[2023-03-15 07:45:29] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 27 ms returned sat
[2023-03-15 07:45:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using state equation in 4772 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ASLink-PT-02a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-02a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-02a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-02a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 626 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 626/626 places, 996/996 transitions.
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 613 transition count 944
Reduce places removed 52 places and 2 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 116 place count 561 transition count 942
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 560 transition count 941
Reduce places removed 3 places and 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 557 transition count 938
Reduce places removed 3 places and 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 554 transition count 937
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2309 edges and 553 vertex of which 551 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 125 place count 551 transition count 935
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 45 Pre rules applied. Total rules applied 125 place count 551 transition count 890
Deduced a syphon composed of 45 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 107 rules applied. Total rules applied 232 place count 489 transition count 890
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 489 transition count 889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 234 place count 488 transition count 889
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 239 place count 483 transition count 868
Ensure Unique test removed 1 places
Iterating global reduction 8 with 6 rules applied. Total rules applied 245 place count 482 transition count 868
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 251 place count 481 transition count 863
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 254 place count 478 transition count 863
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 255 place count 477 transition count 855
Iterating global reduction 10 with 1 rules applied. Total rules applied 256 place count 477 transition count 855
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 257 place count 476 transition count 847
Iterating global reduction 10 with 1 rules applied. Total rules applied 258 place count 476 transition count 847
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 259 place count 475 transition count 839
Iterating global reduction 10 with 1 rules applied. Total rules applied 260 place count 475 transition count 839
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 261 place count 474 transition count 831
Iterating global reduction 10 with 1 rules applied. Total rules applied 262 place count 474 transition count 831
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 263 place count 473 transition count 823
Iterating global reduction 10 with 1 rules applied. Total rules applied 264 place count 473 transition count 823
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 265 place count 472 transition count 815
Iterating global reduction 10 with 1 rules applied. Total rules applied 266 place count 472 transition count 815
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 267 place count 471 transition count 807
Iterating global reduction 10 with 1 rules applied. Total rules applied 268 place count 471 transition count 807
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 269 place count 470 transition count 799
Iterating global reduction 10 with 1 rules applied. Total rules applied 270 place count 470 transition count 799
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 271 place count 469 transition count 791
Iterating global reduction 10 with 1 rules applied. Total rules applied 272 place count 469 transition count 791
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 273 place count 468 transition count 783
Iterating global reduction 10 with 1 rules applied. Total rules applied 274 place count 468 transition count 783
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 275 place count 467 transition count 775
Iterating global reduction 10 with 1 rules applied. Total rules applied 276 place count 467 transition count 775
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 277 place count 466 transition count 767
Iterating global reduction 10 with 1 rules applied. Total rules applied 278 place count 466 transition count 767
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 279 place count 465 transition count 759
Iterating global reduction 10 with 1 rules applied. Total rules applied 280 place count 465 transition count 759
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 281 place count 464 transition count 751
Iterating global reduction 10 with 1 rules applied. Total rules applied 282 place count 464 transition count 751
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 283 place count 463 transition count 743
Iterating global reduction 10 with 1 rules applied. Total rules applied 284 place count 463 transition count 743
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 285 place count 462 transition count 735
Iterating global reduction 10 with 1 rules applied. Total rules applied 286 place count 462 transition count 735
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 10 with 28 rules applied. Total rules applied 314 place count 448 transition count 721
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 315 place count 448 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 316 place count 447 transition count 720
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 319 place count 447 transition count 720
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 320 place count 446 transition count 719
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 324 place count 442 transition count 719
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 8 Pre rules applied. Total rules applied 324 place count 442 transition count 711
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 12 with 17 rules applied. Total rules applied 341 place count 433 transition count 711
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 12 with 3 rules applied. Total rules applied 344 place count 430 transition count 711
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 344 place count 430 transition count 710
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 346 place count 429 transition count 710
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 13 with 6 rules applied. Total rules applied 352 place count 426 transition count 707
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 354 place count 424 transition count 705
Iterating global reduction 13 with 2 rules applied. Total rules applied 356 place count 424 transition count 705
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 358 place count 424 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 360 place count 422 transition count 703
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 362 place count 422 transition count 703
Applied a total of 362 rules in 521 ms. Remains 422 /626 variables (removed 204) and now considering 703/996 (removed 293) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/626 places, 703/996 transitions.
// Phase 1: matrix 703 rows 422 cols
[2023-03-15 07:45:35] [INFO ] Computed 76 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 16122 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5577 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 1) seen :0
// Phase 1: matrix 703 rows 422 cols
[2023-03-15 07:45:38] [INFO ] Computed 76 place invariants in 37 ms
[2023-03-15 07:45:38] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 07:45:38] [INFO ] [Real]Absence check using 20 positive and 56 generalized place invariants in 26 ms returned sat
[2023-03-15 07:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:38] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-15 07:45:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-15 07:45:38] [INFO ] [Nat]Absence check using 20 positive and 56 generalized place invariants in 19 ms returned sat
[2023-03-15 07:45:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:39] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2023-03-15 07:45:39] [INFO ] Computed and/alt/rep : 259/1019/259 causal constraints (skipped 427 transitions) in 82 ms.
[2023-03-15 07:45:41] [INFO ] Added : 182 causal constraints over 37 iterations in 2620 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 422/422 places, 703/703 transitions.
Applied a total of 0 rules in 34 ms. Remains 422 /422 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 703/703 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 422/422 places, 703/703 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 703/703 (removed 0) transitions.
// Phase 1: matrix 703 rows 422 cols
[2023-03-15 07:45:42] [INFO ] Computed 76 place invariants in 14 ms
[2023-03-15 07:45:42] [INFO ] Implicit Places using invariants in 383 ms returned [0, 18, 19, 30, 48, 66, 129, 133, 142, 143, 144, 162, 180, 249, 253, 254, 257, 268, 269, 270, 288, 290, 293, 311, 312, 313, 314, 326, 332, 338, 344, 350, 356, 362, 368, 374, 380, 386]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 387 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 384/422 places, 703/703 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 384 transition count 644
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 325 transition count 644
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 118 place count 325 transition count 630
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 147 place count 310 transition count 630
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 159 place count 306 transition count 622
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 167 place count 298 transition count 622
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 182 place count 283 transition count 607
Iterating global reduction 4 with 15 rules applied. Total rules applied 197 place count 283 transition count 607
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 200 place count 283 transition count 604
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 200 place count 283 transition count 603
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 202 place count 282 transition count 603
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 279 transition count 600
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 279 transition count 600
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 209 place count 278 transition count 599
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 278 transition count 599
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 211 place count 277 transition count 598
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 277 transition count 598
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 262 place count 252 transition count 573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 264 place count 252 transition count 571
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 266 place count 250 transition count 569
Iterating global reduction 6 with 2 rules applied. Total rules applied 268 place count 250 transition count 569
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 270 place count 250 transition count 567
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 274 place count 250 transition count 563
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 279 place count 245 transition count 563
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 286 place count 245 transition count 563
Applied a total of 286 rules in 95 ms. Remains 245 /384 variables (removed 139) and now considering 563/703 (removed 140) transitions.
// Phase 1: matrix 563 rows 245 cols
[2023-03-15 07:45:42] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-15 07:45:42] [INFO ] Implicit Places using invariants in 189 ms returned [72, 87, 93, 96, 98, 101, 102, 154, 171, 177, 180, 182]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 198 ms to find 12 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 233/422 places, 563/703 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 227 transition count 557
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 227 transition count 557
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 225 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 225 transition count 555
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 221 transition count 551
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 221 transition count 545
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 215 transition count 545
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 215 transition count 543
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 213 transition count 543
Applied a total of 40 rules in 73 ms. Remains 213 /233 variables (removed 20) and now considering 543/563 (removed 20) transitions.
// Phase 1: matrix 543 rows 213 cols
[2023-03-15 07:45:42] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 07:45:43] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 543 rows 213 cols
[2023-03-15 07:45:43] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 07:45:43] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 213/422 places, 543/703 transitions.
Finished structural reductions, in 3 iterations. Remains : 213/422 places, 543/703 transitions.
Successfully produced net in file /tmp/petri1000_1367216786397843622.dot
Successfully produced net in file /tmp/petri1001_10393855108663721311.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 541 rows 213 cols
[2023-03-15 07:45:43] [INFO ] Computed 20 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 24160 resets, run finished after 1363 ms. (steps per millisecond=733 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10047 resets, run finished after 734 ms. (steps per millisecond=1362 ) properties (out of 1) seen :0
// Phase 1: matrix 541 rows 213 cols
[2023-03-15 07:45:45] [INFO ] Computed 20 place invariants in 10 ms
[2023-03-15 07:45:45] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-15 07:45:45] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-15 07:45:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:45] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-15 07:45:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-15 07:45:45] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 12 ms returned sat
[2023-03-15 07:45:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:46] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-03-15 07:45:46] [INFO ] Computed and/alt/rep : 88/500/88 causal constraints (skipped 439 transitions) in 44 ms.
[2023-03-15 07:45:46] [INFO ] Added : 21 causal constraints over 5 iterations in 496 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 541/541 transitions.
Graph (complete) has 1341 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 211 transition count 541
Applied a total of 3 rules in 28 ms. Remains 211 /213 variables (removed 2) and now considering 541/541 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/213 places, 541/541 transitions.
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:46] [INFO ] Computed 20 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 23925 resets, run finished after 1396 ms. (steps per millisecond=716 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 10135 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 1) seen :0
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:48] [INFO ] Computed 20 place invariants in 10 ms
[2023-03-15 07:45:49] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-15 07:45:49] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 7 ms returned sat
[2023-03-15 07:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:49] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-15 07:45:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 79 ms returned sat
[2023-03-15 07:45:49] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 8 ms returned sat
[2023-03-15 07:45:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:49] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2023-03-15 07:45:49] [INFO ] Computed and/alt/rep : 88/498/88 causal constraints (skipped 439 transitions) in 57 ms.
[2023-03-15 07:45:49] [INFO ] Added : 12 causal constraints over 3 iterations in 264 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 541/541 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 541/541 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/211 places, 541/541 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 541/541 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 541/541 (removed 0) transitions.
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:50] [INFO ] Computed 20 place invariants in 10 ms
[2023-03-15 07:45:50] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:50] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 07:45:50] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-15 07:45:50] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:50] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 07:45:51] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/211 places, 541/541 transitions.
Starting property specific reduction for ASLink-PT-02a-UpperBounds-11
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:51] [INFO ] Computed 20 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 244 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:51] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-15 07:45:51] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-15 07:45:51] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 7 ms returned sat
[2023-03-15 07:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:51] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-15 07:45:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-15 07:45:51] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 7 ms returned sat
[2023-03-15 07:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:51] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-03-15 07:45:51] [INFO ] Computed and/alt/rep : 88/498/88 causal constraints (skipped 439 transitions) in 58 ms.
[2023-03-15 07:45:52] [INFO ] Added : 12 causal constraints over 3 iterations in 332 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 541/541 transitions.
Applied a total of 0 rules in 9 ms. Remains 211 /211 variables (removed 0) and now considering 541/541 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/211 places, 541/541 transitions.
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:52] [INFO ] Computed 20 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 24059 resets, run finished after 1455 ms. (steps per millisecond=687 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 10046 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 1) seen :0
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:54] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 07:45:54] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-15 07:45:54] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 8 ms returned sat
[2023-03-15 07:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:54] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-15 07:45:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-15 07:45:54] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-15 07:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:54] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2023-03-15 07:45:55] [INFO ] Computed and/alt/rep : 88/498/88 causal constraints (skipped 439 transitions) in 47 ms.
[2023-03-15 07:45:55] [INFO ] Added : 12 causal constraints over 3 iterations in 226 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 541/541 transitions.
Applied a total of 0 rules in 8 ms. Remains 211 /211 variables (removed 0) and now considering 541/541 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/211 places, 541/541 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 541/541 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 541/541 (removed 0) transitions.
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:55] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-15 07:45:55] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:55] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-15 07:45:56] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2023-03-15 07:45:56] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 541 rows 211 cols
[2023-03-15 07:45:56] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-15 07:45:56] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/211 places, 541/541 transitions.
Ending property specific reduction for ASLink-PT-02a-UpperBounds-11 in 5317 ms.
[2023-03-15 07:45:56] [INFO ] Flatten gal took : 91 ms
[2023-03-15 07:45:56] [INFO ] Applying decomposition
[2023-03-15 07:45:56] [INFO ] Flatten gal took : 35 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/graph1066916091138551905.txt' '-o' '/tmp/graph1066916091138551905.bin' '-w' '/tmp/graph1066916091138551905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1066916091138551905.bin' '-l' '-1' '-v' '-w' '/tmp/graph1066916091138551905.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:45:56] [INFO ] Decomposing Gal with order
[2023-03-15 07:45:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:45:57] [INFO ] Removed a total of 1144 redundant transitions.
[2023-03-15 07:45:57] [INFO ] Flatten gal took : 92 ms
[2023-03-15 07:45:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 9 ms.
[2023-03-15 07:45:57] [INFO ] Time to serialize gal into /tmp/UpperBounds9931999103494211437.gal : 10 ms
[2023-03-15 07:45:57] [INFO ] Time to serialize properties into /tmp/UpperBounds3716769724472475803.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/UpperBounds9931999103494211437.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3716769724472475803.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/UpperBounds3716769724472475803.prop.
Detected timeout of ITS tools.
[2023-03-15 08:06:14] [INFO ] Applying decomposition
[2023-03-15 08:06:14] [INFO ] Flatten gal took : 31 ms
[2023-03-15 08:06:14] [INFO ] Decomposing Gal with order
[2023-03-15 08:06:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:06:14] [INFO ] Removed a total of 986 redundant transitions.
[2023-03-15 08:06:14] [INFO ] Flatten gal took : 82 ms
[2023-03-15 08:06:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 9 ms.
[2023-03-15 08:06:14] [INFO ] Time to serialize gal into /tmp/UpperBounds9290024489227843778.gal : 3 ms
[2023-03-15 08:06:14] [INFO ] Time to serialize properties into /tmp/UpperBounds16869704197369818512.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/UpperBounds9290024489227843778.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16869704197369818512.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/UpperBounds16869704197369818512.prop.
Detected timeout of ITS tools.
[2023-03-15 08:26:31] [INFO ] Flatten gal took : 60 ms
[2023-03-15 08:26:32] [INFO ] Input system was already deterministic with 541 transitions.
[2023-03-15 08:26:32] [INFO ] Transformed 211 places.
[2023-03-15 08:26:32] [INFO ] Transformed 541 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
[2023-03-15 08:26:32] [INFO ] Time to serialize gal into /tmp/UpperBounds16582056048577189206.gal : 10 ms
[2023-03-15 08:26:32] [INFO ] Time to serialize properties into /tmp/UpperBounds4607931264982090057.prop : 14 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/UpperBounds16582056048577189206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4607931264982090057.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...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4607931264982090057.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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-02a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
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 r031-oct2-167813615300004"
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 ;