Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 436K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-04a-UpperBounds-00
FORMULA_NAME ASLink-PT-04a-UpperBounds-01
FORMULA_NAME ASLink-PT-04a-UpperBounds-02
FORMULA_NAME ASLink-PT-04a-UpperBounds-03
FORMULA_NAME ASLink-PT-04a-UpperBounds-04
FORMULA_NAME ASLink-PT-04a-UpperBounds-05
FORMULA_NAME ASLink-PT-04a-UpperBounds-06
FORMULA_NAME ASLink-PT-04a-UpperBounds-07
FORMULA_NAME ASLink-PT-04a-UpperBounds-08
FORMULA_NAME ASLink-PT-04a-UpperBounds-09
FORMULA_NAME ASLink-PT-04a-UpperBounds-10
FORMULA_NAME ASLink-PT-04a-UpperBounds-11
FORMULA_NAME ASLink-PT-04a-UpperBounds-12
FORMULA_NAME ASLink-PT-04a-UpperBounds-13
FORMULA_NAME ASLink-PT-04a-UpperBounds-14
FORMULA_NAME ASLink-PT-04a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717192318136

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-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:51:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:51:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:52:00] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2024-05-31 21:52:00] [INFO ] Transformed 1016 places.
[2024-05-31 21:52:00] [INFO ] Transformed 1554 transitions.
[2024-05-31 21:52:00] [INFO ] Found NUPN structural information;
[2024-05-31 21:52:00] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 539 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1538 rows 1016 cols
[2024-05-31 21:52:00] [INFO ] Computed 194 invariants in 130 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (68 resets) in 95 ms. (104 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (48 resets) in 101 ms. (392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-31 21:52:00] [INFO ] Invariant cache hit.
[2024-05-31 21:52:01] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2024-05-31 21:52:01] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 69 ms returned sat
[2024-05-31 21:52:02] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2024-05-31 21:52:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:52:03] [INFO ] [Nat]Absence check using 46 positive place invariants in 41 ms returned sat
[2024-05-31 21:52:03] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 72 ms returned sat
[2024-05-31 21:52:04] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2024-05-31 21:52:04] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 191 ms.
[2024-05-31 21:52:07] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:52:08] [INFO ] [Real]Absence check using 46 positive place invariants in 39 ms returned sat
[2024-05-31 21:52:08] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 67 ms returned sat
[2024-05-31 21:52:09] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2024-05-31 21:52:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:52:09] [INFO ] [Nat]Absence check using 46 positive place invariants in 34 ms returned sat
[2024-05-31 21:52:09] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 65 ms returned sat
[2024-05-31 21:52:10] [INFO ] [Nat]Absence check using state equation in 995 ms returned sat
[2024-05-31 21:52:10] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 162 ms.
Maximisation of solution failed !
Minimization took 7 ms.
[2024-05-31 21:52:14] [INFO ] [Real]Absence check using 46 positive place invariants in 32 ms returned sat
[2024-05-31 21:52:14] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 66 ms returned sat
[2024-05-31 21:52:15] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2024-05-31 21:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:52:16] [INFO ] [Nat]Absence check using 46 positive place invariants in 37 ms returned sat
[2024-05-31 21:52:16] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 79 ms returned sat
[2024-05-31 21:52:16] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2024-05-31 21:52:17] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 120 ms.
[2024-05-31 21:52:20] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:52:20] [INFO ] [Real]Absence check using 46 positive place invariants in 34 ms returned sat
[2024-05-31 21:52:21] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 67 ms returned sat
[2024-05-31 21:52:21] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2024-05-31 21:52:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:52:22] [INFO ] [Nat]Absence check using 46 positive place invariants in 34 ms returned sat
[2024-05-31 21:52:22] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 68 ms returned sat
[2024-05-31 21:52:23] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2024-05-31 21:52:23] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 120 ms.
[2024-05-31 21:52:26] [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 3
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 992 transition count 1451
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 198 place count 905 transition count 1451
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 198 place count 905 transition count 1363
Deduced a syphon composed of 88 places in 3 ms
Ensure Unique test removed 34 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 408 place count 783 transition count 1363
Drop transitions (Trivial Post-Agglo cleanup.) 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 409 place count 783 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 410 place count 782 transition count 1362
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 416 place count 776 transition count 1333
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 423 place count 775 transition count 1333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 429 place count 774 transition count 1328
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 432 place count 771 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 433 place count 770 transition count 1320
Iterating global reduction 6 with 1 rules applied. Total rules applied 434 place count 770 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 435 place count 769 transition count 1312
Iterating global reduction 6 with 1 rules applied. Total rules applied 436 place count 769 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 437 place count 768 transition count 1304
Iterating global reduction 6 with 1 rules applied. Total rules applied 438 place count 768 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 439 place count 767 transition count 1296
Iterating global reduction 6 with 1 rules applied. Total rules applied 440 place count 767 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 441 place count 766 transition count 1288
Iterating global reduction 6 with 1 rules applied. Total rules applied 442 place count 766 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 443 place count 765 transition count 1280
Iterating global reduction 6 with 1 rules applied. Total rules applied 444 place count 765 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 445 place count 764 transition count 1272
Iterating global reduction 6 with 1 rules applied. Total rules applied 446 place count 764 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 447 place count 763 transition count 1264
Iterating global reduction 6 with 1 rules applied. Total rules applied 448 place count 763 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 449 place count 762 transition count 1256
Iterating global reduction 6 with 1 rules applied. Total rules applied 450 place count 762 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 451 place count 761 transition count 1248
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 761 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 453 place count 760 transition count 1240
Iterating global reduction 6 with 1 rules applied. Total rules applied 454 place count 760 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 455 place count 759 transition count 1232
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 759 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 457 place count 758 transition count 1224
Iterating global reduction 6 with 1 rules applied. Total rules applied 458 place count 758 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 459 place count 757 transition count 1216
Iterating global reduction 6 with 1 rules applied. Total rules applied 460 place count 757 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 461 place count 756 transition count 1208
Iterating global reduction 6 with 1 rules applied. Total rules applied 462 place count 756 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 463 place count 755 transition count 1200
Iterating global reduction 6 with 1 rules applied. Total rules applied 464 place count 755 transition count 1200
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 520 place count 727 transition count 1172
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 523 place count 727 transition count 1169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 526 place count 724 transition count 1169
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 530 place count 724 transition count 1169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 531 place count 723 transition count 1168
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 538 place count 716 transition count 1168
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 15 Pre rules applied. Total rules applied 538 place count 716 transition count 1153
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 31 rules applied. Total rules applied 569 place count 700 transition count 1153
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 573 place count 696 transition count 1153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 573 place count 696 transition count 1152
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 575 place count 695 transition count 1152
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 583 place count 691 transition count 1148
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 586 place count 688 transition count 1145
Iterating global reduction 9 with 3 rules applied. Total rules applied 589 place count 688 transition count 1145
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 592 place count 688 transition count 1142
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 596 place count 685 transition count 1141
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 598 place count 685 transition count 1141
Applied a total of 598 rules in 1370 ms. Remains 685 /1016 variables (removed 331) and now considering 1141/1538 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1385 ms. Remains : 685/1016 places, 1141/1538 transitions.
// Phase 1: matrix 1141 rows 685 cols
[2024-05-31 21:52:28] [INFO ] Computed 122 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (11735 resets) in 3019 ms. (331 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (8485 resets) in 3722 ms. (805 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-31 21:52:35] [INFO ] Invariant cache hit.
[2024-05-31 21:52:35] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2024-05-31 21:52:35] [INFO ] [Real]Absence check using 30 positive and 92 generalized place invariants in 39 ms returned sat
[2024-05-31 21:52:35] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2024-05-31 21:52:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:52:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2024-05-31 21:52:36] [INFO ] [Nat]Absence check using 30 positive and 92 generalized place invariants in 36 ms returned sat
[2024-05-31 21:52:36] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2024-05-31 21:52:36] [INFO ] Computed and/alt/rep : 451/1730/451 causal constraints (skipped 663 transitions) in 89 ms.
[2024-05-31 21:52:41] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 17 ms to minimize.
[2024-05-31 21:52:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2024-05-31 21:52:41] [INFO ] Added : 309 causal constraints over 63 iterations in 5188 ms. Result :sat
Minimization took 1270 ms.
[2024-05-31 21:52:43] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-31 21:52:43] [INFO ] [Real]Absence check using 30 positive and 92 generalized place invariants in 40 ms returned sat
[2024-05-31 21:52:43] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2024-05-31 21:52:43] [INFO ] Computed and/alt/rep : 451/1730/451 causal constraints (skipped 663 transitions) in 81 ms.
[2024-05-31 21:52:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:52:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-31 21:52:44] [INFO ] [Nat]Absence check using 30 positive and 92 generalized place invariants in 39 ms returned sat
[2024-05-31 21:52:44] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-05-31 21:52:44] [INFO ] Computed and/alt/rep : 451/1730/451 causal constraints (skipped 663 transitions) in 87 ms.
[2024-05-31 21:52:50] [INFO ] Deduced a trap composed of 111 places in 303 ms of which 5 ms to minimize.
[2024-05-31 21:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2024-05-31 21:52:50] [INFO ] Added : 328 causal constraints over 66 iterations in 5691 ms. Result :sat
Minimization took 1260 ms.
[2024-05-31 21:52:52] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-31 21:52:52] [INFO ] [Real]Absence check using 30 positive and 92 generalized place invariants in 36 ms returned sat
[2024-05-31 21:52:52] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2024-05-31 21:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:52:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-31 21:52:52] [INFO ] [Nat]Absence check using 30 positive and 92 generalized place invariants in 36 ms returned sat
[2024-05-31 21:52:53] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-31 21:52:53] [INFO ] Computed and/alt/rep : 451/1730/451 causal constraints (skipped 663 transitions) in 77 ms.
[2024-05-31 21:52:58] [INFO ] Added : 304 causal constraints over 62 iterations in 5046 ms. Result :sat
Minimization took 1346 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1141/1141 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 685 transition count 1140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 683 transition count 1140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 683 transition count 1139
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 682 transition count 1139
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 681 transition count 1139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 680 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 679 transition count 1137
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 679 transition count 1137
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 679 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 678 transition count 1136
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 13 place count 678 transition count 1136
Applied a total of 13 rules in 143 ms. Remains 678 /685 variables (removed 7) and now considering 1136/1141 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 678/685 places, 1136/1141 transitions.
// Phase 1: matrix 1136 rows 678 cols
[2024-05-31 21:53:01] [INFO ] Computed 120 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (12971 resets) in 2605 ms. (383 steps per ms)
BEST_FIRST walk for 3000002 steps (8979 resets) in 3582 ms. (837 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-31 21:53:07] [INFO ] Invariant cache hit.
[2024-05-31 21:53:07] [INFO ] [Real]Absence check using 29 positive place invariants in 16 ms returned sat
[2024-05-31 21:53:07] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 38 ms returned sat
[2024-05-31 21:53:08] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2024-05-31 21:53:08] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 94 ms.
[2024-05-31 21:53:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:08] [INFO ] [Nat]Absence check using 29 positive place invariants in 20 ms returned sat
[2024-05-31 21:53:08] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 40 ms returned sat
[2024-05-31 21:53:09] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2024-05-31 21:53:09] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 103 ms.
[2024-05-31 21:53:14] [INFO ] Added : 356 causal constraints over 72 iterations in 5655 ms. Result :sat
Minimization took 1065 ms.
[2024-05-31 21:53:16] [INFO ] [Real]Absence check using 29 positive place invariants in 16 ms returned sat
[2024-05-31 21:53:16] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 36 ms returned sat
[2024-05-31 21:53:16] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-05-31 21:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:16] [INFO ] [Nat]Absence check using 29 positive place invariants in 17 ms returned sat
[2024-05-31 21:53:16] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 37 ms returned sat
[2024-05-31 21:53:17] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2024-05-31 21:53:17] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-31 21:53:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2024-05-31 21:53:17] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 85 ms.
[2024-05-31 21:53:22] [INFO ] Added : 328 causal constraints over 66 iterations in 5306 ms. Result :sat
Minimization took 1090 ms.
[2024-05-31 21:53:24] [INFO ] [Real]Absence check using 29 positive place invariants in 17 ms returned sat
[2024-05-31 21:53:24] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 38 ms returned sat
[2024-05-31 21:53:24] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2024-05-31 21:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:24] [INFO ] [Nat]Absence check using 29 positive place invariants in 16 ms returned sat
[2024-05-31 21:53:24] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 27 ms returned sat
[2024-05-31 21:53:25] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2024-05-31 21:53:25] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 84 ms.
[2024-05-31 21:53:30] [INFO ] Added : 352 causal constraints over 71 iterations in 5462 ms. Result :sat
Minimization took 1154 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1136/1136 transitions.
Applied a total of 0 rules in 39 ms. Remains 678 /678 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 678/678 places, 1136/1136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1136/1136 transitions.
Applied a total of 0 rules in 28 ms. Remains 678 /678 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
[2024-05-31 21:53:33] [INFO ] Invariant cache hit.
[2024-05-31 21:53:34] [INFO ] Implicit Places using invariants in 916 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 169, 187, 206, 225, 258, 263, 264, 275, 276, 277, 295, 313, 382, 386, 387, 398, 399, 400, 418, 436, 505, 509, 510, 513, 524, 525, 526, 544, 546, 549, 567, 568, 569, 570, 582, 588, 594, 600, 606, 612, 618, 624, 630, 636, 642]
[2024-05-31 21:53:34] [INFO ] Actually due to overlaps returned [544, 526, 30, 48, 169, 277, 295, 400, 418, 549, 149, 276, 399, 525, 568, 148, 275, 398, 524, 546, 567, 0, 263, 264, 386, 387, 509, 510, 18, 19, 66, 313, 436, 570, 612, 630, 642, 187, 206, 258, 513, 569, 582, 588, 594, 600, 606, 618, 624, 636]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 922 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 628/678 places, 1136/1136 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 624 transition count 1053
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 171 place count 541 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 540 transition count 1052
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 172 place count 540 transition count 1028
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 221 place count 515 transition count 1028
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 233 place count 511 transition count 1020
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 241 place count 503 transition count 1020
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 256 place count 488 transition count 1005
Iterating global reduction 5 with 15 rules applied. Total rules applied 271 place count 488 transition count 1005
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 274 place count 488 transition count 1002
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 274 place count 488 transition count 1001
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 276 place count 487 transition count 1001
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 279 place count 484 transition count 998
Iterating global reduction 6 with 3 rules applied. Total rules applied 282 place count 484 transition count 998
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 483 transition count 997
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 483 transition count 997
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 285 place count 482 transition count 996
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 482 transition count 996
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 366 place count 442 transition count 956
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 369 place count 442 transition count 953
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 373 place count 438 transition count 948
Iterating global reduction 7 with 4 rules applied. Total rules applied 377 place count 438 transition count 948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 380 place count 438 transition count 945
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 381 place count 438 transition count 944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 382 place count 437 transition count 944
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 390 place count 437 transition count 936
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 399 place count 428 transition count 936
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 412 place count 428 transition count 936
Applied a total of 412 rules in 172 ms. Remains 428 /628 variables (removed 200) and now considering 936/1136 (removed 200) transitions.
// Phase 1: matrix 936 rows 428 cols
[2024-05-31 21:53:34] [INFO ] Computed 60 invariants in 11 ms
[2024-05-31 21:53:34] [INFO ] Implicit Places using invariants in 551 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 181, 187, 190, 192, 197, 198, 250, 268, 274, 277, 279, 284, 285, 337, 354, 360, 363, 365]
[2024-05-31 21:53:34] [INFO ] Actually due to overlaps returned [104, 197, 284, 105, 198, 285, 89, 95, 100, 101, 181, 187, 192, 268, 274, 279, 354, 360, 365, 72, 250, 337]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 554 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 406/678 places, 936/1136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 390 transition count 920
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 390 transition count 920
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 386 transition count 916
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 386 transition count 916
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 54 place count 379 transition count 909
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 379 transition count 897
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 78 place count 367 transition count 897
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 367 transition count 894
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 364 transition count 894
Applied a total of 84 rules in 73 ms. Remains 364 /406 variables (removed 42) and now considering 894/936 (removed 42) transitions.
// Phase 1: matrix 894 rows 364 cols
[2024-05-31 21:53:35] [INFO ] Computed 38 invariants in 9 ms
[2024-05-31 21:53:35] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-31 21:53:35] [INFO ] Invariant cache hit.
[2024-05-31 21:53:36] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 364/678 places, 894/1136 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3222 ms. Remains : 364/678 places, 894/1136 transitions.
[2024-05-31 21:53:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-04a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (19620 resets) in 1971 ms. (507 steps per ms)
BEST_FIRST walk for 2000002 steps (11566 resets) in 1696 ms. (1178 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-31 21:53:40] [INFO ] Invariant cache hit.
[2024-05-31 21:53:40] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-31 21:53:40] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-31 21:53:40] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2024-05-31 21:53:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-31 21:53:40] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-31 21:53:41] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-05-31 21:53:41] [INFO ] Computed and/alt/rep : 193/933/193 causal constraints (skipped 679 transitions) in 66 ms.
[2024-05-31 21:53:41] [INFO ] Added : 11 causal constraints over 3 iterations in 276 ms. Result :sat
Minimization took 470 ms.
[2024-05-31 21:53:41] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-31 21:53:41] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-31 21:53:42] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2024-05-31 21:53:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-31 21:53:42] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-31 21:53:42] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2024-05-31 21:53:42] [INFO ] Computed and/alt/rep : 193/933/193 causal constraints (skipped 679 transitions) in 66 ms.
[2024-05-31 21:53:43] [INFO ] Added : 23 causal constraints over 5 iterations in 382 ms. Result :sat
Minimization took 479 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 894/894 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 363 transition count 889
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 363 transition count 889
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 363 transition count 888
Applied a total of 3 rules in 24 ms. Remains 363 /364 variables (removed 1) and now considering 888/894 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 363/364 places, 888/894 transitions.
// Phase 1: matrix 888 rows 363 cols
[2024-05-31 21:53:43] [INFO ] Computed 38 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (19528 resets) in 1962 ms. (509 steps per ms)
BEST_FIRST walk for 2000002 steps (11554 resets) in 1697 ms. (1177 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-31 21:53:47] [INFO ] Invariant cache hit.
[2024-05-31 21:53:47] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:53:47] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-31 21:53:47] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-05-31 21:53:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:53:48] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-31 21:53:48] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-31 21:53:48] [INFO ] Computed and/alt/rep : 191/943/191 causal constraints (skipped 675 transitions) in 65 ms.
[2024-05-31 21:53:48] [INFO ] Added : 11 causal constraints over 3 iterations in 287 ms. Result :sat
Minimization took 542 ms.
[2024-05-31 21:53:49] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:53:49] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-31 21:53:49] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-05-31 21:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:53:49] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 18 ms returned sat
[2024-05-31 21:53:50] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2024-05-31 21:53:50] [INFO ] Computed and/alt/rep : 191/943/191 causal constraints (skipped 675 transitions) in 68 ms.
[2024-05-31 21:53:50] [INFO ] Added : 28 causal constraints over 8 iterations in 667 ms. Result :sat
Minimization took 610 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 888/888 transitions.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 363/363 places, 888/888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 888/888 transitions.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2024-05-31 21:53:51] [INFO ] Invariant cache hit.
[2024-05-31 21:53:52] [INFO ] Implicit Places using invariants in 444 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 362/363 places, 888/888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 362 transition count 884
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 358 transition count 884
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 357 transition count 883
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 357 transition count 882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 356 transition count 882
Applied a total of 12 rules in 36 ms. Remains 356 /362 variables (removed 6) and now considering 882/888 (removed 6) transitions.
// Phase 1: matrix 882 rows 356 cols
[2024-05-31 21:53:52] [INFO ] Computed 37 invariants in 9 ms
[2024-05-31 21:53:52] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-31 21:53:52] [INFO ] Invariant cache hit.
[2024-05-31 21:53:53] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 356/363 places, 882/888 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2068 ms. Remains : 356/363 places, 882/888 transitions.
[2024-05-31 21:53:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (19643 resets) in 2011 ms. (497 steps per ms)
BEST_FIRST walk for 2000000 steps (11466 resets) in 1742 ms. (1147 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-31 21:53:57] [INFO ] Invariant cache hit.
[2024-05-31 21:53:57] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 21:53:57] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 21:53:58] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2024-05-31 21:53:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:53:58] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-31 21:53:58] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2024-05-31 21:53:58] [INFO ] Computed and/alt/rep : 179/851/179 causal constraints (skipped 681 transitions) in 71 ms.
[2024-05-31 21:53:59] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 2 ms to minimize.
[2024-05-31 21:53:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2024-05-31 21:53:59] [INFO ] Added : 42 causal constraints over 9 iterations in 865 ms. Result :sat
Minimization took 498 ms.
[2024-05-31 21:54:00] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:54:00] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 21:54:00] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-31 21:54:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:54:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:54:00] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-31 21:54:00] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-05-31 21:54:00] [INFO ] Computed and/alt/rep : 179/851/179 causal constraints (skipped 681 transitions) in 68 ms.
[2024-05-31 21:54:01] [INFO ] Added : 14 causal constraints over 3 iterations in 286 ms. Result :sat
Minimization took 461 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 882/882 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 356/356 places, 882/882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 882/882 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2024-05-31 21:54:01] [INFO ] Invariant cache hit.
[2024-05-31 21:54:02] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-05-31 21:54:02] [INFO ] Invariant cache hit.
[2024-05-31 21:54:03] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2024-05-31 21:54:03] [INFO ] Redundant transitions in 57 ms returned []
Running 860 sub problems to find dead transitions.
[2024-05-31 21:54:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 860 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/1238 variables, and 37 constraints, problems are : Problem set: 0 solved, 860 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 860/860 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 860 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 860 unsolved
[2024-05-31 21:54:55] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-31 21:54:58] [INFO ] Deduced a trap composed of 77 places in 319 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 860 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1238 variables, and 39 constraints, problems are : Problem set: 0 solved, 860 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 0/860 constraints, Known Traps: 2/2 constraints]
After SMT, in 60861ms problems are : Problem set: 0 solved, 860 unsolved
Search for dead transitions found 0 dead transitions in 60902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62552 ms. Remains : 356/356 places, 882/882 transitions.
RANDOM walk for 40000 steps (789 resets) in 1311 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (235 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (232 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (228 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (234 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 188321 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 4
Probabilistic random walk after 188321 steps, saw 116773 distinct states, run finished after 3006 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-31 21:55:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 134/136 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/148 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/161 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/194 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 128/322 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 18/340 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 882/1238 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1238 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1238 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1238/1238 variables, and 393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 134/136 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/148 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/161 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/194 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 128/322 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 18/340 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:55:09] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 16/356 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/356 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 882/1238 variables, 356/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1238 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1238 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1238 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1238/1238 variables, and 398 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1946ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 771 ms.
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 882/882 transitions.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 356/356 places, 882/882 transitions.
RANDOM walk for 40000 steps (823 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (230 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (233 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (224 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (228 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 187404 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 4
Probabilistic random walk after 187404 steps, saw 116124 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-31 21:55:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 134/136 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/148 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/161 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/194 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 128/322 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 18/340 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 882/1238 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1238 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1238 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1238/1238 variables, and 393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 134/136 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/148 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/161 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/194 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 128/322 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 18/340 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:55:15] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 16/356 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/356 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 882/1238 variables, 356/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1238 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1238 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1238 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1238/1238 variables, and 398 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 412 ms.
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 882/882 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 356/356 places, 882/882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 882/882 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2024-05-31 21:55:16] [INFO ] Invariant cache hit.
[2024-05-31 21:55:17] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-31 21:55:17] [INFO ] Invariant cache hit.
[2024-05-31 21:55:18] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
[2024-05-31 21:55:18] [INFO ] Redundant transitions in 92 ms returned []
Running 860 sub problems to find dead transitions.
[2024-05-31 21:55:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 860 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/1238 variables, and 37 constraints, problems are : Problem set: 0 solved, 860 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 860/860 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 860 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 860 unsolved
[2024-05-31 21:56:09] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 4 ms to minimize.
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 77 places in 337 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 860 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1238 variables, and 39 constraints, problems are : Problem set: 0 solved, 860 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 0/860 constraints, Known Traps: 2/2 constraints]
After SMT, in 60603ms problems are : Problem set: 0 solved, 860 unsolved
Search for dead transitions found 0 dead transitions in 60616ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62304 ms. Remains : 356/356 places, 882/882 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-31 21:56:18] [INFO ] Invariant cache hit.
[2024-05-31 21:56:19] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 21:56:19] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-31 21:56:19] [INFO ] After 478ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 21:56:19] [INFO ] After 687ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
[2024-05-31 21:56:19] [INFO ] After 953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 979 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for ASLink-PT-04a-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:56:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (201 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (60 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:56:19] [INFO ] Invariant cache hit.
[2024-05-31 21:56:20] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:56:20] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 21:56:20] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2024-05-31 21:56:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:56:20] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 21:56:20] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2024-05-31 21:56:20] [INFO ] Computed and/alt/rep : 179/851/179 causal constraints (skipped 681 transitions) in 65 ms.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-05-31 21:56:21] [INFO ] Added : 42 causal constraints over 9 iterations in 857 ms. Result :sat
Minimization took 489 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p494) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 881/881 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2198 edges and 355 vertex of which 354 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 354 transition count 879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 879
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 353 transition count 878
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 352 transition count 878
Applied a total of 6 rules in 30 ms. Remains 352 /356 variables (removed 4) and now considering 878/881 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 352/356 places, 878/881 transitions.
// Phase 1: matrix 878 rows 352 cols
[2024-05-31 21:56:22] [INFO ] Computed 36 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (19562 resets) in 1941 ms. (514 steps per ms)
BEST_FIRST walk for 1000000 steps (5808 resets) in 836 ms. (1194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:56:25] [INFO ] Invariant cache hit.
[2024-05-31 21:56:25] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 21:56:25] [INFO ] [Real]Absence check using 11 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 21:56:25] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-05-31 21:56:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:56:25] [INFO ] [Nat]Absence check using 11 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 21:56:25] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2024-05-31 21:56:26] [INFO ] Computed and/alt/rep : 175/846/175 causal constraints (skipped 681 transitions) in 63 ms.
[2024-05-31 21:56:26] [INFO ] Added : 58 causal constraints over 12 iterations in 724 ms. Result :sat
Minimization took 546 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 878/878 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 878/878 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 352/352 places, 878/878 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 878/878 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2024-05-31 21:56:27] [INFO ] Invariant cache hit.
[2024-05-31 21:56:27] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-31 21:56:27] [INFO ] Invariant cache hit.
[2024-05-31 21:56:28] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
[2024-05-31 21:56:28] [INFO ] Redundant transitions in 9 ms returned []
Running 856 sub problems to find dead transitions.
[2024-05-31 21:56:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 3 (OVERLAPS) 2/352 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1230 variables, and 36 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/352 constraints, PredecessorRefiner: 856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 3 (OVERLAPS) 2/352 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 856 unsolved
[2024-05-31 21:57:18] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-31 21:57:21] [INFO ] Deduced a trap composed of 76 places in 319 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1230 variables, and 38 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/352 constraints, PredecessorRefiner: 0/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 856 unsolved
Search for dead transitions found 0 dead transitions in 60565ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62168 ms. Remains : 352/352 places, 878/878 transitions.
RANDOM walk for 40000 steps (821 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (225 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (227 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 289763 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 289763 steps, saw 176114 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-31 21:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/206 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/245 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:57:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 106/351 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 878/1229 variables, 351/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1229 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1230 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1230 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1230 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/206 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/245 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 106/351 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 878/1229 variables, 351/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1229 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1229 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1230 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1230 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1230 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 391 constraints, problems are : Problem set: 0 solved, 2 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1332ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 878/878 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 878/878 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 878/878 transitions.
RANDOM walk for 40000 steps (782 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (231 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (237 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 303730 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 2
Probabilistic random walk after 303730 steps, saw 181201 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2024-05-31 21:57:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/206 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/245 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:57:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 106/351 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 878/1229 variables, 351/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1229 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1230 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1230 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1230 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/206 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/245 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 106/351 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 878/1229 variables, 351/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1229 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1229 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1230 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1230 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1230 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 391 constraints, problems are : Problem set: 0 solved, 2 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1210ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 878/878 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 878/878 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 878/878 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 878/878 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2024-05-31 21:57:38] [INFO ] Invariant cache hit.
[2024-05-31 21:57:38] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-31 21:57:38] [INFO ] Invariant cache hit.
[2024-05-31 21:57:39] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2024-05-31 21:57:40] [INFO ] Redundant transitions in 8 ms returned []
Running 856 sub problems to find dead transitions.
[2024-05-31 21:57:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 3 (OVERLAPS) 2/352 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1230 variables, and 36 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/352 constraints, PredecessorRefiner: 856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 3 (OVERLAPS) 2/352 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 856 unsolved
[2024-05-31 21:58:29] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-31 21:58:32] [INFO ] Deduced a trap composed of 76 places in 312 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1230 variables, and 38 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/352 constraints, PredecessorRefiner: 0/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 60496ms problems are : Problem set: 0 solved, 856 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61969 ms. Remains : 352/352 places, 878/878 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 878/878 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-31 21:58:40] [INFO ] Invariant cache hit.
[2024-05-31 21:58:40] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 21:58:40] [INFO ] [Real]Absence check using 11 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 21:58:41] [INFO ] After 400ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 21:58:41] [INFO ] After 497ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-31 21:58:41] [INFO ] After 672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 692 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-04a-UpperBounds-03 in 141321 ms.
Starting property specific reduction for ASLink-PT-04a-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 882 rows 356 cols
[2024-05-31 21:58:41] [INFO ] Computed 37 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (192 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (53 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:58:41] [INFO ] Invariant cache hit.
[2024-05-31 21:58:41] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-31 21:58:41] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 10 ms returned sat
[2024-05-31 21:58:41] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-05-31 21:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:58:41] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 10 ms returned sat
[2024-05-31 21:58:42] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-05-31 21:58:42] [INFO ] Computed and/alt/rep : 179/851/179 causal constraints (skipped 681 transitions) in 66 ms.
[2024-05-31 21:58:42] [INFO ] Added : 14 causal constraints over 3 iterations in 263 ms. Result :sat
Minimization took 450 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p311) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 881/881 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2199 edges and 355 vertex of which 354 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 354 transition count 879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 879
Applied a total of 4 rules in 16 ms. Remains 353 /356 variables (removed 3) and now considering 879/881 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 353/356 places, 879/881 transitions.
// Phase 1: matrix 879 rows 353 cols
[2024-05-31 21:58:43] [INFO ] Computed 36 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (19613 resets) in 1920 ms. (520 steps per ms)
BEST_FIRST walk for 1000001 steps (5768 resets) in 831 ms. (1201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:58:45] [INFO ] Invariant cache hit.
[2024-05-31 21:58:45] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-31 21:58:45] [INFO ] [Real]Absence check using 12 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 21:58:46] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-05-31 21:58:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-31 21:58:46] [INFO ] [Nat]Absence check using 12 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 21:58:46] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2024-05-31 21:58:46] [INFO ] Computed and/alt/rep : 176/847/176 causal constraints (skipped 681 transitions) in 67 ms.
[2024-05-31 21:58:47] [INFO ] Added : 31 causal constraints over 7 iterations in 481 ms. Result :sat
Minimization took 463 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 879/879 transitions.
Applied a total of 0 rules in 11 ms. Remains 353 /353 variables (removed 0) and now considering 879/879 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 353/353 places, 879/879 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 879/879 transitions.
Applied a total of 0 rules in 12 ms. Remains 353 /353 variables (removed 0) and now considering 879/879 (removed 0) transitions.
[2024-05-31 21:58:47] [INFO ] Invariant cache hit.
[2024-05-31 21:58:48] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-31 21:58:48] [INFO ] Invariant cache hit.
[2024-05-31 21:58:49] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2024-05-31 21:58:49] [INFO ] Redundant transitions in 8 ms returned []
Running 857 sub problems to find dead transitions.
[2024-05-31 21:58:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 3 (OVERLAPS) 2/353 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1232 variables, and 36 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 3 (OVERLAPS) 2/353 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 857 unsolved
[2024-05-31 21:59:37] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-31 21:59:40] [INFO ] Deduced a trap composed of 70 places in 335 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1232 variables, and 38 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 0/857 constraints, Known Traps: 2/2 constraints]
After SMT, in 60509ms problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62038 ms. Remains : 353/353 places, 879/879 transitions.
RANDOM walk for 40000 steps (763 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (241 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (235 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 273599 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 273599 steps, saw 170408 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-31 21:59:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 187/254 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/292 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 60/352 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 879/1231 variables, 352/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1231 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1232 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1232 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1232 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 187/254 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/292 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:59:53] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/352 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 879/1231 variables, 352/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1231 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1231 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1232 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1232 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1232 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 351 ms.
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 879/879 transitions.
Applied a total of 0 rules in 11 ms. Remains 353 /353 variables (removed 0) and now considering 879/879 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 353/353 places, 879/879 transitions.
RANDOM walk for 40000 steps (829 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (239 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (242 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 267304 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 267304 steps, saw 168138 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-31 21:59:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 187/254 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/292 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 60/352 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 879/1231 variables, 352/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1231 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1232 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1232 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1232 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 187/254 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/292 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:59:58] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/352 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 879/1231 variables, 352/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1231 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1231 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1232 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1232 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1232 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1353ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 349 ms.
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 879/879 transitions.
Applied a total of 0 rules in 11 ms. Remains 353 /353 variables (removed 0) and now considering 879/879 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 353/353 places, 879/879 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 879/879 transitions.
Applied a total of 0 rules in 12 ms. Remains 353 /353 variables (removed 0) and now considering 879/879 (removed 0) transitions.
[2024-05-31 21:59:59] [INFO ] Invariant cache hit.
[2024-05-31 22:00:00] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-31 22:00:00] [INFO ] Invariant cache hit.
[2024-05-31 22:00:01] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
[2024-05-31 22:00:01] [INFO ] Redundant transitions in 9 ms returned []
Running 857 sub problems to find dead transitions.
[2024-05-31 22:00:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 3 (OVERLAPS) 2/353 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1232 variables, and 36 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 3 (OVERLAPS) 2/353 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 857 unsolved
[2024-05-31 22:00:49] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-05-31 22:00:53] [INFO ] Deduced a trap composed of 70 places in 343 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1232 variables, and 38 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 0/857 constraints, Known Traps: 2/2 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 60503ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62164 ms. Remains : 353/353 places, 879/879 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 353 /353 variables (removed 0) and now considering 879/879 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-31 22:01:01] [INFO ] Invariant cache hit.
[2024-05-31 22:01:01] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-31 22:01:01] [INFO ] [Real]Absence check using 12 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:01:02] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:01:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-31 22:01:02] [INFO ] [Nat]Absence check using 12 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-31 22:01:02] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:01:02] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:01:02] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1105 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-04a-UpperBounds-12 in 141747 ms.
[2024-05-31 22:01:03] [INFO ] Flatten gal took : 171 ms
[2024-05-31 22:01:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 22:01:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 356 places, 882 transitions and 3605 arcs took 16 ms.
Total runtime 543558 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-04a-UpperBounds-03
Could not compute solution for formula : ASLink-PT-04a-UpperBounds-12

BK_STOP 1717192863759

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name ASLink-PT-04a-UpperBounds-03
ub formula formula --maxsum=/tmp/918/ub_0_
ub formula name ASLink-PT-04a-UpperBounds-12
ub formula formula --maxsum=/tmp/918/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-04a"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-04a, 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 r464-smll-171620117700061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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