About the Execution of LTSMin+red for FunctionPointer-PT-c032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10568.279 | 1882160.00 | 2422744.00 | 2988.20 | 0 32 32 32 inf ? 0 ? 0 0 ? ? 1 ? 32 ? | normal |
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.r496-tall-171640603100309.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 FunctionPointer-PT-c032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100309
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c032-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717193853137
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:17:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:17:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:17:34] [INFO ] Load time of PNML (sax parser for PT used): 388 ms
[2024-05-31 22:17:34] [INFO ] Transformed 2826 places.
[2024-05-31 22:17:34] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:17:34] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 542 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:17:34] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 22:17:35] [INFO ] Computed 4 invariants in 90 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, 1, +inf, 32, +inf]
RANDOM walk for 10014 steps (2 resets) in 155 ms. (64 steps per ms)
FORMULA FunctionPointer-PT-c032-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (37 resets) in 279 ms. (392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 0, 2, 0, 0, 0, 4, 1, 1] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
[2024-05-31 22:17:35] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-31 22:17:35] [INFO ] Invariant cache hit.
[2024-05-31 22:17:35] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 22:17:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 22:17:36] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2024-05-31 22:17:36] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-31 22:17:36] [INFO ] [Real]Added 479 Read/Feed constraints in 185 ms returned sat
[2024-05-31 22:17:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:17:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 22:17:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:17:38] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2024-05-31 22:17:38] [INFO ] [Nat]Added 479 Read/Feed constraints in 177 ms returned sat
[2024-05-31 22:17:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 794 ms.
[2024-05-31 22:17:39] [INFO ] Added : 2 causal constraints over 1 iterations in 1176 ms. Result :sat
Minimization took 586 ms.
[2024-05-31 22:17:40] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:17:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:17:41] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2024-05-31 22:17:41] [INFO ] [Real]Added 479 Read/Feed constraints in 115 ms returned sat
[2024-05-31 22:17:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:17:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 22:17:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:17:42] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2024-05-31 22:17:42] [INFO ] [Nat]Added 479 Read/Feed constraints in 99 ms returned sat
[2024-05-31 22:17:42] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 521 ms.
[2024-05-31 22:17:43] [INFO ] Added : 0 causal constraints over 0 iterations in 799 ms. Result :sat
Minimization took 578 ms.
[2024-05-31 22:17:43] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:17:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:17:44] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2024-05-31 22:17:45] [INFO ] [Real]Added 479 Read/Feed constraints in 162 ms returned sat
[2024-05-31 22:17:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:17:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2024-05-31 22:17:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:17:46] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-05-31 22:17:46] [INFO ] [Nat]Added 479 Read/Feed constraints in 186 ms returned sat
[2024-05-31 22:17:46] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 467 ms.
[2024-05-31 22:17:47] [INFO ] Added : 2 causal constraints over 1 iterations in 793 ms. Result :sat
Minimization took 576 ms.
[2024-05-31 22:17:47] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:17:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:17:48] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2024-05-31 22:17:48] [INFO ] [Real]Added 479 Read/Feed constraints in 161 ms returned sat
[2024-05-31 22:17:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:17:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 22:17:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:17:49] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2024-05-31 22:17:50] [INFO ] [Nat]Added 479 Read/Feed constraints in 98 ms returned sat
[2024-05-31 22:17:50] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 397 ms.
[2024-05-31 22:17:50] [INFO ] Added : 1 causal constraints over 1 iterations in 715 ms. Result :sat
Minimization took 612 ms.
[2024-05-31 22:17:51] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:17:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:17:52] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2024-05-31 22:17:52] [INFO ] [Real]Added 479 Read/Feed constraints in 138 ms returned sat
[2024-05-31 22:17:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:17:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:17:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:17:53] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2024-05-31 22:17:53] [INFO ] [Nat]Added 479 Read/Feed constraints in 94 ms returned sat
[2024-05-31 22:17:54] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 424 ms.
[2024-05-31 22:17:54] [INFO ] Added : 1 causal constraints over 1 iterations in 739 ms. Result :sat
Minimization took 585 ms.
[2024-05-31 22:17:55] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 22:17:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:17:56] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2024-05-31 22:17:56] [INFO ] [Real]Added 479 Read/Feed constraints in 131 ms returned sat
[2024-05-31 22:17:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:17:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 22:17:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:17:57] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2024-05-31 22:17:57] [INFO ] [Nat]Added 479 Read/Feed constraints in 119 ms returned sat
[2024-05-31 22:17:57] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 453 ms.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 142 places in 1254 ms of which 87 ms to minimize.
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 136 places in 1145 ms of which 12 ms to minimize.
[2024-05-31 22:18:02] [INFO ] Deduced a trap composed of 133 places in 1202 ms of which 10 ms to minimize.
[2024-05-31 22:18:02] [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 5
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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 22:18:02] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 22:18:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:18:03] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2024-05-31 22:18:03] [INFO ] [Real]Added 479 Read/Feed constraints in 166 ms returned sat
[2024-05-31 22:18:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 22:18:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:18:04] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2024-05-31 22:18:04] [INFO ] [Nat]Added 479 Read/Feed constraints in 109 ms returned sat
[2024-05-31 22:18:05] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 433 ms.
[2024-05-31 22:18:05] [INFO ] Added : 2 causal constraints over 1 iterations in 767 ms. Result :sat
Minimization took 583 ms.
[2024-05-31 22:18:06] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 22:18:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:18:06] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2024-05-31 22:18:07] [INFO ] [Real]Added 479 Read/Feed constraints in 168 ms returned sat
[2024-05-31 22:18:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:18:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:18:08] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2024-05-31 22:18:08] [INFO ] [Nat]Added 479 Read/Feed constraints in 146 ms returned sat
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 229 places in 1164 ms of which 16 ms to minimize.
[2024-05-31 22:18:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1360 ms
[2024-05-31 22:18:09] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 431 ms.
[2024-05-31 22:18:10] [INFO ] Added : 2 causal constraints over 1 iterations in 766 ms. Result :sat
Minimization took 582 ms.
[2024-05-31 22:18:11] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:18:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:18:11] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2024-05-31 22:18:12] [INFO ] [Real]Added 479 Read/Feed constraints in 168 ms returned sat
[2024-05-31 22:18:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:18:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:18:13] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2024-05-31 22:18:13] [INFO ] [Nat]Added 479 Read/Feed constraints in 126 ms returned sat
[2024-05-31 22:18:13] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 452 ms.
[2024-05-31 22:18:14] [INFO ] Added : 2 causal constraints over 1 iterations in 767 ms. Result :sat
Minimization took 600 ms.
[2024-05-31 22:18:14] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 22:18:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:18:15] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2024-05-31 22:18:15] [INFO ] [Real]Added 479 Read/Feed constraints in 153 ms returned sat
[2024-05-31 22:18:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:18:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:18:16] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2024-05-31 22:18:17] [INFO ] [Nat]Added 479 Read/Feed constraints in 93 ms returned sat
[2024-05-31 22:18:17] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 446 ms.
[2024-05-31 22:18:17] [INFO ] Added : 0 causal constraints over 0 iterations in 654 ms. Result :sat
Minimization took 587 ms.
[2024-05-31 22:18:18] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 22:18:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:18:19] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2024-05-31 22:18:19] [INFO ] [Real]Added 479 Read/Feed constraints in 130 ms returned sat
[2024-05-31 22:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 22:18:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:18:20] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2024-05-31 22:18:20] [INFO ] [Nat]Added 479 Read/Feed constraints in 113 ms returned sat
[2024-05-31 22:18:21] [INFO ] Deduced a trap composed of 142 places in 1254 ms of which 11 ms to minimize.
[2024-05-31 22:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1462 ms
[2024-05-31 22:18:22] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 448 ms.
[2024-05-31 22:18:22] [INFO ] Added : 2 causal constraints over 1 iterations in 759 ms. Result :sat
Minimization took 602 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 0, 2, 0, 0, 0, 4, 1, 1] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2, 1, 0, 2, 0, 0, 0, 4, 1, 1] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
Support contains 11 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.13 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 679 place count 1123 transition count 3303
Iterating global reduction 1 with 299 rules applied. Total rules applied 978 place count 1123 transition count 3303
Ensure Unique test removed 356 transitions
Reduce isomorphic transitions removed 356 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 1334 place count 1123 transition count 2947
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1490 place count 967 transition count 2635
Iterating global reduction 2 with 156 rules applied. Total rules applied 1646 place count 967 transition count 2635
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1714 place count 967 transition count 2567
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1728 place count 953 transition count 2539
Iterating global reduction 3 with 14 rules applied. Total rules applied 1742 place count 953 transition count 2539
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1756 place count 939 transition count 2511
Iterating global reduction 3 with 14 rules applied. Total rules applied 1770 place count 939 transition count 2511
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1784 place count 925 transition count 2483
Iterating global reduction 3 with 14 rules applied. Total rules applied 1798 place count 925 transition count 2483
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1812 place count 911 transition count 2455
Iterating global reduction 3 with 14 rules applied. Total rules applied 1826 place count 911 transition count 2455
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1840 place count 897 transition count 2427
Iterating global reduction 3 with 14 rules applied. Total rules applied 1854 place count 897 transition count 2427
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1867 place count 884 transition count 2401
Iterating global reduction 3 with 13 rules applied. Total rules applied 1880 place count 884 transition count 2401
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1893 place count 871 transition count 2375
Iterating global reduction 3 with 13 rules applied. Total rules applied 1906 place count 871 transition count 2375
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1960 place count 817 transition count 2173
Iterating global reduction 3 with 54 rules applied. Total rules applied 2014 place count 817 transition count 2173
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2073 place count 758 transition count 1937
Iterating global reduction 3 with 59 rules applied. Total rules applied 2132 place count 758 transition count 1937
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2191 place count 699 transition count 1795
Iterating global reduction 3 with 59 rules applied. Total rules applied 2250 place count 699 transition count 1795
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2309 place count 640 transition count 1677
Iterating global reduction 3 with 59 rules applied. Total rules applied 2368 place count 640 transition count 1677
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2426 place count 582 transition count 1561
Iterating global reduction 3 with 58 rules applied. Total rules applied 2484 place count 582 transition count 1561
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2542 place count 524 transition count 1445
Iterating global reduction 3 with 58 rules applied. Total rules applied 2600 place count 524 transition count 1445
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2657 place count 467 transition count 1331
Iterating global reduction 3 with 57 rules applied. Total rules applied 2714 place count 467 transition count 1331
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2726 place count 455 transition count 1307
Iterating global reduction 3 with 12 rules applied. Total rules applied 2738 place count 455 transition count 1307
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 2748 place count 455 transition count 1297
Applied a total of 2748 rules in 1153 ms. Remains 455 /1628 variables (removed 1173) and now considering 1297/5962 (removed 4665) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1164 ms. Remains : 455/1628 places, 1297/5962 transitions.
[2024-05-31 22:18:24] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 11) seen :[1, 1, 1, 4, 2, 1, 0, 5, 2, 1, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 2, 1, 4, 2, 1, 0, 5, 4, 1, 3] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
[2024-05-31 22:18:25] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:18:25] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 1, 4, 2, 1, 0, 5, 4, 1, 3] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
RANDOM walk for 1000003 steps (2 resets) in 2373 ms. (421 steps per ms)
BEST_FIRST walk for 11000010 steps (22 resets) in 11655 ms. (943 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 3, 99, 180, 212, 69, 12, 191, 1, 132] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
[2024-05-31 22:18:39] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:18:39] [INFO ] Invariant cache hit.
[2024-05-31 22:18:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:39] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-31 22:18:39] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:18:39] [INFO ] [Real]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:18:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:39] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:18:39] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:18:39] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-31 22:18:39] [INFO ] Added : 1 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 277 ms.
[2024-05-31 22:18:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:18:40] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:18:40] [INFO ] [Real]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:18:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:40] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:18:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-31 22:18:40] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-31 22:18:40] [INFO ] Added : 0 causal constraints over 0 iterations in 132 ms. Result :sat
Minimization took 283 ms.
[2024-05-31 22:18:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:41] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 22:18:41] [INFO ] [Real]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:18:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:18:41] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:18:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:18:41] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-31 22:18:41] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 293 ms.
[2024-05-31 22:18:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:18:42] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:18:42] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-31 22:18:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:18:42] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:18:42] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:18:42] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:18:42] [INFO ] Added : 1 causal constraints over 1 iterations in 148 ms. Result :sat
Minimization took 272 ms.
[2024-05-31 22:18:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:43] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 22:18:43] [INFO ] [Real]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:18:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:43] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:18:43] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-31 22:18:43] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 4 ms to minimize.
[2024-05-31 22:18:44] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 3 ms to minimize.
[2024-05-31 22:18:44] [INFO ] Deduced a trap composed of 143 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:18:44] [INFO ] Deduced a trap composed of 141 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:18:44] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:18:45] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:18:45] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:18:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1630 ms
[2024-05-31 22:18:45] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-31 22:18:45] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 294 ms.
[2024-05-31 22:18:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:46] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:18:46] [INFO ] [Real]Added 91 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:46] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:18:46] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:18:46] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 3 ms to minimize.
[2024-05-31 22:18:46] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:18:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2024-05-31 22:18:46] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-31 22:18:47] [INFO ] Added : 13 causal constraints over 4 iterations in 275 ms. Result :sat
Minimization took 288 ms.
[2024-05-31 22:18:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:47] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:18:47] [INFO ] [Real]Added 91 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:47] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:18:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 3 ms to minimize.
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 159 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 147 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1174 ms
[2024-05-31 22:18:49] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 74 ms.
[2024-05-31 22:18:49] [INFO ] Added : 11 causal constraints over 4 iterations in 275 ms. Result :sat
Minimization took 285 ms.
[2024-05-31 22:18:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:18:49] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:18:50] [INFO ] [Real]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:18:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:50] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:18:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 50 ms returned sat
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 206 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 172 places in 195 ms of which 3 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 143 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 134 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 4 ms to minimize.
[2024-05-31 22:18:52] [INFO ] Deduced a trap composed of 91 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:18:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1785 ms
[2024-05-31 22:18:52] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-31 22:18:52] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 308 ms.
[2024-05-31 22:18:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:52] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:18:52] [INFO ] [Real]Added 91 Read/Feed constraints in 50 ms returned sat
[2024-05-31 22:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:18:53] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:18:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-31 22:18:53] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-31 22:18:53] [INFO ] Added : 11 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 278 ms.
[2024-05-31 22:18:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:54] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:18:54] [INFO ] [Real]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-31 22:18:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:54] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:18:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-31 22:18:54] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 75 ms.
[2024-05-31 22:18:54] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 274 ms.
[2024-05-31 22:18:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:55] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:18:55] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:18:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:55] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:18:55] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 4 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2024-05-31 22:18:56] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-31 22:18:56] [INFO ] Added : 11 causal constraints over 4 iterations in 259 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 3, 99, 180, 212, 69, 12, 191, 1, 132] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
FORMULA FunctionPointer-PT-c032-UpperBounds-14 32 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c032-UpperBounds-02 32 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 31, 99, 180, 212, 69, 12, 191, 132] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 51 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-31 22:18:59] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :[1, 1, 6, 3, 2, 1, 0, 3, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 31, 99, 180, 212, 69, 12, 191, 132] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:18:59] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:18:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 31, 99, 180, 212, 69, 12, 191, 132] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 2313 ms. (432 steps per ms)
FORMULA FunctionPointer-PT-c032-UpperBounds-03 32 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8000007 steps (16 resets) in 8853 ms. (903 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 224, 240, 212, 69, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:19:10] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:19:10] [INFO ] Invariant cache hit.
[2024-05-31 22:19:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:19:10] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:19:10] [INFO ] [Real]Added 91 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:11] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:19:11] [INFO ] [Nat]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-31 22:19:11] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 80 ms.
[2024-05-31 22:19:11] [INFO ] Added : 1 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 287 ms.
[2024-05-31 22:19:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:11] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:19:11] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-31 22:19:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:12] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:19:12] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:19:12] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:19:12] [INFO ] Added : 1 causal constraints over 1 iterations in 145 ms. Result :sat
Minimization took 270 ms.
[2024-05-31 22:19:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:12] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:19:12] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:19:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:13] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:19:13] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:19:13] [INFO ] Deduced a trap composed of 169 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:19:13] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 3 ms to minimize.
[2024-05-31 22:19:13] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:19:14] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:19:14] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 8 ms to minimize.
[2024-05-31 22:19:14] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:19:14] [INFO ] Deduced a trap composed of 172 places in 207 ms of which 3 ms to minimize.
[2024-05-31 22:19:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1642 ms
[2024-05-31 22:19:14] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-31 22:19:14] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 284 ms.
[2024-05-31 22:19:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:15] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:19:15] [INFO ] [Real]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-31 22:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:15] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:19:15] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 22:19:15] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:19:16] [INFO ] Deduced a trap composed of 172 places in 190 ms of which 4 ms to minimize.
[2024-05-31 22:19:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 471 ms
[2024-05-31 22:19:16] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 74 ms.
[2024-05-31 22:19:16] [INFO ] Added : 13 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 274 ms.
[2024-05-31 22:19:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:17] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-31 22:19:17] [INFO ] [Real]Added 91 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:19:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:17] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:19:17] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:19:17] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:19:17] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:19:18] [INFO ] Deduced a trap composed of 159 places in 206 ms of which 4 ms to minimize.
[2024-05-31 22:19:18] [INFO ] Deduced a trap composed of 147 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:19:18] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:19:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1183 ms
[2024-05-31 22:19:18] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 72 ms.
[2024-05-31 22:19:18] [INFO ] Added : 11 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 284 ms.
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Real]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-31 22:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Nat]Added 91 Read/Feed constraints in 50 ms returned sat
[2024-05-31 22:19:19] [INFO ] Deduced a trap composed of 206 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:19:20] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:19:20] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:19:20] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:19:20] [INFO ] Deduced a trap composed of 143 places in 203 ms of which 4 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 4 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 91 places in 209 ms of which 3 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1832 ms
[2024-05-31 22:19:21] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 63 ms.
[2024-05-31 22:19:21] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 288 ms.
[2024-05-31 22:19:22] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Real]Added 91 Read/Feed constraints in 46 ms returned sat
[2024-05-31 22:19:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-31 22:19:22] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 3 ms to minimize.
[2024-05-31 22:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-05-31 22:19:22] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-31 22:19:23] [INFO ] Added : 11 causal constraints over 4 iterations in 273 ms. Result :sat
Minimization took 298 ms.
[2024-05-31 22:19:23] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Nat]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 3 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 3 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 508 ms
[2024-05-31 22:19:24] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 74 ms.
[2024-05-31 22:19:24] [INFO ] Added : 11 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 224, 240, 212, 69, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 224, 240, 212, 69, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 52 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-31 22:19:27] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :[0, 0, 1, 3, 2, 0, 4, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 224, 240, 212, 69, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:19:28] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:19:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 224, 240, 212, 69, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2392 ms. (417 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 8393 ms. (953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 245, 240, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:19:38] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:19:38] [INFO ] Invariant cache hit.
[2024-05-31 22:19:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:39] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:19:39] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:19:39] [INFO ] [Real]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-31 22:19:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:39] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:19:39] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:19:39] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-31 22:19:39] [INFO ] Added : 1 causal constraints over 1 iterations in 150 ms. Result :sat
Minimization took 282 ms.
[2024-05-31 22:19:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:40] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:19:40] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:19:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:40] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:19:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:19:40] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-31 22:19:40] [INFO ] Added : 1 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 275 ms.
[2024-05-31 22:19:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:19:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:19:41] [INFO ] Deduced a trap composed of 169 places in 220 ms of which 8 ms to minimize.
[2024-05-31 22:19:41] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:19:42] [INFO ] Deduced a trap composed of 143 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:19:42] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 4 ms to minimize.
[2024-05-31 22:19:42] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:19:42] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:19:43] [INFO ] Deduced a trap composed of 172 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:19:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1635 ms
[2024-05-31 22:19:43] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-31 22:19:43] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 299 ms.
[2024-05-31 22:19:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Real]Added 91 Read/Feed constraints in 30 ms returned sat
[2024-05-31 22:19:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 22:19:44] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 2 ms to minimize.
[2024-05-31 22:19:44] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:19:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2024-05-31 22:19:44] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-31 22:19:44] [INFO ] Added : 13 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 276 ms.
[2024-05-31 22:19:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Real]Added 91 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:19:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 3 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 159 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1172 ms
[2024-05-31 22:19:46] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-31 22:19:47] [INFO ] Added : 11 causal constraints over 4 iterations in 245 ms. Result :sat
Minimization took 276 ms.
[2024-05-31 22:19:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Real]Added 91 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:19:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:19:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 51 ms returned sat
[2024-05-31 22:19:48] [INFO ] Deduced a trap composed of 206 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:19:48] [INFO ] Deduced a trap composed of 172 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:19:48] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:19:48] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 143 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 134 places in 202 ms of which 2 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 131 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1828 ms
[2024-05-31 22:19:49] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-31 22:19:50] [INFO ] Added : 2 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 306 ms.
[2024-05-31 22:19:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:50] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 22:19:50] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-31 22:19:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:50] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:19:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-31 22:19:51] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-31 22:19:51] [INFO ] Added : 11 causal constraints over 4 iterations in 251 ms. Result :sat
Minimization took 268 ms.
[2024-05-31 22:19:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:19:51] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:19:52] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-31 22:19:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:52] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:19:52] [INFO ] [Nat]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 3 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 3 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2024-05-31 22:19:52] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 71 ms.
[2024-05-31 22:19:53] [INFO ] Added : 11 causal constraints over 4 iterations in 265 ms. Result :sat
Minimization took 287 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 245, 240, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 245, 240, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 50 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 46 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-31 22:19:56] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:19:56] [INFO ] Invariant cache hit.
[2024-05-31 22:19:56] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-31 22:19:56] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:19:56] [INFO ] Invariant cache hit.
[2024-05-31 22:19:56] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:19:57] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2024-05-31 22:19:58] [INFO ] Redundant transitions in 81 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-31 22:19:58] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:19:58] [INFO ] Invariant cache hit.
[2024-05-31 22:19:58] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-31 22:20:14] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64733ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64758ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66719 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-31 22:21:02] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :[1, 0, 1, 0, 0, 3, 2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 245, 240, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:21:03] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:21:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 245, 240, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 2580 ms. (387 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 8411 ms. (951 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 245, 270, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:21:14] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:21:14] [INFO ] Invariant cache hit.
[2024-05-31 22:21:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:21:14] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:21:14] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:21:14] [INFO ] [Real]Added 91 Read/Feed constraints in 59 ms returned sat
[2024-05-31 22:21:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:21:14] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:21:14] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:21:14] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-31 22:21:14] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 268 ms.
[2024-05-31 22:21:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:15] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:21:15] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:21:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:15] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 22:21:15] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:21:15] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-31 22:21:15] [INFO ] Added : 1 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 289 ms.
[2024-05-31 22:21:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:16] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:21:16] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:21:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:16] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:21:16] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-31 22:21:16] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 3 ms to minimize.
[2024-05-31 22:21:17] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
[2024-05-31 22:21:17] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:21:17] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:21:17] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:21:18] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:21:18] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:21:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1636 ms
[2024-05-31 22:21:18] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 68 ms.
[2024-05-31 22:21:18] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 289 ms.
[2024-05-31 22:21:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:21:19] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:21:19] [INFO ] [Real]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:21:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:21:19] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:21:19] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-31 22:21:19] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 3 ms to minimize.
[2024-05-31 22:21:19] [INFO ] Deduced a trap composed of 172 places in 201 ms of which 2 ms to minimize.
[2024-05-31 22:21:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2024-05-31 22:21:19] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:21:20] [INFO ] Added : 13 causal constraints over 4 iterations in 264 ms. Result :sat
Minimization took 270 ms.
[2024-05-31 22:21:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:20] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:21:20] [INFO ] [Real]Added 91 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:21:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:20] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:21:20] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 3 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 161 places in 207 ms of which 3 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 159 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 147 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1179 ms
[2024-05-31 22:21:22] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 71 ms.
[2024-05-31 22:21:22] [INFO ] Added : 11 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 301 ms.
[2024-05-31 22:21:22] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:21:22] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Real]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Nat]Added 91 Read/Feed constraints in 51 ms returned sat
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 206 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 172 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 134 places in 199 ms of which 4 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 91 places in 210 ms of which 3 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1821 ms
[2024-05-31 22:21:25] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:21:25] [INFO ] Added : 2 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 275 ms.
[2024-05-31 22:21:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:25] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-31 22:21:25] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-31 22:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:26] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:21:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:21:26] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 3 ms to minimize.
[2024-05-31 22:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-05-31 22:21:26] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-31 22:21:26] [INFO ] Added : 11 causal constraints over 4 iterations in 295 ms. Result :sat
Minimization took 274 ms.
[2024-05-31 22:21:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:21:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:21:27] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 3 ms to minimize.
[2024-05-31 22:21:28] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:21:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2024-05-31 22:21:28] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 61 ms.
[2024-05-31 22:21:28] [INFO ] Added : 11 causal constraints over 4 iterations in 266 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 245, 270, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 245, 270, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 56 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 47 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-31 22:21:31] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:21:31] [INFO ] Invariant cache hit.
[2024-05-31 22:21:31] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-31 22:21:31] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:21:31] [INFO ] Invariant cache hit.
[2024-05-31 22:21:31] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:21:33] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
[2024-05-31 22:21:33] [INFO ] Redundant transitions in 26 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-31 22:21:33] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:21:33] [INFO ] Invariant cache hit.
[2024-05-31 22:21:33] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-31 22:21:49] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64628ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66568 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-31 22:22:37] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :[0, 4, 3, 2, 0, 1, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 245, 270, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:22:38] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:22:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 245, 270, 212, 82, 13, 191, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2335 ms. (428 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 8335 ms. (959 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 245, 270, 212, 104, 13, 209, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:22:48] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:22:48] [INFO ] Invariant cache hit.
[2024-05-31 22:22:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:22:49] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:22:49] [INFO ] [Real]Added 91 Read/Feed constraints in 62 ms returned sat
[2024-05-31 22:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:22:49] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-31 22:22:49] [INFO ] Added : 1 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 280 ms.
[2024-05-31 22:22:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:22:50] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:22:50] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:50] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:22:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:22:50] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 63 ms.
[2024-05-31 22:22:50] [INFO ] Added : 1 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 285 ms.
[2024-05-31 22:22:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:22:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 143 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 172 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1613 ms
[2024-05-31 22:22:53] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 61 ms.
[2024-05-31 22:22:53] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 304 ms.
[2024-05-31 22:22:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:53] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:22:53] [INFO ] [Real]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:22:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:22:54] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:22:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 178 places in 223 ms of which 2 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 172 places in 207 ms of which 3 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2024-05-31 22:22:54] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 58 ms.
[2024-05-31 22:22:54] [INFO ] Added : 13 causal constraints over 4 iterations in 263 ms. Result :sat
Minimization took 296 ms.
[2024-05-31 22:22:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:55] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:22:55] [INFO ] [Real]Added 91 Read/Feed constraints in 65 ms returned sat
[2024-05-31 22:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:55] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:22:55] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 3 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 161 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 3 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1186 ms
[2024-05-31 22:22:56] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 61 ms.
[2024-05-31 22:22:57] [INFO ] Added : 11 causal constraints over 4 iterations in 256 ms. Result :sat
Minimization took 292 ms.
[2024-05-31 22:22:57] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-31 22:22:57] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 22:22:57] [INFO ] [Real]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:22:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:22:58] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:22:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 61 ms returned sat
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 206 places in 214 ms of which 3 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 172 places in 232 ms of which 4 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 152 places in 211 ms of which 3 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 143 places in 212 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 134 places in 222 ms of which 3 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 131 places in 217 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 91 places in 212 ms of which 2 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1934 ms
[2024-05-31 22:23:00] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-31 22:23:00] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 316 ms.
[2024-05-31 22:23:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:23:00] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:23:00] [INFO ] [Real]Added 91 Read/Feed constraints in 48 ms returned sat
[2024-05-31 22:23:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:23:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:23:01] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:23:01] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:23:01] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:23:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-31 22:23:01] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-31 22:23:01] [INFO ] Added : 11 causal constraints over 4 iterations in 252 ms. Result :sat
Minimization took 277 ms.
[2024-05-31 22:23:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:23:02] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:23:02] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:23:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:23:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:23:02] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:23:02] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-31 22:23:02] [INFO ] Deduced a trap composed of 178 places in 217 ms of which 3 ms to minimize.
[2024-05-31 22:23:02] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 3 ms to minimize.
[2024-05-31 22:23:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2024-05-31 22:23:02] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 60 ms.
[2024-05-31 22:23:03] [INFO ] Added : 11 causal constraints over 4 iterations in 272 ms. Result :sat
Minimization took 282 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 245, 270, 212, 104, 13, 209, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 245, 270, 212, 104, 13, 209, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 53 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 46 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-31 22:23:06] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:23:06] [INFO ] Invariant cache hit.
[2024-05-31 22:23:06] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-31 22:23:06] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:23:06] [INFO ] Invariant cache hit.
[2024-05-31 22:23:07] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:23:08] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2024-05-31 22:23:08] [INFO ] Redundant transitions in 16 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-31 22:23:08] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:23:08] [INFO ] Invariant cache hit.
[2024-05-31 22:23:08] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-31 22:23:25] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 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 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64510ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64525ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66399 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-31 22:24:12] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :[1, 0, 2, 3, 2, 1, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 245, 270, 212, 104, 13, 209, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:24:13] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:24:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 245, 270, 212, 104, 13, 209, 194] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2484 ms. (402 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 8209 ms. (974 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:24:23] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:24:23] [INFO ] Invariant cache hit.
[2024-05-31 22:24:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:24] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:24:24] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:24:24] [INFO ] [Real]Added 91 Read/Feed constraints in 56 ms returned sat
[2024-05-31 22:24:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:24] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:24:24] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:24:24] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 63 ms.
[2024-05-31 22:24:24] [INFO ] Added : 1 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 266 ms.
[2024-05-31 22:24:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:25] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:24:25] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:24:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:25] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 22:24:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:24:25] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:24:25] [INFO ] Added : 1 causal constraints over 1 iterations in 144 ms. Result :sat
Minimization took 256 ms.
[2024-05-31 22:24:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:26] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:24:26] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:24:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:26] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:24:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 22:24:26] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 4 ms to minimize.
[2024-05-31 22:24:26] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:24:27] [INFO ] Deduced a trap composed of 143 places in 212 ms of which 3 ms to minimize.
[2024-05-31 22:24:27] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:24:27] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:24:27] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:24:28] [INFO ] Deduced a trap composed of 172 places in 222 ms of which 3 ms to minimize.
[2024-05-31 22:24:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1694 ms
[2024-05-31 22:24:28] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-31 22:24:28] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 307 ms.
[2024-05-31 22:24:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:28] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:24:28] [INFO ] [Real]Added 91 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:29] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:24:29] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 22:24:29] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 3 ms to minimize.
[2024-05-31 22:24:29] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:24:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2024-05-31 22:24:29] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:24:29] [INFO ] Added : 13 causal constraints over 4 iterations in 264 ms. Result :sat
Minimization took 266 ms.
[2024-05-31 22:24:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:24:30] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 22:24:30] [INFO ] [Real]Added 91 Read/Feed constraints in 64 ms returned sat
[2024-05-31 22:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:30] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 22:24:30] [INFO ] [Nat]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:24:30] [INFO ] Deduced a trap composed of 178 places in 220 ms of which 5 ms to minimize.
[2024-05-31 22:24:31] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:24:31] [INFO ] Deduced a trap composed of 159 places in 197 ms of which 2 ms to minimize.
[2024-05-31 22:24:31] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 2 ms to minimize.
[2024-05-31 22:24:31] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 2 ms to minimize.
[2024-05-31 22:24:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1177 ms
[2024-05-31 22:24:31] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-31 22:24:32] [INFO ] Added : 11 causal constraints over 4 iterations in 294 ms. Result :sat
Minimization took 320 ms.
[2024-05-31 22:24:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:32] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-31 22:24:32] [INFO ] [Real]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-31 22:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:33] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:24:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 51 ms returned sat
[2024-05-31 22:24:33] [INFO ] Deduced a trap composed of 206 places in 204 ms of which 2 ms to minimize.
[2024-05-31 22:24:33] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 2 ms to minimize.
[2024-05-31 22:24:33] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:24:33] [INFO ] Deduced a trap composed of 152 places in 194 ms of which 2 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 2 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 134 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 131 places in 193 ms of which 2 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 91 places in 207 ms of which 3 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1809 ms
[2024-05-31 22:24:34] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-31 22:24:35] [INFO ] Added : 2 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 268 ms.
[2024-05-31 22:24:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:24:35] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:24:35] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-31 22:24:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:35] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 22:24:35] [INFO ] [Nat]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:24:36] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 3 ms to minimize.
[2024-05-31 22:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-05-31 22:24:36] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-31 22:24:36] [INFO ] Added : 11 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 266 ms.
[2024-05-31 22:24:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:24:36] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:24:37] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:24:37] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-31 22:24:37] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:24:37] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:24:37] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:24:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2024-05-31 22:24:37] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 81 ms.
[2024-05-31 22:24:38] [INFO ] Added : 11 causal constraints over 4 iterations in 288 ms. Result :sat
Minimization took 263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 55 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 52 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-31 22:24:41] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:24:41] [INFO ] Invariant cache hit.
[2024-05-31 22:24:41] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-31 22:24:41] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:24:41] [INFO ] Invariant cache hit.
[2024-05-31 22:24:42] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:24:43] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2024-05-31 22:24:43] [INFO ] Redundant transitions in 21 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-31 22:24:43] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:24:43] [INFO ] Invariant cache hit.
[2024-05-31 22:24:43] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-31 22:24:58] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 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 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 63793ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 63806ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65649 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-31 22:25:47] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :[1, 3, 2, 4, 0, 0, 2, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:25:47] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:25:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2457 ms. (406 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 8230 ms. (971 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:25:58] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:25:58] [INFO ] Invariant cache hit.
[2024-05-31 22:25:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:25:58] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:25:58] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:25:58] [INFO ] [Real]Added 91 Read/Feed constraints in 56 ms returned sat
[2024-05-31 22:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:25:58] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:25:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:25:58] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 61 ms.
[2024-05-31 22:25:58] [INFO ] Added : 1 causal constraints over 1 iterations in 147 ms. Result :sat
Minimization took 253 ms.
[2024-05-31 22:25:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:25:59] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:25:59] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:25:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:59] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:25:59] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:25:59] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 61 ms.
[2024-05-31 22:25:59] [INFO ] Added : 1 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 251 ms.
[2024-05-31 22:26:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:26:00] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 22:26:00] [INFO ] [Real]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:26:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:26:00] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:26:00] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:26:01] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 3 ms to minimize.
[2024-05-31 22:26:01] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
[2024-05-31 22:26:01] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:26:01] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:26:01] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:26:02] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:26:02] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:26:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1610 ms
[2024-05-31 22:26:02] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-31 22:26:02] [INFO ] Added : 1 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 319 ms.
[2024-05-31 22:26:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:26:03] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 22:26:03] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:26:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:26:03] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 22:26:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-31 22:26:03] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:26:03] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:26:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2024-05-31 22:26:03] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:26:04] [INFO ] Added : 13 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 266 ms.
[2024-05-31 22:26:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:26:04] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:26:04] [INFO ] [Real]Added 91 Read/Feed constraints in 64 ms returned sat
[2024-05-31 22:26:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:26:05] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:26:05] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:26:05] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 4 ms to minimize.
[2024-05-31 22:26:05] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:26:05] [INFO ] Deduced a trap composed of 159 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:26:05] [INFO ] Deduced a trap composed of 147 places in 194 ms of which 3 ms to minimize.
[2024-05-31 22:26:06] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:26:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1167 ms
[2024-05-31 22:26:06] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-31 22:26:06] [INFO ] Added : 11 causal constraints over 4 iterations in 269 ms. Result :sat
Minimization took 269 ms.
[2024-05-31 22:26:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:26:07] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:26:07] [INFO ] [Real]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:26:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:26:07] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-31 22:26:07] [INFO ] [Nat]Added 91 Read/Feed constraints in 54 ms returned sat
[2024-05-31 22:26:07] [INFO ] Deduced a trap composed of 206 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:26:07] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:26:08] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:26:08] [INFO ] Deduced a trap composed of 152 places in 213 ms of which 3 ms to minimize.
[2024-05-31 22:26:08] [INFO ] Deduced a trap composed of 143 places in 199 ms of which 2 ms to minimize.
[2024-05-31 22:26:08] [INFO ] Deduced a trap composed of 134 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:26:08] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:26:09] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 3 ms to minimize.
[2024-05-31 22:26:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1846 ms
[2024-05-31 22:26:09] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-31 22:26:09] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 276 ms.
[2024-05-31 22:26:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:26:09] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:26:09] [INFO ] [Real]Added 91 Read/Feed constraints in 48 ms returned sat
[2024-05-31 22:26:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:26:10] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 22:26:10] [INFO ] [Nat]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:26:10] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 3 ms to minimize.
[2024-05-31 22:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-05-31 22:26:10] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:26:10] [INFO ] Added : 11 causal constraints over 4 iterations in 262 ms. Result :sat
Minimization took 263 ms.
[2024-05-31 22:26:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:26:11] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:26:11] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:26:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:26:11] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:26:11] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-31 22:26:11] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 3 ms to minimize.
[2024-05-31 22:26:12] [INFO ] Deduced a trap composed of 178 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:26:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2024-05-31 22:26:12] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 68 ms.
[2024-05-31 22:26:12] [INFO ] Added : 11 causal constraints over 4 iterations in 275 ms. Result :sat
Minimization took 317 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 52 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 49 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-31 22:26:16] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:26:16] [INFO ] Invariant cache hit.
[2024-05-31 22:26:16] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-31 22:26:16] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:26:16] [INFO ] Invariant cache hit.
[2024-05-31 22:26:16] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:26:17] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2024-05-31 22:26:17] [INFO ] Redundant transitions in 20 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-31 22:26:17] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:26:17] [INFO ] Invariant cache hit.
[2024-05-31 22:26:17] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-31 22:26:34] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64388ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64400ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66266 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-31 22:27:22] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :[1, 2, 1, 2, 1, 1, 4, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[31, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:27:22] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:27:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[31, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2276 ms. (439 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 8368 ms. (955 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[31, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:27:33] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:27:33] [INFO ] Invariant cache hit.
[2024-05-31 22:27:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:33] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:27:33] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:27:33] [INFO ] [Real]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-31 22:27:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:33] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 22:27:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 46 ms returned sat
[2024-05-31 22:27:33] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:27:34] [INFO ] Added : 1 causal constraints over 1 iterations in 147 ms. Result :sat
Minimization took 256 ms.
[2024-05-31 22:27:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:27:34] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 22:27:34] [INFO ] [Real]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-31 22:27:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:34] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-31 22:27:34] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:27:34] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:27:35] [INFO ] Added : 1 causal constraints over 1 iterations in 145 ms. Result :sat
Minimization took 247 ms.
[2024-05-31 22:27:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:35] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-31 22:27:35] [INFO ] [Real]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:27:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:35] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-31 22:27:35] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-31 22:27:36] [INFO ] Deduced a trap composed of 169 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:27:36] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 3 ms to minimize.
[2024-05-31 22:27:36] [INFO ] Deduced a trap composed of 143 places in 225 ms of which 3 ms to minimize.
[2024-05-31 22:27:36] [INFO ] Deduced a trap composed of 141 places in 214 ms of which 3 ms to minimize.
[2024-05-31 22:27:36] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:27:37] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:27:37] [INFO ] Deduced a trap composed of 172 places in 216 ms of which 3 ms to minimize.
[2024-05-31 22:27:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1675 ms
[2024-05-31 22:27:37] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 60 ms.
[2024-05-31 22:27:37] [INFO ] Added : 1 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 257 ms.
[2024-05-31 22:27:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:38] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:27:38] [INFO ] [Real]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-31 22:27:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:38] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 22:27:38] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-31 22:27:38] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 2 ms to minimize.
[2024-05-31 22:27:38] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:27:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2024-05-31 22:27:38] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:27:39] [INFO ] Added : 13 causal constraints over 4 iterations in 271 ms. Result :sat
Minimization took 254 ms.
[2024-05-31 22:27:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:39] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:27:39] [INFO ] [Real]Added 91 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:27:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:39] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-31 22:27:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:27:40] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:27:40] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 3 ms to minimize.
[2024-05-31 22:27:40] [INFO ] Deduced a trap composed of 159 places in 218 ms of which 18 ms to minimize.
[2024-05-31 22:27:40] [INFO ] Deduced a trap composed of 147 places in 212 ms of which 3 ms to minimize.
[2024-05-31 22:27:41] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-05-31 22:27:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1187 ms
[2024-05-31 22:27:41] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-31 22:27:41] [INFO ] Added : 11 causal constraints over 4 iterations in 254 ms. Result :sat
Minimization took 264 ms.
[2024-05-31 22:27:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:41] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 22:27:42] [INFO ] [Real]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-31 22:27:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:42] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:27:42] [INFO ] [Nat]Added 91 Read/Feed constraints in 49 ms returned sat
[2024-05-31 22:27:42] [INFO ] Deduced a trap composed of 206 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:27:42] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 3 ms to minimize.
[2024-05-31 22:27:43] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 3 ms to minimize.
[2024-05-31 22:27:43] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 4 ms to minimize.
[2024-05-31 22:27:43] [INFO ] Deduced a trap composed of 143 places in 211 ms of which 3 ms to minimize.
[2024-05-31 22:27:43] [INFO ] Deduced a trap composed of 134 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:27:43] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 3 ms to minimize.
[2024-05-31 22:27:44] [INFO ] Deduced a trap composed of 91 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:27:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1873 ms
[2024-05-31 22:27:44] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 63 ms.
[2024-05-31 22:27:44] [INFO ] Added : 2 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 284 ms.
[2024-05-31 22:27:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:44] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:27:44] [INFO ] [Real]Added 91 Read/Feed constraints in 46 ms returned sat
[2024-05-31 22:27:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:45] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:27:45] [INFO ] [Nat]Added 91 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:27:45] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 3 ms to minimize.
[2024-05-31 22:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-05-31 22:27:45] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 59 ms.
[2024-05-31 22:27:45] [INFO ] Added : 11 causal constraints over 4 iterations in 250 ms. Result :sat
Minimization took 263 ms.
[2024-05-31 22:27:46] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2024-05-31 22:27:46] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:27:46] [INFO ] [Real]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:27:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:46] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-31 22:27:46] [INFO ] [Nat]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:27:46] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 3 ms to minimize.
[2024-05-31 22:27:47] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 2 ms to minimize.
[2024-05-31 22:27:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2024-05-31 22:27:47] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 77 ms.
[2024-05-31 22:27:47] [INFO ] Added : 11 causal constraints over 4 iterations in 260 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[31, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 47 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 51 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-31 22:27:50] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:27:50] [INFO ] Invariant cache hit.
[2024-05-31 22:27:51] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-31 22:27:51] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:27:51] [INFO ] Invariant cache hit.
[2024-05-31 22:27:51] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:27:52] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
[2024-05-31 22:27:52] [INFO ] Redundant transitions in 18 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-31 22:27:52] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:27:52] [INFO ] Invariant cache hit.
[2024-05-31 22:27:52] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-31 22:28:08] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64519ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66421 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-31 22:28:57] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :[2, 0, 0, 3, 1, 1, 3, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[31, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40008 steps (8 resets) in 763 ms. (52 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
[2024-05-31 22:28:58] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:28:58] [INFO ] Invariant cache hit.
[2024-05-31 22:28:58] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 383/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 656/1046 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1046 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 82/1128 variables, 19/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1128 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1128 variables, 83/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1128 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 11/1139 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1139 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1139 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 53/1192 variables, 37/533 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1192 variables, 7/540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1192 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 10/1202 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1202 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 549 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3085 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 383/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 656/1046 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1046 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 82/1128 variables, 19/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1128 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1128 variables, 83/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1128 variables, 8/502 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 22:29:02] [INFO ] Deduced a trap composed of 135 places in 152 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1128 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1128 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 11/1139 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1139 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1139 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 53/1192 variables, 37/542 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1192 variables, 7/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1192 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 10/1202 variables, 8/557 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1202 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1202 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/1202 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 558 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 4750ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 48013 ms.
Support contains 7 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Applied a total of 6 rules in 60 ms. Remains 452 /455 variables (removed 3) and now considering 1292/1297 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 452/455 places, 1292/1297 transitions.
RANDOM walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 212870 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 8
Probabilistic random walk after 212870 steps, saw 131142 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-31 22:29:54] [INFO ] Flow matrix only has 742 transitions (discarded 550 similar events)
// Phase 1: matrix 742 rows 452 cols
[2024-05-31 22:29:54] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 22:29:54] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 383/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 656/1046 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1046 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 80/1126 variables, 19/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1126 variables, 81/492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1126 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 11/1137 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1137 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1137 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 50/1187 variables, 36/530 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1187 variables, 7/537 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1187 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 7/1194 variables, 6/543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1194 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/1194 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1194/1194 variables, and 543 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 452/452 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 383/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 656/1046 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1046 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 80/1126 variables, 19/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1126 variables, 81/492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1126 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1126 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 11/1137 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1137 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1137 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 50/1187 variables, 36/538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1187 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1187 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 7/1194 variables, 6/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1194 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1194 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1194/1194 variables, and 551 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 452/452 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 2740ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 47227 ms.
Support contains 7 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1292/1292 transitions.
Applied a total of 0 rules in 53 ms. Remains 452 /452 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 452/452 places, 1292/1292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1292/1292 transitions.
Applied a total of 0 rules in 50 ms. Remains 452 /452 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2024-05-31 22:30:44] [INFO ] Flow matrix only has 742 transitions (discarded 550 similar events)
[2024-05-31 22:30:44] [INFO ] Invariant cache hit.
[2024-05-31 22:30:44] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-31 22:30:44] [INFO ] Flow matrix only has 742 transitions (discarded 550 similar events)
[2024-05-31 22:30:44] [INFO ] Invariant cache hit.
[2024-05-31 22:30:45] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-31 22:30:46] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
[2024-05-31 22:30:46] [INFO ] Redundant transitions in 21 ms returned []
Running 1290 sub problems to find dead transitions.
[2024-05-31 22:30:46] [INFO ] Flow matrix only has 742 transitions (discarded 550 similar events)
[2024-05-31 22:30:46] [INFO ] Invariant cache hit.
[2024-05-31 22:30:46] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-31 22:31:02] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/1194 variables, and 4 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/452 constraints, ReadFeed: 0/88 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (OVERLAPS) 742/1194 variables, 452/456 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1194 variables, 88/544 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1194 variables, 1290/1834 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1194/1194 variables, and 1834 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 452/452 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 1/1 constraints]
After SMT, in 64231ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 64243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66650 ms. Remains : 452/452 places, 1292/1292 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[31, 265, 270, 212, 104, 13, 221, 241] Max Struct:[32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-01
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:[32]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[32]
[2024-05-31 22:31:51] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:31:51] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[32]
RANDOM walk for 10000 steps (2 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[32]
[2024-05-31 22:31:51] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:31:51] [INFO ] Invariant cache hit.
[2024-05-31 22:31:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:31:51] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:31:51] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:31:51] [INFO ] [Real]Added 91 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:31:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:31:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:31:51] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:31:51] [INFO ] [Nat]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-31 22:31:51] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 75 ms.
[2024-05-31 22:31:51] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 290 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[32]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 446 transition count 1276
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 446 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 446 transition count 1272
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 440 transition count 1258
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 435 transition count 1246
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 431 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 431 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 427 transition count 1228
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 427 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 423 transition count 1220
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 423 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 419 transition count 1212
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 419 transition count 1212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 416 transition count 1206
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 416 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 414 transition count 1202
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 413 transition count 1200
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 413 transition count 1200
Applied a total of 88 rules in 150 ms. Remains 413 /455 variables (removed 42) and now considering 1200/1297 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 413/455 places, 1200/1297 transitions.
[2024-05-31 22:31:52] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-31 22:31:52] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[32]
RANDOM walk for 1000000 steps (2 resets) in 2283 ms. (437 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 902 ms. (1107 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[32]
[2024-05-31 22:31:55] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:31:55] [INFO ] Invariant cache hit.
[2024-05-31 22:31:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:31:55] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:31:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 22:31:55] [INFO ] [Real]Added 72 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:31:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:31:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:31:56] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-31 22:31:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:31:56] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 61 ms.
[2024-05-31 22:31:56] [INFO ] Added : 3 causal constraints over 1 iterations in 145 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31] Max Struct:[32]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 56 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 45 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-31 22:31:56] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:31:56] [INFO ] Invariant cache hit.
[2024-05-31 22:31:56] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-31 22:31:56] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:31:56] [INFO ] Invariant cache hit.
[2024-05-31 22:31:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 22:31:58] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 1662 ms to find 0 implicit places.
[2024-05-31 22:31:58] [INFO ] Redundant transitions in 20 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-31 22:31:58] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:31:58] [INFO ] Invariant cache hit.
[2024-05-31 22:31:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-31 22:32:12] [INFO ] Deduced a trap composed of 131 places in 103 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 33885ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 33897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35631 ms. Remains : 413/413 places, 1200/1200 transitions.
[2024-05-31 22:32:32] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:32:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[31] Max Struct:[32]
RANDOM walk for 1000000 steps (2 resets) in 2304 ms. (433 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 916 ms. (1090 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[31] Max Struct:[32]
[2024-05-31 22:32:35] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:32:35] [INFO ] Invariant cache hit.
[2024-05-31 22:32:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:32:35] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:32:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 22:32:35] [INFO ] [Real]Added 72 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:32:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:32:35] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:32:36] [INFO ] [Nat]Added 72 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:32:36] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 60 ms.
[2024-05-31 22:32:36] [INFO ] Added : 3 causal constraints over 1 iterations in 148 ms. Result :sat
Minimization took 263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[31] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31] Max Struct:[32]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 51 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-31 22:32:36] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:32:36] [INFO ] Invariant cache hit.
[2024-05-31 22:32:36] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 22:32:36] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:32:36] [INFO ] Invariant cache hit.
[2024-05-31 22:32:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 22:32:38] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
[2024-05-31 22:32:38] [INFO ] Redundant transitions in 17 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-31 22:32:38] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:32:38] [INFO ] Invariant cache hit.
[2024-05-31 22:32:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-31 22:32:52] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 33759ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 33775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35583 ms. Remains : 413/413 places, 1200/1200 transitions.
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 335888 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 335888 steps, saw 205972 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-31 22:33:15] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-31 22:33:15] [INFO ] Invariant cache hit.
[2024-05-31 22:33:15] [INFO ] State equation strengthened by 72 read => feed constraints.
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) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 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) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 990ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 3 resets, run visited all 2 properties in 15 ms. (steps per millisecond=66 )
Parikh walk visited 2 properties in 18 ms.
FORMULA FunctionPointer-PT-c032-UpperBounds-01 32 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-01 in 85230 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-04
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:33:16] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:33:16] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:33:16] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:33:16] [INFO ] Invariant cache hit.
[2024-05-31 22:33:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:33:16] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:33:16] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:33:16] [INFO ] [Real]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-31 22:33:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:33:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:33:16] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:33:16] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-31 22:33:16] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-31 22:33:17] [INFO ] Added : 1 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 447 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 442 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 438 transition count 1252
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 438 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 434 transition count 1242
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 434 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 430 transition count 1234
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 430 transition count 1234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 426 transition count 1226
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 426 transition count 1226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 422 transition count 1218
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 422 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 419 transition count 1212
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 417 transition count 1208
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 416 transition count 1206
Applied a total of 82 rules in 125 ms. Remains 416 /455 variables (removed 39) and now considering 1206/1297 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 416/455 places, 1206/1297 transitions.
[2024-05-31 22:33:17] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 22:33:17] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2024-05-31 22:33:17] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2181 ms. (458 steps per ms)
FORMULA FunctionPointer-PT-c032-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-04 in 3789 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-05
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:33:20] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:33:20] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:33:20] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:33:20] [INFO ] Invariant cache hit.
[2024-05-31 22:33:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:33:20] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:33:20] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:33:20] [INFO ] [Real]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 22:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:33:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:33:20] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 22:33:20] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 22:33:20] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-31 22:33:20] [INFO ] Added : 1 causal constraints over 1 iterations in 140 ms. Result :sat
Minimization took 280 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 442 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 442 transition count 1264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 437 transition count 1252
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 437 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 433 transition count 1242
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 433 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 429 transition count 1234
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 429 transition count 1234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 425 transition count 1226
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 425 transition count 1226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 421 transition count 1218
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 421 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 418 transition count 1212
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 418 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 416 transition count 1208
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 415 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 415 transition count 1206
Applied a total of 82 rules in 137 ms. Remains 415 /455 variables (removed 40) and now considering 1206/1297 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 415/455 places, 1206/1297 transitions.
[2024-05-31 22:33:21] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:33:21] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2024-05-31 22:33:21] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 2190 ms. (456 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 880 ms. (1135 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[715] Max Struct:[+inf]
[2024-05-31 22:33:24] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:33:24] [INFO ] Invariant cache hit.
[2024-05-31 22:33:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:33:24] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-31 22:33:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:33:24] [INFO ] [Real]Added 74 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:33:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:33:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:33:25] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-31 22:33:25] [INFO ] [Nat]Added 74 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:33:25] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 2 ms to minimize.
[2024-05-31 22:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2024-05-31 22:33:25] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 56 ms.
[2024-05-31 22:33:25] [INFO ] Deduced a trap composed of 247 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:33:26] [INFO ] Deduced a trap composed of 189 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:33:26] [INFO ] Deduced a trap composed of 186 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:33:26] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:33:26] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:33:26] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:33:27] [INFO ] Deduced a trap composed of 135 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:33:27] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 2 ms to minimize.
[2024-05-31 22:33:27] [INFO ] Deduced a trap composed of 132 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:33:27] [INFO ] Deduced a trap composed of 249 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:33:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2054 ms
[2024-05-31 22:33:27] [INFO ] Added : 7 causal constraints over 4 iterations in 2331 ms. Result :sat
Minimization took 276 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[715] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[715] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-31 22:33:30] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:33:30] [INFO ] Invariant cache hit.
[2024-05-31 22:33:30] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-31 22:33:30] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:33:30] [INFO ] Invariant cache hit.
[2024-05-31 22:33:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:33:32] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2024-05-31 22:33:32] [INFO ] Redundant transitions in 19 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-31 22:33:32] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:33:32] [INFO ] Invariant cache hit.
[2024-05-31 22:33:32] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-31 22:33:48] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34116ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35677 ms. Remains : 415/415 places, 1206/1206 transitions.
[2024-05-31 22:34:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[715] Max Struct:[+inf]
[2024-05-31 22:34:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:34:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[715] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2211 ms. (452 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 974 ms. (1025 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[749] Max Struct:[+inf]
[2024-05-31 22:34:09] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:34:09] [INFO ] Invariant cache hit.
[2024-05-31 22:34:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:34:10] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:34:10] [INFO ] [Real]Added 74 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:34:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Nat]Added 74 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:34:10] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-31 22:34:10] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 66 ms.
[2024-05-31 22:34:11] [INFO ] Deduced a trap composed of 247 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:34:11] [INFO ] Deduced a trap composed of 189 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:34:11] [INFO ] Deduced a trap composed of 186 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:34:11] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:34:11] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:34:12] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:34:12] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:34:12] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:34:12] [INFO ] Deduced a trap composed of 132 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:34:12] [INFO ] Deduced a trap composed of 249 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:34:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2104 ms
[2024-05-31 22:34:13] [INFO ] Added : 7 causal constraints over 4 iterations in 2401 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[749] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[749] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-31 22:34:16] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:34:16] [INFO ] Invariant cache hit.
[2024-05-31 22:34:16] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 22:34:16] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:34:16] [INFO ] Invariant cache hit.
[2024-05-31 22:34:16] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:34:17] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2024-05-31 22:34:17] [INFO ] Redundant transitions in 22 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-31 22:34:17] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:34:17] [INFO ] Invariant cache hit.
[2024-05-31 22:34:17] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-31 22:34:35] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34521ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34533ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36111 ms. Remains : 415/415 places, 1206/1206 transitions.
[2024-05-31 22:34:52] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[749] Max Struct:[+inf]
[2024-05-31 22:34:52] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:34:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[749] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2198 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 894 ms. (1117 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[749] Max Struct:[+inf]
[2024-05-31 22:34:55] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:34:55] [INFO ] Invariant cache hit.
[2024-05-31 22:34:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:34:55] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 22:34:55] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:34:55] [INFO ] [Real]Added 74 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:34:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:34:56] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:34:56] [INFO ] [Nat]Added 74 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2024-05-31 22:34:56] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 68 ms.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 247 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 189 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 186 places in 182 ms of which 5 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 2 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 135 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 2 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 249 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2094 ms
[2024-05-31 22:34:58] [INFO ] Added : 7 causal constraints over 4 iterations in 2384 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[749] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[749] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 59 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-31 22:35:01] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:35:01] [INFO ] Invariant cache hit.
[2024-05-31 22:35:02] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-31 22:35:02] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:35:02] [INFO ] Invariant cache hit.
[2024-05-31 22:35:02] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:35:03] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2024-05-31 22:35:03] [INFO ] Redundant transitions in 19 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-31 22:35:03] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:35:03] [INFO ] Invariant cache hit.
[2024-05-31 22:35:03] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-31 22:35:20] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 timeout
0.0)
(s154 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34302ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34312ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35891 ms. Remains : 415/415 places, 1206/1206 transitions.
[2024-05-31 22:35:37] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[749] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 603757 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 603757 steps, saw 370170 distinct states, run finished after 3003 ms. (steps per millisecond=201 ) properties seen :0
[2024-05-31 22:35:41] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:35:41] [INFO ] Invariant cache hit.
[2024-05-31 22:35:41] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 692ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1688 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 415/415 places, 1206/1206 transitions.
RANDOM walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 607112 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 607112 steps, saw 372225 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2024-05-31 22:35:46] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:35:46] [INFO ] Invariant cache hit.
[2024-05-31 22:35:46] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1681 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 45 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 73 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-31 22:35:49] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:35:49] [INFO ] Invariant cache hit.
[2024-05-31 22:35:49] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-31 22:35:49] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:35:49] [INFO ] Invariant cache hit.
[2024-05-31 22:35:49] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:35:50] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2024-05-31 22:35:50] [INFO ] Redundant transitions in 20 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-31 22:35:50] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-31 22:35:50] [INFO ] Invariant cache hit.
[2024-05-31 22:35:50] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-31 22:36:08] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34352ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34362ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35946 ms. Remains : 415/415 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 17 transition count 25
Applied a total of 1389 rules in 76 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2024-05-31 22:36:25] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:36:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:36:25] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:36:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:36:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:36:25] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:36:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:36:25] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:36:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:36:25] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:36:25] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 149 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[749] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-05 in 185039 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-07
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:36:25] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:36:25] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:36:25] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:36:25] [INFO ] Invariant cache hit.
[2024-05-31 22:36:25] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:36:25] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-31 22:36:25] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:36:25] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:36:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:36:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:36:25] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:36:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:36:25] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 79 ms.
[2024-05-31 22:36:25] [INFO ] Added : 3 causal constraints over 1 iterations in 185 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1280
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 442 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 438 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 435 transition count 1246
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 432 transition count 1240
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 429 transition count 1234
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 426 transition count 1228
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 426 transition count 1228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 423 transition count 1222
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 423 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 421 transition count 1218
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 420 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 420 transition count 1216
Applied a total of 74 rules in 147 ms. Remains 420 /455 variables (removed 35) and now considering 1216/1297 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 420/455 places, 1216/1297 transitions.
[2024-05-31 22:36:26] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:36:26] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-31 22:36:26] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2206 ms. (453 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 835 ms. (1196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:36:29] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:36:29] [INFO ] Invariant cache hit.
[2024-05-31 22:36:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:36:29] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:36:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:36:29] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:36:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:36:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:36:30] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:36:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:36:30] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:36:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2024-05-31 22:36:30] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 75 ms.
[2024-05-31 22:36:30] [INFO ] Added : 8 causal constraints over 3 iterations in 260 ms. Result :sat
Minimization took 275 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 45 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 44 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-31 22:36:31] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:36:31] [INFO ] Invariant cache hit.
[2024-05-31 22:36:31] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-31 22:36:31] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:36:31] [INFO ] Invariant cache hit.
[2024-05-31 22:36:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:36:32] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2024-05-31 22:36:32] [INFO ] Redundant transitions in 19 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-31 22:36:32] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:36:32] [INFO ] Invariant cache hit.
[2024-05-31 22:36:32] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-31 22:36:46] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33869ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33880ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35496 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-31 22:37:06] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 657076 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 1
Probabilistic random walk after 657076 steps, saw 402860 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
[2024-05-31 22:37:09] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:37:09] [INFO ] Invariant cache hit.
[2024-05-31 22:37:09] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 46 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 420/420 places, 1216/1216 transitions.
RANDOM walk for 40008 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675958 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 675958 steps, saw 414438 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2024-05-31 22:37:13] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:37:13] [INFO ] Invariant cache hit.
[2024-05-31 22:37:13] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 602ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-31 22:37:14] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:37:14] [INFO ] Invariant cache hit.
[2024-05-31 22:37:14] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-31 22:37:14] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:37:14] [INFO ] Invariant cache hit.
[2024-05-31 22:37:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:37:15] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
[2024-05-31 22:37:15] [INFO ] Redundant transitions in 20 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-31 22:37:15] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 22:37:15] [INFO ] Invariant cache hit.
[2024-05-31 22:37:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-31 22:37:30] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 34034ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 34044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35672 ms. Remains : 420/420 places, 1216/1216 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 529 transitions
Reduce isomorphic transitions removed 529 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 420 transition count 677
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 549 place count 410 transition count 677
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 549 place count 410 transition count 605
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 693 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 947 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1011 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1075 place count 147 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1077 place count 147 transition count 348
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1140 place count 84 transition count 222
Iterating global reduction 3 with 63 rules applied. Total rules applied 1203 place count 84 transition count 222
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1266 place count 21 transition count 96
Iterating global reduction 3 with 63 rules applied. Total rules applied 1329 place count 21 transition count 96
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1392 place count 21 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1392 place count 21 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1394 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 19 transition count 31
Applied a total of 1396 rules in 27 ms. Remains 19 /420 variables (removed 401) and now considering 31/1216 (removed 1185) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 22:37:49] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:37:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:37:49] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:37:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:37:49] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:37:49] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:37:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:37:50] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:37:50] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:37:50] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:37:50] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 98 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-07 in 84903 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-10
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:37:50] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:37:50] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:37:50] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:37:50] [INFO ] Invariant cache hit.
[2024-05-31 22:37:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:37:50] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:37:50] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:37:50] [INFO ] [Real]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:37:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:37:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:37:50] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:37:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-31 22:37:50] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 4 ms to minimize.
[2024-05-31 22:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-31 22:37:50] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 71 ms.
[2024-05-31 22:37:51] [INFO ] Added : 9 causal constraints over 3 iterations in 261 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 447 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 442 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 438 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 435 transition count 1246
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 432 transition count 1240
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 429 transition count 1234
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 426 transition count 1228
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 424 transition count 1224
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 422 transition count 1220
Applied a total of 72 rules in 139 ms. Remains 422 /455 variables (removed 33) and now considering 1220/1297 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 422/455 places, 1220/1297 transitions.
[2024-05-31 22:37:51] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 22:37:51] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-31 22:37:51] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2190 ms. (456 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 883 ms. (1131 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[188] Max Struct:[+inf]
[2024-05-31 22:37:54] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:37:54] [INFO ] Invariant cache hit.
[2024-05-31 22:37:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:37:55] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 22:37:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:37:55] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2024-05-31 22:37:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:37:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:37:55] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:37:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:37:55] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:37:55] [INFO ] Deduced a trap composed of 109 places in 192 ms of which 3 ms to minimize.
[2024-05-31 22:37:56] [INFO ] Deduced a trap composed of 87 places in 190 ms of which 2 ms to minimize.
[2024-05-31 22:37:56] [INFO ] Deduced a trap composed of 85 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:37:56] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:37:56] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:37:56] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:37:57] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:37:57] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 4 ms to minimize.
[2024-05-31 22:37:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1944 ms
[2024-05-31 22:37:57] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 60 ms.
[2024-05-31 22:37:57] [INFO ] Added : 12 causal constraints over 4 iterations in 294 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[188] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[188] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 85 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 22:37:59] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:37:59] [INFO ] Invariant cache hit.
[2024-05-31 22:37:59] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-31 22:37:59] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:37:59] [INFO ] Invariant cache hit.
[2024-05-31 22:37:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:38:01] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2262 ms to find 0 implicit places.
[2024-05-31 22:38:01] [INFO ] Redundant transitions in 19 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 22:38:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:38:01] [INFO ] Invariant cache hit.
[2024-05-31 22:38:01] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 22:38:15] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34227ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36619 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-31 22:38:35] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[188] Max Struct:[+inf]
[2024-05-31 22:38:35] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:38:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[188] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2359 ms. (423 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 930 ms. (1074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[188] Max Struct:[+inf]
[2024-05-31 22:38:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:38:39] [INFO ] Invariant cache hit.
[2024-05-31 22:38:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:38:39] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:38:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:38:39] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:38:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:38:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:38:39] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 22:38:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:38:39] [INFO ] Deduced a trap composed of 113 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:38:40] [INFO ] Deduced a trap composed of 109 places in 190 ms of which 2 ms to minimize.
[2024-05-31 22:38:40] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:38:40] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 2 ms to minimize.
[2024-05-31 22:38:40] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:38:40] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:38:41] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:38:41] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 2 ms to minimize.
[2024-05-31 22:38:41] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 2 ms to minimize.
[2024-05-31 22:38:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1921 ms
[2024-05-31 22:38:41] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 72 ms.
[2024-05-31 22:38:41] [INFO ] Added : 12 causal constraints over 4 iterations in 293 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[188] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[188] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 48 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 47 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 22:38:43] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:38:43] [INFO ] Invariant cache hit.
[2024-05-31 22:38:43] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-31 22:38:43] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:38:43] [INFO ] Invariant cache hit.
[2024-05-31 22:38:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:38:45] [INFO ] Implicit Places using invariants and state equation in 2023 ms returned []
Implicit Place search using SMT with State Equation took 2324 ms to find 0 implicit places.
[2024-05-31 22:38:45] [INFO ] Redundant transitions in 15 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 22:38:45] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:38:45] [INFO ] Invariant cache hit.
[2024-05-31 22:38:45] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 22:39:00] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34418ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34428ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36826 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-31 22:39:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[188] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 652424 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 1
Probabilistic random walk after 652424 steps, saw 400009 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
[2024-05-31 22:39:23] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:39:23] [INFO ] Invariant cache hit.
[2024-05-31 22:39:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1068 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 46 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 624803 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 624803 steps, saw 383073 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
[2024-05-31 22:39:28] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:39:28] [INFO ] Invariant cache hit.
[2024-05-31 22:39:28] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1100 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 22:39:29] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:39:29] [INFO ] Invariant cache hit.
[2024-05-31 22:39:30] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-31 22:39:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:39:30] [INFO ] Invariant cache hit.
[2024-05-31 22:39:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:39:32] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2320 ms to find 0 implicit places.
[2024-05-31 22:39:32] [INFO ] Redundant transitions in 22 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 22:39:32] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:39:32] [INFO ] Invariant cache hit.
[2024-05-31 22:39:32] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 22:39:46] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34267ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36674 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 27 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-31 22:40:06] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:40:06] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:40:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:40:06] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:40:06] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:40:06] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:40:06] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:40:06] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:40:06] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 100 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[188] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-10 in 136689 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-11
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:40:06] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:40:06] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:40:06] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:40:06] [INFO ] Invariant cache hit.
[2024-05-31 22:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:40:06] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 22:40:07] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:40:07] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:40:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:40:07] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:40:07] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-31 22:40:07] [INFO ] Deduced a trap composed of 84 places in 214 ms of which 3 ms to minimize.
[2024-05-31 22:40:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-31 22:40:07] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 74 ms.
[2024-05-31 22:40:07] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 309 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 449 transition count 1281
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 449 transition count 1281
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 449 transition count 1277
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 443 transition count 1263
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 443 transition count 1263
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 438 transition count 1251
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 438 transition count 1251
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 434 transition count 1241
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 434 transition count 1241
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 430 transition count 1233
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 430 transition count 1233
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 426 transition count 1225
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 426 transition count 1225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 422 transition count 1217
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 422 transition count 1217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 419 transition count 1211
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 419 transition count 1211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 417 transition count 1207
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 416 transition count 1205
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 416 transition count 1205
Applied a total of 82 rules in 130 ms. Remains 416 /455 variables (removed 39) and now considering 1205/1297 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 416/455 places, 1205/1297 transitions.
[2024-05-31 22:40:08] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 22:40:08] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-31 22:40:08] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2294 ms. (435 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 948 ms. (1053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 22:40:11] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:11] [INFO ] Invariant cache hit.
[2024-05-31 22:40:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:40:12] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:40:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:40:12] [INFO ] [Real]Added 75 Read/Feed constraints in 24 ms returned sat
[2024-05-31 22:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:40:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:40:12] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:40:12] [INFO ] [Nat]Added 75 Read/Feed constraints in 44 ms returned sat
[2024-05-31 22:40:12] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 2 ms to minimize.
[2024-05-31 22:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-05-31 22:40:12] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 66 ms.
[2024-05-31 22:40:12] [INFO ] Added : 5 causal constraints over 2 iterations in 205 ms. Result :sat
Minimization took 275 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[32] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 51 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 47 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 22:40:13] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:13] [INFO ] Invariant cache hit.
[2024-05-31 22:40:13] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-31 22:40:13] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:13] [INFO ] Invariant cache hit.
[2024-05-31 22:40:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:40:15] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2024-05-31 22:40:15] [INFO ] Redundant transitions in 21 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 22:40:15] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:15] [INFO ] Invariant cache hit.
[2024-05-31 22:40:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 22:40:29] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34546ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36568 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-31 22:40:49] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[32] Max Struct:[+inf]
[2024-05-31 22:40:50] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[32] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1772 ms. (564 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 895 ms. (1116 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[42] Max Struct:[+inf]
[2024-05-31 22:40:52] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:52] [INFO ] Invariant cache hit.
[2024-05-31 22:40:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:40:53] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:40:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:40:53] [INFO ] [Real]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:40:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:40:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:40:53] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 22:40:53] [INFO ] [Nat]Added 75 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:40:53] [INFO ] Deduced a trap composed of 80 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:40:53] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:40:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2024-05-31 22:40:53] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 59 ms.
[2024-05-31 22:40:54] [INFO ] Deduced a trap composed of 202 places in 194 ms of which 2 ms to minimize.
[2024-05-31 22:40:54] [INFO ] Deduced a trap composed of 188 places in 185 ms of which 2 ms to minimize.
[2024-05-31 22:40:54] [INFO ] Deduced a trap composed of 249 places in 178 ms of which 2 ms to minimize.
[2024-05-31 22:40:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 689 ms
[2024-05-31 22:40:54] [INFO ] Added : 9 causal constraints over 3 iterations in 923 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[42] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[42] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 41 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 43 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 22:40:55] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:55] [INFO ] Invariant cache hit.
[2024-05-31 22:40:55] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-31 22:40:55] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:55] [INFO ] Invariant cache hit.
[2024-05-31 22:40:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:40:57] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2024-05-31 22:40:57] [INFO ] Redundant transitions in 19 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 22:40:57] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:40:57] [INFO ] Invariant cache hit.
[2024-05-31 22:40:57] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34226ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36242 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-31 22:41:31] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[42] Max Struct:[+inf]
[2024-05-31 22:41:31] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:41:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[42] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2185 ms. (457 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 866 ms. (1153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[42] Max Struct:[+inf]
[2024-05-31 22:41:34] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:41:34] [INFO ] Invariant cache hit.
[2024-05-31 22:41:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:41:34] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:41:34] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:41:35] [INFO ] [Real]Added 75 Read/Feed constraints in 41 ms returned sat
[2024-05-31 22:41:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:41:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:41:35] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-31 22:41:35] [INFO ] [Nat]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:41:35] [INFO ] Deduced a trap composed of 80 places in 197 ms of which 3 ms to minimize.
[2024-05-31 22:41:35] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:41:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
[2024-05-31 22:41:35] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 63 ms.
[2024-05-31 22:41:36] [INFO ] Deduced a trap composed of 202 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:41:36] [INFO ] Deduced a trap composed of 188 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:41:36] [INFO ] Deduced a trap composed of 249 places in 179 ms of which 2 ms to minimize.
[2024-05-31 22:41:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 670 ms
[2024-05-31 22:41:36] [INFO ] Added : 9 causal constraints over 3 iterations in 912 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[42] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[42] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 44 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 50 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 22:41:37] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:41:37] [INFO ] Invariant cache hit.
[2024-05-31 22:41:37] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-31 22:41:37] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:41:37] [INFO ] Invariant cache hit.
[2024-05-31 22:41:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:41:39] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2024-05-31 22:41:39] [INFO ] Redundant transitions in 20 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 22:41:39] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:41:39] [INFO ] Invariant cache hit.
[2024-05-31 22:41:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 22:41:53] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34232ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36304 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-31 22:42:13] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[42] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 616633 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 616633 steps, saw 378098 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2024-05-31 22:42:16] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:42:16] [INFO ] Invariant cache hit.
[2024-05-31 22:42:16] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 598/952 variables, 333/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 74/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 167 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 43 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 416/416 places, 1205/1205 transitions.
RANDOM walk for 40000 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 624286 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 624286 steps, saw 382787 distinct states, run finished after 3003 ms. (steps per millisecond=207 ) properties seen :0
[2024-05-31 22:42:20] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:42:20] [INFO ] Invariant cache hit.
[2024-05-31 22:42:20] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 598/952 variables, 333/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 74/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 43 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 43 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 22:42:21] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:42:21] [INFO ] Invariant cache hit.
[2024-05-31 22:42:21] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-31 22:42:21] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:42:21] [INFO ] Invariant cache hit.
[2024-05-31 22:42:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:42:23] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2024-05-31 22:42:23] [INFO ] Redundant transitions in 15 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 22:42:23] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:42:23] [INFO ] Invariant cache hit.
[2024-05-31 22:42:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 22:42:38] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34220ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34231ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36251 ms. Remains : 416/416 places, 1205/1205 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 669
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 405 transition count 669
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 547 place count 405 transition count 600
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 685 place count 336 transition count 600
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 939 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 2 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1068 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1070 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 3 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 3 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1385 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1387 place count 17 transition count 27
Applied a total of 1387 rules in 26 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 17 cols
[2024-05-31 22:42:57] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 22:42:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:42:57] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:42:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:42:57] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:42:57] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:42:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:42:57] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:42:57] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:42:57] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:42:57] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 99 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[42] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-11 in 171153 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-13
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:42:57] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:42:57] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:42:57] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:42:57] [INFO ] Invariant cache hit.
[2024-05-31 22:42:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:42:58] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 22:42:58] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:42:58] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-31 22:42:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:42:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:42:58] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:42:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:42:58] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-31 22:42:58] [INFO ] Added : 14 causal constraints over 4 iterations in 279 ms. Result :sat
Minimization took 298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 442 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 438 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 435 transition count 1248
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 432 transition count 1242
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 432 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 429 transition count 1236
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 429 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 426 transition count 1230
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 426 transition count 1230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 424 transition count 1226
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 423 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 423 transition count 1224
Applied a total of 66 rules in 130 ms. Remains 423 /455 variables (removed 32) and now considering 1224/1297 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 423/455 places, 1224/1297 transitions.
[2024-05-31 22:42:59] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 22:42:59] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2024-05-31 22:42:59] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2156 ms. (463 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 943 ms. (1059 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[194] Max Struct:[+inf]
[2024-05-31 22:43:02] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:02] [INFO ] Invariant cache hit.
[2024-05-31 22:43:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:43:02] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-31 22:43:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:43:02] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:43:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:43:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:43:03] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 22:43:03] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 113 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 94 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 2 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 3 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 3 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1533 ms
[2024-05-31 22:43:04] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 65 ms.
[2024-05-31 22:43:04] [INFO ] Added : 24 causal constraints over 6 iterations in 329 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[194] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[194] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 45 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 44 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 22:43:06] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:06] [INFO ] Invariant cache hit.
[2024-05-31 22:43:06] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-31 22:43:06] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:06] [INFO ] Invariant cache hit.
[2024-05-31 22:43:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:43:08] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2024-05-31 22:43:08] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 22:43:08] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:08] [INFO ] Invariant cache hit.
[2024-05-31 22:43:08] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34506ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34518ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36340 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 22:43:42] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[194] Max Struct:[+inf]
[2024-05-31 22:43:43] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[194] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2204 ms. (453 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 928 ms. (1076 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[197] Max Struct:[+inf]
[2024-05-31 22:43:46] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:46] [INFO ] Invariant cache hit.
[2024-05-31 22:43:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:43:46] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-31 22:43:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:43:46] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:43:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:43:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:43:46] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-31 22:43:46] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 2 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 2 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 80 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 3 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 73 places in 188 ms of which 2 ms to minimize.
[2024-05-31 22:43:48] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:43:48] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 2 ms to minimize.
[2024-05-31 22:43:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1518 ms
[2024-05-31 22:43:48] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 67 ms.
[2024-05-31 22:43:48] [INFO ] Added : 24 causal constraints over 6 iterations in 341 ms. Result :sat
Minimization took 290 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[197] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 47 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 46 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 22:43:50] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:50] [INFO ] Invariant cache hit.
[2024-05-31 22:43:50] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-31 22:43:50] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:50] [INFO ] Invariant cache hit.
[2024-05-31 22:43:50] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:43:52] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
[2024-05-31 22:43:52] [INFO ] Redundant transitions in 15 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 22:43:52] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:43:52] [INFO ] Invariant cache hit.
[2024-05-31 22:43:52] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 22:44:07] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34557ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34568ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36377 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 22:44:26] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[197] Max Struct:[+inf]
[2024-05-31 22:44:26] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:44:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[197] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 2265 ms. (441 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1108 ms. (901 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200] Max Struct:[+inf]
[2024-05-31 22:44:30] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:44:30] [INFO ] Invariant cache hit.
[2024-05-31 22:44:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:44:30] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-31 22:44:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:44:30] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:44:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:44:30] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-31 22:44:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:44:31] [INFO ] Deduced a trap composed of 113 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:44:31] [INFO ] Deduced a trap composed of 94 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:44:31] [INFO ] Deduced a trap composed of 80 places in 197 ms of which 2 ms to minimize.
[2024-05-31 22:44:31] [INFO ] Deduced a trap composed of 78 places in 191 ms of which 2 ms to minimize.
[2024-05-31 22:44:31] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:44:32] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 3 ms to minimize.
[2024-05-31 22:44:32] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 5 ms to minimize.
[2024-05-31 22:44:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1528 ms
[2024-05-31 22:44:32] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 74 ms.
[2024-05-31 22:44:32] [INFO ] Added : 24 causal constraints over 6 iterations in 344 ms. Result :sat
Minimization took 276 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 52 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 46 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 22:44:34] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:44:34] [INFO ] Invariant cache hit.
[2024-05-31 22:44:34] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-31 22:44:34] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:44:34] [INFO ] Invariant cache hit.
[2024-05-31 22:44:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:44:36] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2024-05-31 22:44:36] [INFO ] Redundant transitions in 14 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 22:44:36] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:44:36] [INFO ] Invariant cache hit.
[2024-05-31 22:44:36] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 22:44:51] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34423ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36272 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 22:45:10] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[200] Max Struct:[+inf]
[2024-05-31 22:45:10] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:45:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[200] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2203 ms. (453 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1014 ms. (985 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200] Max Struct:[+inf]
[2024-05-31 22:45:14] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:45:14] [INFO ] Invariant cache hit.
[2024-05-31 22:45:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:45:14] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:45:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:45:14] [INFO ] [Real]Added 75 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:45:14] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:45:14] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:45:14] [INFO ] Deduced a trap composed of 113 places in 189 ms of which 2 ms to minimize.
[2024-05-31 22:45:15] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 2 ms to minimize.
[2024-05-31 22:45:15] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 2 ms to minimize.
[2024-05-31 22:45:15] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:45:15] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 3 ms to minimize.
[2024-05-31 22:45:16] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:45:16] [INFO ] Deduced a trap composed of 78 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:45:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1497 ms
[2024-05-31 22:45:16] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 60 ms.
[2024-05-31 22:45:16] [INFO ] Added : 24 causal constraints over 6 iterations in 344 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 57 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 45 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 22:45:18] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:45:18] [INFO ] Invariant cache hit.
[2024-05-31 22:45:18] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 22:45:18] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:45:18] [INFO ] Invariant cache hit.
[2024-05-31 22:45:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:45:20] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2024-05-31 22:45:20] [INFO ] Redundant transitions in 21 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 22:45:20] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:45:20] [INFO ] Invariant cache hit.
[2024-05-31 22:45:20] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34549ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36389 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 22:45:54] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[200] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 667176 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 667176 steps, saw 424153 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-31 22:45:57] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:45:57] [INFO ] Invariant cache hit.
[2024-05-31 22:45:57] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 755 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 45 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 645772 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 1
Probabilistic random walk after 645772 steps, saw 409584 distinct states, run finished after 3002 ms. (steps per millisecond=215 ) properties seen :0
[2024-05-31 22:46:02] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:46:02] [INFO ] Invariant cache hit.
[2024-05-31 22:46:02] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 786 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 56 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 49 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 22:46:04] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:46:04] [INFO ] Invariant cache hit.
[2024-05-31 22:46:04] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-31 22:46:04] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:46:04] [INFO ] Invariant cache hit.
[2024-05-31 22:46:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:46:05] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
[2024-05-31 22:46:05] [INFO ] Redundant transitions in 22 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 22:46:05] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:46:05] [INFO ] Invariant cache hit.
[2024-05-31 22:46:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 22:46:21] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34279ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36078 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 25 ms. Remains 19 /423 variables (removed 404) and now considering 31/1224 (removed 1193) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 22:46:40] [INFO ] Computed 3 invariants in 8 ms
[2024-05-31 22:46:40] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:46:40] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:46:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:46:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:46:40] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:46:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:46:40] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:46:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:46:40] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:46:40] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 109 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[200] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-13 in 222308 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-15
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:46:40] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-31 22:46:40] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:46:40] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-31 22:46:40] [INFO ] Invariant cache hit.
[2024-05-31 22:46:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:46:40] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:46:40] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 22:46:40] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:46:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:46:40] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:46:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:46:40] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 68 ms.
[2024-05-31 22:46:41] [INFO ] Added : 8 causal constraints over 3 iterations in 243 ms. Result :sat
Minimization took 280 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 447 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 442 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 438 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 435 transition count 1246
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 432 transition count 1240
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 429 transition count 1234
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 426 transition count 1228
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 424 transition count 1224
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 422 transition count 1220
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 421 transition count 1218
Applied a total of 72 rules in 135 ms. Remains 421 /455 variables (removed 34) and now considering 1218/1297 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 421/455 places, 1218/1297 transitions.
[2024-05-31 22:46:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:46:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-31 22:46:41] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2245 ms. (445 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 913 ms. (1094 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[487] Max Struct:[+inf]
[2024-05-31 22:46:44] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:46:44] [INFO ] Invariant cache hit.
[2024-05-31 22:46:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:46:45] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 22:46:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:46:45] [INFO ] [Real]Added 75 Read/Feed constraints in 50 ms returned sat
[2024-05-31 22:46:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:46:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:46:45] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:46:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:46:45] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:46:45] [INFO ] Deduced a trap composed of 109 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:46:46] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:46:46] [INFO ] Deduced a trap composed of 85 places in 187 ms of which 2 ms to minimize.
[2024-05-31 22:46:46] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 3 ms to minimize.
[2024-05-31 22:46:46] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:46:46] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:46:47] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:46:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1652 ms
[2024-05-31 22:46:47] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 64 ms.
[2024-05-31 22:46:47] [INFO ] Added : 10 causal constraints over 3 iterations in 258 ms. Result :sat
Minimization took 273 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[487] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[487] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 48 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:46:47] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:46:47] [INFO ] Invariant cache hit.
[2024-05-31 22:46:48] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-31 22:46:48] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:46:48] [INFO ] Invariant cache hit.
[2024-05-31 22:46:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:46:49] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2024-05-31 22:46:49] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:46:49] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:46:49] [INFO ] Invariant cache hit.
[2024-05-31 22:46:49] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:47:06] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34084ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34096ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35752 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:47:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[487] Max Struct:[+inf]
[2024-05-31 22:47:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:47:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[487] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2239 ms. (446 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 905 ms. (1103 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[487] Max Struct:[+inf]
[2024-05-31 22:47:26] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:47:26] [INFO ] Invariant cache hit.
[2024-05-31 22:47:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:47:27] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:47:27] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:47:27] [INFO ] [Real]Added 75 Read/Feed constraints in 48 ms returned sat
[2024-05-31 22:47:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:47:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:47:27] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:47:27] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:47:27] [INFO ] Deduced a trap composed of 113 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:47:27] [INFO ] Deduced a trap composed of 109 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:47:28] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:47:28] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:47:28] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:47:28] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:47:28] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:47:29] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 2 ms to minimize.
[2024-05-31 22:47:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1690 ms
[2024-05-31 22:47:29] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 64 ms.
[2024-05-31 22:47:29] [INFO ] Added : 10 causal constraints over 3 iterations in 244 ms. Result :sat
Minimization took 279 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[487] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[487] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:47:29] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:47:29] [INFO ] Invariant cache hit.
[2024-05-31 22:47:30] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-31 22:47:30] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:47:30] [INFO ] Invariant cache hit.
[2024-05-31 22:47:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:47:31] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
[2024-05-31 22:47:31] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:47:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:47:31] [INFO ] Invariant cache hit.
[2024-05-31 22:47:31] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:47:48] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34136ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35802 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:48:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[487] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 648524 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 1
Probabilistic random walk after 648524 steps, saw 397617 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
[2024-05-31 22:48:08] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:48:08] [INFO ] Invariant cache hit.
[2024-05-31 22:48:08] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2669 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 621293 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 1
Probabilistic random walk after 621293 steps, saw 380922 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
[2024-05-31 22:48:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:48:15] [INFO ] Invariant cache hit.
[2024-05-31 22:48:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2675 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 48 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:48:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:48:18] [INFO ] Invariant cache hit.
[2024-05-31 22:48:18] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-31 22:48:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:48:18] [INFO ] Invariant cache hit.
[2024-05-31 22:48:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:48:20] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-31 22:48:20] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:48:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:48:20] [INFO ] Invariant cache hit.
[2024-05-31 22:48:20] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:48:37] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34322ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35963 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 26 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 22:48:54] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 22:48:54] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:48:54] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:48:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:48:54] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:48:54] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:48:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:48:54] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:48:54] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:48:54] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:48:54] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 100 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[487] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-15 in 134473 ms.
[2024-05-31 22:48:54] [INFO ] Flatten gal took : 130 ms
[2024-05-31 22:48:54] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 22:48:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 455 places, 1297 transitions and 5316 arcs took 10 ms.
Total runtime 1880679 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FunctionPointer-PT-c032-UpperBounds-05
Could not compute solution for formula : FunctionPointer-PT-c032-UpperBounds-07
Could not compute solution for formula : FunctionPointer-PT-c032-UpperBounds-10
Could not compute solution for formula : FunctionPointer-PT-c032-UpperBounds-11
Could not compute solution for formula : FunctionPointer-PT-c032-UpperBounds-13
Could not compute solution for formula : FunctionPointer-PT-c032-UpperBounds-15
BK_STOP 1717195735297
--------------------
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 FunctionPointer-PT-c032-UpperBounds-05
ub formula formula --maxsum=/tmp/2989/ub_0_
ub formula name FunctionPointer-PT-c032-UpperBounds-07
ub formula formula --maxsum=/tmp/2989/ub_1_
ub formula name FunctionPointer-PT-c032-UpperBounds-10
ub formula formula --maxsum=/tmp/2989/ub_2_
ub formula name FunctionPointer-PT-c032-UpperBounds-11
ub formula formula --maxsum=/tmp/2989/ub_3_
ub formula name FunctionPointer-PT-c032-UpperBounds-13
ub formula formula --maxsum=/tmp/2989/ub_4_
ub formula name FunctionPointer-PT-c032-UpperBounds-15
ub formula formula --maxsum=/tmp/2989/ub_5_
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="FunctionPointer-PT-c032"
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 FunctionPointer-PT-c032, 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 r496-tall-171640603100309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 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 '
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 ;