fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597300029
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ASLink-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7974.123 3600000.00 14224037.00 55.00 1 1 1 1 1 1 1 1 1 1 1 ? 1 1 ? 1 normal

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.r009-oct2-167813597300029.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 ltsminxred
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 r009-oct2-167813597300029
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:25:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 06:25:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:25:16] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-12 06:25:16] [INFO ] Transformed 626 places.
[2023-03-12 06:25:16] [INFO ] Transformed 1008 transitions.
[2023-03-12 06:25:16] [INFO ] Found NUPN structural information;
[2023-03-12 06:25:16] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
// Phase 1: matrix 998 rows 626 cols
[2023-03-12 06:25:17] [INFO ] Computed 118 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 108 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :12
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
FORMULA ASLink-PT-02a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
[2023-03-12 06:25:17] [INFO ] Invariant cache hit.
[2023-03-12 06:25:17] [INFO ] [Real]Absence check using 28 positive place invariants in 66 ms returned sat
[2023-03-12 06:25:17] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 40 ms returned sat
[2023-03-12 06:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:18] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2023-03-12 06:25:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:25:18] [INFO ] [Nat]Absence check using 28 positive place invariants in 26 ms returned sat
[2023-03-12 06:25:18] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 91 ms returned sat
[2023-03-12 06:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:19] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2023-03-12 06:25:19] [INFO ] Deduced a trap composed of 112 places in 279 ms of which 4 ms to minimize.
[2023-03-12 06:25:20] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 2 ms to minimize.
[2023-03-12 06:25:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2023-03-12 06:25:20] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 107 ms.
[2023-03-12 06:25: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 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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 06:25:23] [INFO ] [Real]Absence check using 28 positive place invariants in 35 ms returned sat
[2023-03-12 06:25:24] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 61 ms returned sat
[2023-03-12 06:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:24] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-12 06:25:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:25:24] [INFO ] [Nat]Absence check using 28 positive place invariants in 15 ms returned sat
[2023-03-12 06:25:24] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 25 ms returned sat
[2023-03-12 06:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:25] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2023-03-12 06:25:25] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 2 ms to minimize.
[2023-03-12 06:25:26] [INFO ] Deduced a trap composed of 117 places in 371 ms of which 26 ms to minimize.
[2023-03-12 06:25:27] [INFO ] Deduced a trap composed of 66 places in 291 ms of which 1 ms to minimize.
[2023-03-12 06:25:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2375 ms
[2023-03-12 06:25:28] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 83 ms.
[2023-03-12 06:25:30] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 1 ms to minimize.
[2023-03-12 06:25:30] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 06:25:30] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2023-03-12 06:25:30] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 43 ms returned sat
[2023-03-12 06:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:30] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-12 06:25:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:25:30] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-12 06:25:31] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 23 ms returned sat
[2023-03-12 06:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:31] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2023-03-12 06:25:31] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 1 ms to minimize.
[2023-03-12 06:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-12 06:25:32] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 109 ms.
[2023-03-12 06:25:35] [INFO ] Added : 165 causal constraints over 33 iterations in 3871 ms. Result :unknown
[2023-03-12 06:25:35] [INFO ] [Real]Absence check using 28 positive place invariants in 36 ms returned sat
[2023-03-12 06:25:36] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 79 ms returned sat
[2023-03-12 06:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:36] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2023-03-12 06:25:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:25:36] [INFO ] [Nat]Absence check using 28 positive place invariants in 24 ms returned sat
[2023-03-12 06:25:36] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 27 ms returned sat
[2023-03-12 06:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:37] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2023-03-12 06:25:37] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 109 ms.
[2023-03-12 06:25:41] [INFO ] Added : 20 causal constraints over 4 iterations in 3906 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
FORMULA ASLink-PT-02a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 614 transition count 947
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 114 place count 563 transition count 947
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 114 place count 563 transition count 898
Deduced a syphon composed of 49 places in 2 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 231 place count 495 transition count 898
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 232 place count 495 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 494 transition count 897
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 489 transition count 874
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 488 transition count 874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 250 place count 487 transition count 869
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 253 place count 484 transition count 869
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 483 transition count 861
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 483 transition count 861
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 256 place count 482 transition count 853
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 482 transition count 853
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 258 place count 481 transition count 845
Iterating global reduction 6 with 1 rules applied. Total rules applied 259 place count 481 transition count 845
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 260 place count 480 transition count 837
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 480 transition count 837
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 262 place count 479 transition count 829
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 479 transition count 829
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 478 transition count 821
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 478 transition count 821
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 477 transition count 813
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 477 transition count 813
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 476 transition count 805
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 476 transition count 805
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 475 transition count 797
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 475 transition count 797
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 272 place count 474 transition count 789
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 474 transition count 789
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 274 place count 473 transition count 781
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 473 transition count 781
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 276 place count 472 transition count 773
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 472 transition count 773
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 278 place count 471 transition count 765
Iterating global reduction 6 with 1 rules applied. Total rules applied 279 place count 471 transition count 765
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 470 transition count 757
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 470 transition count 757
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 282 place count 469 transition count 749
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 469 transition count 749
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 284 place count 468 transition count 741
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 468 transition count 741
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 6 with 28 rules applied. Total rules applied 313 place count 454 transition count 727
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 314 place count 454 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 315 place count 453 transition count 726
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 317 place count 453 transition count 726
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 318 place count 452 transition count 725
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 322 place count 448 transition count 725
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 322 place count 448 transition count 717
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 339 place count 439 transition count 717
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 342 place count 436 transition count 717
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 342 place count 436 transition count 716
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 344 place count 435 transition count 716
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 350 place count 432 transition count 713
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 352 place count 430 transition count 711
Iterating global reduction 9 with 2 rules applied. Total rules applied 354 place count 430 transition count 711
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 356 place count 430 transition count 709
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 358 place count 428 transition count 709
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 360 place count 428 transition count 709
Applied a total of 360 rules in 596 ms. Remains 428 /626 variables (removed 198) and now considering 709/998 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 428/626 places, 709/998 transitions.
// Phase 1: matrix 709 rows 428 cols
[2023-03-12 06:25:44] [INFO ] Computed 77 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 16182 resets, run finished after 1923 ms. (steps per millisecond=520 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5573 resets, run finished after 947 ms. (steps per millisecond=1055 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5547 resets, run finished after 952 ms. (steps per millisecond=1050 ) properties (out of 2) seen :0
[2023-03-12 06:25:48] [INFO ] Invariant cache hit.
[2023-03-12 06:25:48] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-12 06:25:48] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 21 ms returned sat
[2023-03-12 06:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:49] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2023-03-12 06:25:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:25:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-12 06:25:49] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 18 ms returned sat
[2023-03-12 06:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:49] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2023-03-12 06:25:50] [INFO ] Computed and/alt/rep : 265/1057/265 causal constraints (skipped 427 transitions) in 76 ms.
[2023-03-12 06:25:52] [INFO ] Added : 179 causal constraints over 36 iterations in 2607 ms. Result :sat
Minimization took 140 ms.
[2023-03-12 06:25:52] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-12 06:25:52] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 44 ms returned sat
[2023-03-12 06:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:53] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-12 06:25:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:25:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-12 06:25:53] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 27 ms returned sat
[2023-03-12 06:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:25:53] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2023-03-12 06:25:53] [INFO ] Computed and/alt/rep : 265/1057/265 causal constraints (skipped 427 transitions) in 35 ms.
[2023-03-12 06:25:56] [INFO ] Added : 155 causal constraints over 32 iterations in 2193 ms. Result :sat
Minimization took 335 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 709/709 transitions.
Applied a total of 0 rules in 31 ms. Remains 428 /428 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 428/428 places, 709/709 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 709/709 transitions.
Applied a total of 0 rules in 29 ms. Remains 428 /428 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2023-03-12 06:25:56] [INFO ] Invariant cache hit.
[2023-03-12 06:25:57] [INFO ] Implicit Places using invariants in 644 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 263, 274, 275, 276, 294, 296, 299, 317, 318, 319, 320, 332, 338, 344, 350, 356, 362, 368, 374, 380, 386, 392]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 661 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 390/428 places, 709/709 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 390 transition count 649
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 121 place count 330 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 329 transition count 648
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 122 place count 329 transition count 633
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 3 with 31 rules applied. Total rules applied 153 place count 313 transition count 633
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 165 place count 309 transition count 625
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 173 place count 301 transition count 625
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 188 place count 286 transition count 610
Iterating global reduction 5 with 15 rules applied. Total rules applied 203 place count 286 transition count 610
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 206 place count 286 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 206 place count 286 transition count 606
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 208 place count 285 transition count 606
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 211 place count 282 transition count 603
Iterating global reduction 6 with 3 rules applied. Total rules applied 214 place count 282 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 215 place count 281 transition count 602
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 281 transition count 602
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 280 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 280 transition count 601
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 266 place count 256 transition count 577
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 268 place count 256 transition count 575
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 270 place count 254 transition count 573
Iterating global reduction 7 with 2 rules applied. Total rules applied 272 place count 254 transition count 573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 274 place count 254 transition count 571
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 278 place count 254 transition count 567
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 283 place count 249 transition count 567
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 289 place count 249 transition count 567
Applied a total of 289 rules in 100 ms. Remains 249 /390 variables (removed 141) and now considering 567/709 (removed 142) transitions.
// Phase 1: matrix 567 rows 249 cols
[2023-03-12 06:25:57] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-12 06:25:57] [INFO ] Implicit Places using invariants in 251 ms returned [73, 91, 97, 100, 102, 105, 106, 158, 175, 181, 184, 186]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 260 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 237/428 places, 567/709 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 231 transition count 561
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 231 transition count 561
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 229 transition count 559
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 229 transition count 559
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 225 transition count 555
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 225 transition count 549
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 219 transition count 549
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 219 transition count 547
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 217 transition count 547
Applied a total of 40 rules in 85 ms. Remains 217 /237 variables (removed 20) and now considering 547/567 (removed 20) transitions.
// Phase 1: matrix 547 rows 217 cols
[2023-03-12 06:25:57] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-12 06:25:58] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-12 06:25:58] [INFO ] Invariant cache hit.
[2023-03-12 06:25:59] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 217/428 places, 547/709 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2242 ms. Remains : 217/428 places, 547/709 transitions.
Successfully produced net in file /tmp/petri1000_6924574155848034915.dot
Successfully produced net in file /tmp/petri1001_5787461983314562677.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 545 rows 217 cols
[2023-03-12 06:25:59] [INFO ] Computed 21 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 24141 resets, run finished after 1373 ms. (steps per millisecond=728 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9958 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10053 resets, run finished after 723 ms. (steps per millisecond=1383 ) properties (out of 2) seen :0
[2023-03-12 06:26:01] [INFO ] Invariant cache hit.
[2023-03-12 06:26:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-12 06:26:02] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 17 ms returned sat
[2023-03-12 06:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:02] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2023-03-12 06:26:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:26:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 06:26:02] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 106 ms returned sat
[2023-03-12 06:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:02] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-12 06:26:02] [INFO ] Computed and/alt/rep : 92/514/92 causal constraints (skipped 439 transitions) in 89 ms.
[2023-03-12 06:26:03] [INFO ] Added : 9 causal constraints over 2 iterations in 245 ms. Result :sat
Minimization took 81 ms.
[2023-03-12 06:26:03] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-12 06:26:03] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 29 ms returned sat
[2023-03-12 06:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:03] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-12 06:26:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:26:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 06:26:03] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-12 06:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:04] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-12 06:26:04] [INFO ] Computed and/alt/rep : 92/514/92 causal constraints (skipped 439 transitions) in 33 ms.
[2023-03-12 06:26:04] [INFO ] Added : 37 causal constraints over 8 iterations in 381 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 545/545 transitions.
Graph (complete) has 1349 edges and 217 vertex of which 215 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 215 transition count 545
Applied a total of 3 rules in 39 ms. Remains 215 /217 variables (removed 2) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 215/217 places, 545/545 transitions.
// Phase 1: matrix 545 rows 215 cols
[2023-03-12 06:26:04] [INFO ] Computed 21 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 23981 resets, run finished after 1507 ms. (steps per millisecond=663 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10014 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 10053 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 2) seen :0
[2023-03-12 06:26:07] [INFO ] Invariant cache hit.
[2023-03-12 06:26:07] [INFO ] [Real]Absence check using 7 positive place invariants in 48 ms returned sat
[2023-03-12 06:26:08] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 32 ms returned sat
[2023-03-12 06:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:08] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2023-03-12 06:26:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:26:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 62 ms returned sat
[2023-03-12 06:26:08] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 98 ms returned sat
[2023-03-12 06:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:08] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-03-12 06:26:08] [INFO ] Computed and/alt/rep : 92/512/92 causal constraints (skipped 439 transitions) in 68 ms.
[2023-03-12 06:26:09] [INFO ] Added : 8 causal constraints over 2 iterations in 159 ms. Result :sat
Minimization took 88 ms.
[2023-03-12 06:26:09] [INFO ] [Real]Absence check using 7 positive place invariants in 28 ms returned sat
[2023-03-12 06:26:09] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-12 06:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:09] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-12 06:26:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:26:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2023-03-12 06:26:09] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 19 ms returned sat
[2023-03-12 06:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:09] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2023-03-12 06:26:09] [INFO ] Computed and/alt/rep : 92/512/92 causal constraints (skipped 439 transitions) in 50 ms.
[2023-03-12 06:26:10] [INFO ] Added : 15 causal constraints over 3 iterations in 305 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 545/545 transitions.
Applied a total of 0 rules in 23 ms. Remains 215 /215 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 215/215 places, 545/545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 545/545 transitions.
Applied a total of 0 rules in 7 ms. Remains 215 /215 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2023-03-12 06:26:10] [INFO ] Invariant cache hit.
[2023-03-12 06:26:11] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-12 06:26:11] [INFO ] Invariant cache hit.
[2023-03-12 06:26:11] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2023-03-12 06:26:11] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-12 06:26:11] [INFO ] Invariant cache hit.
[2023-03-12 06:26:11] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1474 ms. Remains : 215/215 places, 545/545 transitions.
Starting property specific reduction for ASLink-PT-02a-UpperBounds-11
[2023-03-12 06:26:12] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-12 06:26:12] [INFO ] Invariant cache hit.
[2023-03-12 06:26:12] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned sat
[2023-03-12 06:26:12] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 47 ms returned sat
[2023-03-12 06:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:12] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-12 06:26:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:26:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 06:26:12] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-12 06:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:12] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-12 06:26:12] [INFO ] Computed and/alt/rep : 92/512/92 causal constraints (skipped 439 transitions) in 60 ms.
[2023-03-12 06:26:13] [INFO ] Added : 8 causal constraints over 2 iterations in 249 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 545/545 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 215 transition count 544
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 214 transition count 544
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 214 transition count 544
Applied a total of 3 rules in 59 ms. Remains 214 /215 variables (removed 1) and now considering 544/545 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 214/215 places, 544/545 transitions.
// Phase 1: matrix 544 rows 214 cols
[2023-03-12 06:26:13] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 23955 resets, run finished after 1584 ms. (steps per millisecond=631 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10129 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 1) seen :0
[2023-03-12 06:26:15] [INFO ] Invariant cache hit.
[2023-03-12 06:26:15] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 06:26:15] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-12 06:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:15] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-12 06:26:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:26:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 06:26:15] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-12 06:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:16] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-12 06:26:16] [INFO ] Computed and/alt/rep : 91/510/91 causal constraints (skipped 439 transitions) in 46 ms.
[2023-03-12 06:26:16] [INFO ] Added : 12 causal constraints over 3 iterations in 225 ms. Result :sat
Minimization took 77 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 7 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 7 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 5 ms. Remains 214 /214 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2023-03-12 06:26:16] [INFO ] Invariant cache hit.
[2023-03-12 06:26:16] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 06:26:16] [INFO ] Invariant cache hit.
[2023-03-12 06:26:17] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2023-03-12 06:26:17] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 06:26:17] [INFO ] Invariant cache hit.
[2023-03-12 06:26:17] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1219 ms. Remains : 214/214 places, 544/544 transitions.
Ending property specific reduction for ASLink-PT-02a-UpperBounds-11 in 5752 ms.
Starting property specific reduction for ASLink-PT-02a-UpperBounds-14
// Phase 1: matrix 545 rows 215 cols
[2023-03-12 06:26:17] [INFO ] Computed 21 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 237 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-12 06:26:17] [INFO ] Invariant cache hit.
[2023-03-12 06:26:17] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 06:26:17] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-12 06:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:18] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-12 06:26:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:26:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 06:26:18] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-12 06:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:18] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2023-03-12 06:26:18] [INFO ] Computed and/alt/rep : 92/512/92 causal constraints (skipped 439 transitions) in 64 ms.
[2023-03-12 06:26:18] [INFO ] Added : 15 causal constraints over 3 iterations in 323 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 545/545 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 215 transition count 544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 214 transition count 544
Applied a total of 2 rules in 7 ms. Remains 214 /215 variables (removed 1) and now considering 544/545 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 214/215 places, 544/545 transitions.
// Phase 1: matrix 544 rows 214 cols
[2023-03-12 06:26:18] [INFO ] Computed 21 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 23998 resets, run finished after 1222 ms. (steps per millisecond=818 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 10019 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 1) seen :0
[2023-03-12 06:26:20] [INFO ] Invariant cache hit.
[2023-03-12 06:26:20] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 06:26:20] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-12 06:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:21] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-12 06:26:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:26:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 06:26:21] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 12 ms returned sat
[2023-03-12 06:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:26:21] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-03-12 06:26:21] [INFO ] Computed and/alt/rep : 91/511/91 causal constraints (skipped 439 transitions) in 65 ms.
[2023-03-12 06:26:21] [INFO ] Added : 15 causal constraints over 3 iterations in 294 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 544/544 transitions.
Applied a total of 0 rules in 5 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 5 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 5 ms. Remains 214 /214 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2023-03-12 06:26:21] [INFO ] Invariant cache hit.
[2023-03-12 06:26:22] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-12 06:26:22] [INFO ] Invariant cache hit.
[2023-03-12 06:26:22] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2023-03-12 06:26:22] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-12 06:26:22] [INFO ] Invariant cache hit.
[2023-03-12 06:26:23] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1291 ms. Remains : 214/214 places, 544/544 transitions.
Ending property specific reduction for ASLink-PT-02a-UpperBounds-14 in 5438 ms.
[2023-03-12 06:26:23] [INFO ] Flatten gal took : 79 ms
[2023-03-12 06:26:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 06:26:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 215 places, 545 transitions and 2223 arcs took 3 ms.
Total runtime 66915 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/659/ub_0_ --maxsum=/tmp/659/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8172608 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096972 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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="ltsminxred"
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 ltsminxred"
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 r009-oct2-167813597300029"
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 ;