About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d2m18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 724.880 | 261365.00 | 332528.00 | 768.90 | 0 ? 0 0 0 ? 1 0 0 0 0 0 0 0 0 0 | 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.r532-smll-171683810800117.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 SieveSingleMsgMbox-PT-d2m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800117
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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 SieveSingleMsgMbox-PT-d2m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717248152452
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:22:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:22:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:22:35] [INFO ] Load time of PNML (sax parser for PT used): 588 ms
[2024-06-01 13:22:35] [INFO ] Transformed 2398 places.
[2024-06-01 13:22:35] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:22:35] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 845 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 1984 places in 32 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2024-06-01 13:22:36] [INFO ] Computed 6 invariants in 95 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
RANDOM walk for 10000 steps (2174 resets) in 595 ms. (16 steps per ms)
BEST_FIRST walk for 50003 steps (4577 resets) in 418 ms. (119 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
[2024-06-01 13:22:37] [INFO ] Invariant cache hit.
[2024-06-01 13:22:37] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-06-01 13:22:37] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 26 ms returned sat
[2024-06-01 13:22:38] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2024-06-01 13:22:38] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-06-01 13:22:39] [INFO ] [Real]Added 1674 Read/Feed constraints in 853 ms returned sat
[2024-06-01 13:22:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:22:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:22:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 13:22:40] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-06-01 13:22:41] [INFO ] [Nat]Added 1674 Read/Feed constraints in 806 ms returned sat
[2024-06-01 13:22:41] [INFO ] Deduced a trap composed of 96 places in 396 ms of which 44 ms to minimize.
[2024-06-01 13:22:42] [INFO ] Deduced a trap composed of 103 places in 376 ms of which 6 ms to minimize.
[2024-06-01 13:22:42] [INFO ] Deduced a trap composed of 98 places in 325 ms of which 5 ms to minimize.
[2024-06-01 13:22:43] [INFO ] Deduced a trap composed of 109 places in 331 ms of which 4 ms to minimize.
[2024-06-01 13:22:43] [INFO ] Deduced a trap composed of 109 places in 322 ms of which 5 ms to minimize.
[2024-06-01 13:22:43] [INFO ] Deduced a trap composed of 108 places in 314 ms of which 5 ms to minimize.
[2024-06-01 13:22:44] [INFO ] Deduced a trap composed of 108 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:22:44] [INFO ] Deduced a trap composed of 116 places in 361 ms of which 4 ms to minimize.
[2024-06-01 13:22:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-06-01 13:22:45] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:22:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 13:22:45] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2024-06-01 13:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:22:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:22:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 13:22:46] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2024-06-01 13:22:46] [INFO ] [Nat]Added 1674 Read/Feed constraints in 619 ms returned sat
[2024-06-01 13:22:47] [INFO ] Deduced a trap composed of 103 places in 518 ms of which 4 ms to minimize.
[2024-06-01 13:22:48] [INFO ] Deduced a trap composed of 101 places in 503 ms of which 5 ms to minimize.
[2024-06-01 13:22:49] [INFO ] Deduced a trap composed of 253 places in 455 ms of which 5 ms to minimize.
[2024-06-01 13:22:49] [INFO ] Deduced a trap composed of 103 places in 430 ms of which 4 ms to minimize.
[2024-06-01 13:22:50] [INFO ] Deduced a trap composed of 101 places in 458 ms of which 5 ms to minimize.
[2024-06-01 13:22:50] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3766 ms
[2024-06-01 13:22:50] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:22:50] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 13:22:51] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2024-06-01 13:22:51] [INFO ] [Real]Added 1674 Read/Feed constraints in 608 ms returned sat
[2024-06-01 13:22:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:22:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:22:52] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 13:22:52] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2024-06-01 13:22:53] [INFO ] [Nat]Added 1674 Read/Feed constraints in 674 ms returned sat
[2024-06-01 13:22:53] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 425 ms.
[2024-06-01 13:22:55] [INFO ] Deduced a trap composed of 34 places in 464 ms of which 5 ms to minimize.
[2024-06-01 13:22:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 701 ms
[2024-06-01 13:22:55] [INFO ] Added : 26 causal constraints over 6 iterations in 2521 ms. Result :sat
Minimization took 551 ms.
[2024-06-01 13:22:56] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:22:56] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 13:22:56] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2024-06-01 13:22:57] [INFO ] [Real]Added 1674 Read/Feed constraints in 434 ms returned sat
[2024-06-01 13:22:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:22:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:22:57] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 13:22:58] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2024-06-01 13:22:58] [INFO ] [Nat]Added 1674 Read/Feed constraints in 504 ms returned sat
[2024-06-01 13:22:58] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 4 ms to minimize.
[2024-06-01 13:22:59] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 4 ms to minimize.
[2024-06-01 13:22:59] [INFO ] Deduced a trap composed of 119 places in 332 ms of which 5 ms to minimize.
[2024-06-01 13:23:00] [INFO ] Deduced a trap composed of 154 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:23:01] [INFO ] Deduced a trap composed of 212 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:23:01] [INFO ] Deduced a trap composed of 216 places in 345 ms of which 4 ms to minimize.
[2024-06-01 13:23:02] [INFO ] Deduced a trap composed of 222 places in 331 ms of which 4 ms to minimize.
[2024-06-01 13:23:02] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 3908 ms
[2024-06-01 13:23:02] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 13:23:02] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 13:23:03] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2024-06-01 13:23:04] [INFO ] [Real]Added 1674 Read/Feed constraints in 912 ms returned sat
[2024-06-01 13:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-06-01 13:23:04] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 13:23:04] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2024-06-01 13:23:05] [INFO ] [Nat]Added 1674 Read/Feed constraints in 475 ms returned sat
[2024-06-01 13:23:06] [INFO ] Deduced a trap composed of 45 places in 523 ms of which 8 ms to minimize.
[2024-06-01 13:23:06] [INFO ] Deduced a trap composed of 44 places in 542 ms of which 7 ms to minimize.
[2024-06-01 13:23:07] [INFO ] Deduced a trap composed of 122 places in 419 ms of which 5 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 168 places in 533 ms of which 6 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 227 places in 493 ms of which 6 ms to minimize.
[2024-06-01 13:23:09] [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 4
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.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Support contains 5 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.12 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 373
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 363
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 1166 place count 181 transition count 274
Iterating global reduction 2 with 89 rules applied. Total rules applied 1255 place count 181 transition count 274
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1289 place count 181 transition count 240
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1325 place count 145 transition count 190
Iterating global reduction 3 with 36 rules applied. Total rules applied 1361 place count 145 transition count 190
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1382 place count 145 transition count 169
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1390 place count 137 transition count 158
Iterating global reduction 4 with 8 rules applied. Total rules applied 1398 place count 137 transition count 158
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1406 place count 129 transition count 150
Iterating global reduction 4 with 8 rules applied. Total rules applied 1414 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1418 place count 125 transition count 145
Iterating global reduction 4 with 4 rules applied. Total rules applied 1422 place count 125 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1424 place count 125 transition count 143
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1428 place count 121 transition count 139
Iterating global reduction 5 with 4 rules applied. Total rules applied 1432 place count 121 transition count 139
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1434 place count 119 transition count 137
Iterating global reduction 5 with 2 rules applied. Total rules applied 1436 place count 119 transition count 137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1437 place count 118 transition count 136
Iterating global reduction 5 with 1 rules applied. Total rules applied 1438 place count 118 transition count 136
Applied a total of 1438 rules in 255 ms. Remains 118 /414 variables (removed 296) and now considering 136/1954 (removed 1818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 118/414 places, 136/1954 transitions.
// Phase 1: matrix 136 rows 118 cols
[2024-06-01 13:23:10] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
RANDOM walk for 1000000 steps (224441 resets) in 1571 ms. (636 steps per ms)
BEST_FIRST walk for 5000003 steps (516448 resets) in 3849 ms. (1298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
[2024-06-01 13:23:15] [INFO ] Invariant cache hit.
[2024-06-01 13:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:23:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:23:15] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 13:23:15] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 13:23:15] [INFO ] [Real]Added 51 Read/Feed constraints in 14 ms returned sat
[2024-06-01 13:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:23:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:15] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-01 13:23:15] [INFO ] [Nat]Added 51 Read/Feed constraints in 21 ms returned sat
[2024-06-01 13:23:15] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 14 ms.
[2024-06-01 13:23:15] [INFO ] Added : 13 causal constraints over 3 iterations in 73 ms. Result :sat
Minimization took 89 ms.
[2024-06-01 13:23:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Real]Added 51 Read/Feed constraints in 18 ms returned sat
[2024-06-01 13:23:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Nat]Added 51 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:23:16] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-06-01 13:23:16] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 18 ms.
[2024-06-01 13:23:16] [INFO ] Added : 19 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 100 ms.
[2024-06-01 13:23:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Real]Added 51 Read/Feed constraints in 14 ms returned sat
[2024-06-01 13:23:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 13:23:16] [INFO ] [Nat]Added 51 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:23:16] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 14 ms.
[2024-06-01 13:23:17] [INFO ] Added : 12 causal constraints over 3 iterations in 73 ms. Result :sat
Minimization took 94 ms.
[2024-06-01 13:23:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Real]Added 51 Read/Feed constraints in 18 ms returned sat
[2024-06-01 13:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Nat]Added 51 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-06-01 13:23:17] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 18 ms.
[2024-06-01 13:23:17] [INFO ] Added : 14 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 106 ms.
[2024-06-01 13:23:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Real]Added 51 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:23:18] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-01 13:23:18] [INFO ] [Nat]Added 51 Read/Feed constraints in 24 ms returned sat
[2024-06-01 13:23:18] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-01 13:23:18] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 19 ms.
[2024-06-01 13:23:18] [INFO ] Added : 13 causal constraints over 3 iterations in 97 ms. Result :sat
Minimization took 122 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 136/136 transitions.
Applied a total of 0 rules in 12 ms. Remains 118 /118 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 118/118 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 136/136 transitions.
Applied a total of 0 rules in 11 ms. Remains 118 /118 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-06-01 13:23:18] [INFO ] Invariant cache hit.
[2024-06-01 13:23:18] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 13:23:18] [INFO ] Invariant cache hit.
[2024-06-01 13:23:18] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 13:23:19] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-06-01 13:23:19] [INFO ] Redundant transitions in 7 ms returned []
Running 135 sub problems to find dead transitions.
[2024-06-01 13:23:19] [INFO ] Invariant cache hit.
[2024-06-01 13:23:19] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/254 variables, 118/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 51/173 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 173 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/254 variables, 118/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 51/173 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 135/308 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 2 ms to minimize.
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 3/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 311 constraints, problems are : Problem set: 3 solved, 132 unsolved in 16862 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints]
After SMT, in 24286ms problems are : Problem set: 3 solved, 132 unsolved
Search for dead transitions found 3 dead transitions in 24307ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/118 places, 133/136 transitions.
Graph (complete) has 335 edges and 118 vertex of which 115 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 115 /118 variables (removed 3) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 115 cols
[2024-06-01 13:23:43] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:23:43] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 13:23:43] [INFO ] Invariant cache hit.
[2024-06-01 13:23:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 13:23:44] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 115/118 places, 133/136 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25563 ms. Remains : 115/118 places, 133/136 transitions.
[2024-06-01 13:23:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
RANDOM walk for 1000000 steps (224651 resets) in 1397 ms. (715 steps per ms)
BEST_FIRST walk for 5000005 steps (516665 resets) in 3885 ms. (1286 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
[2024-06-01 13:23:49] [INFO ] Invariant cache hit.
[2024-06-01 13:23:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:49] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-01 13:23:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 13:23:49] [INFO ] [Real]Added 50 Read/Feed constraints in 14 ms returned sat
[2024-06-01 13:23:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:49] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-01 13:23:49] [INFO ] [Nat]Added 50 Read/Feed constraints in 30 ms returned sat
[2024-06-01 13:23:49] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 13 ms.
[2024-06-01 13:23:49] [INFO ] Added : 12 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 100 ms.
[2024-06-01 13:23:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:50] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 13:23:50] [INFO ] [Real]Added 50 Read/Feed constraints in 23 ms returned sat
[2024-06-01 13:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:50] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-01 13:23:50] [INFO ] [Nat]Added 50 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:23:50] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-01 13:23:50] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 12 ms.
[2024-06-01 13:23:50] [INFO ] Added : 23 causal constraints over 5 iterations in 124 ms. Result :sat
Minimization took 105 ms.
[2024-06-01 13:23:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:50] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-01 13:23:50] [INFO ] [Real]Added 50 Read/Feed constraints in 17 ms returned sat
[2024-06-01 13:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:23:50] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-01 13:23:50] [INFO ] [Nat]Added 50 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:23:50] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 11 ms.
[2024-06-01 13:23:50] [INFO ] Added : 13 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 57 ms.
[2024-06-01 13:23:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:51] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-01 13:23:51] [INFO ] [Real]Added 50 Read/Feed constraints in 18 ms returned sat
[2024-06-01 13:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:51] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 13:23:51] [INFO ] [Nat]Added 50 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:23:51] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-06-01 13:23:51] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 14 ms.
[2024-06-01 13:23:51] [INFO ] Added : 20 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 62 ms.
[2024-06-01 13:23:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:23:51] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-01 13:23:51] [INFO ] [Real]Added 50 Read/Feed constraints in 14 ms returned sat
[2024-06-01 13:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:23:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:23:51] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 13:23:51] [INFO ] [Nat]Added 50 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:23:51] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 4 ms to minimize.
[2024-06-01 13:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-01 13:23:51] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 9 ms.
[2024-06-01 13:23:52] [INFO ] Added : 21 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 133/133 transitions.
Applied a total of 0 rules in 8 ms. Remains 115 /115 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 115/115 places, 133/133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 133/133 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 13:23:52] [INFO ] Invariant cache hit.
[2024-06-01 13:23:52] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 13:23:52] [INFO ] Invariant cache hit.
[2024-06-01 13:23:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 13:23:52] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-01 13:23:52] [INFO ] Redundant transitions in 6 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 13:23:52] [INFO ] Invariant cache hit.
[2024-06-01 13:23:52] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 4 (OVERLAPS) 133/248 variables, 115/118 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 50/168 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 168 constraints, problems are : Problem set: 3 solved, 129 unsolved in 6878 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 132/244 variables, 112/115 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 49/164 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 16/180 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 4/248 variables, 3/183 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 1/184 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 113/297 constraints. Problems are: Problem set: 3 solved, 129 unsolved
[2024-06-01 13:24:08] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:24:08] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:24:08] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 3/300 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/248 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 300 constraints, problems are : Problem set: 3 solved, 129 unsolved in 22239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 29440ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 29445ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 115/115 places, 130/133 transitions.
Graph (complete) has 326 edges and 115 vertex of which 112 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 112 /115 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-06-01 13:24:22] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:24:22] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 13:24:22] [INFO ] Invariant cache hit.
[2024-06-01 13:24:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 13:24:22] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 112/115 places, 130/133 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30614 ms. Remains : 112/115 places, 130/133 transitions.
[2024-06-01 13:24:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
RANDOM walk for 1000000 steps (223891 resets) in 1622 ms. (616 steps per ms)
BEST_FIRST walk for 5000002 steps (516838 resets) in 3313 ms. (1508 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
[2024-06-01 13:24:27] [INFO ] Invariant cache hit.
[2024-06-01 13:24:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:24:27] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 13:24:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 13:24:27] [INFO ] [Real]Added 49 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Nat]Added 49 Read/Feed constraints in 29 ms returned sat
[2024-06-01 13:24:28] [INFO ] Computed and/alt/rep : 31/76/31 causal constraints (skipped 98 transitions) in 15 ms.
[2024-06-01 13:24:28] [INFO ] Added : 12 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 112 ms.
[2024-06-01 13:24:28] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Real]Added 49 Read/Feed constraints in 26 ms returned sat
[2024-06-01 13:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-01 13:24:28] [INFO ] [Nat]Added 49 Read/Feed constraints in 26 ms returned sat
[2024-06-01 13:24:28] [INFO ] Computed and/alt/rep : 31/76/31 causal constraints (skipped 98 transitions) in 16 ms.
[2024-06-01 13:24:28] [INFO ] Added : 23 causal constraints over 5 iterations in 133 ms. Result :sat
Minimization took 124 ms.
[2024-06-01 13:24:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Real]Added 49 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Nat]Added 49 Read/Feed constraints in 22 ms returned sat
[2024-06-01 13:24:29] [INFO ] Computed and/alt/rep : 31/76/31 causal constraints (skipped 98 transitions) in 17 ms.
[2024-06-01 13:24:29] [INFO ] Added : 12 causal constraints over 3 iterations in 91 ms. Result :sat
Minimization took 108 ms.
[2024-06-01 13:24:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Real]Added 49 Read/Feed constraints in 29 ms returned sat
[2024-06-01 13:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-01 13:24:29] [INFO ] [Nat]Added 49 Read/Feed constraints in 23 ms returned sat
[2024-06-01 13:24:29] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:24:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2024-06-01 13:24:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:24:30] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-01 13:24:30] [INFO ] [Real]Added 49 Read/Feed constraints in 23 ms returned sat
[2024-06-01 13:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:30] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 13:24:30] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-01 13:24:30] [INFO ] [Nat]Added 49 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:24:30] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:24:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 109 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 109 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 108 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 108 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 106 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 106 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 105 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 105 transition count 120
Applied a total of 16 rules in 37 ms. Remains 105 /112 variables (removed 7) and now considering 120/130 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 105/112 places, 120/130 transitions.
// Phase 1: matrix 120 rows 105 cols
[2024-06-01 13:24:30] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224926 resets) in 1442 ms. (693 steps per ms)
BEST_FIRST walk for 3000000 steps (310266 resets) in 1674 ms. (1791 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-06-01 13:24:33] [INFO ] Invariant cache hit.
[2024-06-01 13:24:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:33] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 13:24:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:24:33] [INFO ] [Real]Added 44 Read/Feed constraints in 12 ms returned sat
[2024-06-01 13:24:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:33] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 13:24:33] [INFO ] [Nat]Added 44 Read/Feed constraints in 18 ms returned sat
[2024-06-01 13:24:33] [INFO ] Computed and/alt/rep : 29/69/29 causal constraints (skipped 90 transitions) in 18 ms.
[2024-06-01 13:24:34] [INFO ] Added : 13 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 59 ms.
[2024-06-01 13:24:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:24:34] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-01 13:24:34] [INFO ] [Real]Added 44 Read/Feed constraints in 21 ms returned sat
[2024-06-01 13:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:34] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-01 13:24:34] [INFO ] [Nat]Added 44 Read/Feed constraints in 21 ms returned sat
[2024-06-01 13:24:34] [INFO ] Computed and/alt/rep : 29/69/29 causal constraints (skipped 90 transitions) in 14 ms.
[2024-06-01 13:24:34] [INFO ] Added : 22 causal constraints over 5 iterations in 122 ms. Result :sat
Minimization took 88 ms.
[2024-06-01 13:24:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:24:34] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-01 13:24:34] [INFO ] [Real]Added 44 Read/Feed constraints in 17 ms returned sat
[2024-06-01 13:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:24:34] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-01 13:24:34] [INFO ] [Nat]Added 44 Read/Feed constraints in 17 ms returned sat
[2024-06-01 13:24:34] [INFO ] Computed and/alt/rep : 29/69/29 causal constraints (skipped 90 transitions) in 17 ms.
[2024-06-01 13:24:35] [INFO ] Added : 14 causal constraints over 3 iterations in 102 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[42, 1, 42]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 120/120 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/105 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 120/120 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 13:24:35] [INFO ] Invariant cache hit.
[2024-06-01 13:24:35] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 13:24:35] [INFO ] Invariant cache hit.
[2024-06-01 13:24:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:24:35] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-06-01 13:24:35] [INFO ] Redundant transitions in 5 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-01 13:24:35] [INFO ] Invariant cache hit.
[2024-06-01 13:24:35] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/225 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 44/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 152 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5474 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/225 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 44/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 119/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 13:24:44] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 1/272 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 272 constraints, problems are : Problem set: 3 solved, 116 unsolved in 13029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 1/1 constraints]
After SMT, in 18729ms problems are : Problem set: 3 solved, 116 unsolved
Search for dead transitions found 3 dead transitions in 18733ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/105 places, 117/120 transitions.
Graph (complete) has 295 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 102 /105 variables (removed 3) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 102 cols
[2024-06-01 13:24:54] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 13:24:54] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 13:24:54] [INFO ] Invariant cache hit.
[2024-06-01 13:24:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 13:24:55] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 102/105 places, 117/120 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19931 ms. Remains : 102/105 places, 117/120 transitions.
[2024-06-01 13:24:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224249 resets) in 1377 ms. (725 steps per ms)
BEST_FIRST walk for 3000001 steps (309630 resets) in 1684 ms. (1780 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[42, 1, 42]
[2024-06-01 13:24:58] [INFO ] Invariant cache hit.
[2024-06-01 13:24:58] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 13:24:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 13:24:58] [INFO ] [Real]Added 43 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:24:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Nat]Added 43 Read/Feed constraints in 25 ms returned sat
[2024-06-01 13:24:58] [INFO ] Computed and/alt/rep : 28/64/28 causal constraints (skipped 88 transitions) in 16 ms.
[2024-06-01 13:24:58] [INFO ] Added : 13 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 74 ms.
[2024-06-01 13:24:58] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Real]Added 43 Read/Feed constraints in 24 ms returned sat
[2024-06-01 13:24:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:24:59] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-06-01 13:24:59] [INFO ] [Nat]Added 43 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:24:59] [INFO ] Computed and/alt/rep : 28/64/28 causal constraints (skipped 88 transitions) in 15 ms.
[2024-06-01 13:24:59] [INFO ] Added : 20 causal constraints over 4 iterations in 98 ms. Result :sat
Minimization took 71 ms.
[2024-06-01 13:24:59] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 13:24:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:24:59] [INFO ] [Real]Absence check using state equation in 42 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[42, 1, 1]
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 1]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 100 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 100 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 100 transition count 113
Applied a total of 5 rules in 13 ms. Remains 100 /102 variables (removed 2) and now considering 113/117 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 100/102 places, 113/117 transitions.
// Phase 1: matrix 113 rows 100 cols
[2024-06-01 13:24:59] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[42, 1]
RANDOM walk for 1000000 steps (224793 resets) in 1434 ms. (696 steps per ms)
BEST_FIRST walk for 2000001 steps (206614 resets) in 1091 ms. (1831 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[42, 1]
[2024-06-01 13:25:02] [INFO ] Invariant cache hit.
[2024-06-01 13:25:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 13:25:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:25:02] [INFO ] [Real]Added 42 Read/Feed constraints in 12 ms returned sat
[2024-06-01 13:25:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:25:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2024-06-01 13:25:02] [INFO ] Computed and/alt/rep : 27/61/27 causal constraints (skipped 85 transitions) in 8 ms.
[2024-06-01 13:25:02] [INFO ] Added : 13 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 45 ms.
[2024-06-01 13:25:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Real]Added 42 Read/Feed constraints in 26 ms returned sat
[2024-06-01 13:25:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:25:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 13:25:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-01 13:25:02] [INFO ] Computed and/alt/rep : 27/61/27 causal constraints (skipped 85 transitions) in 7 ms.
[2024-06-01 13:25:02] [INFO ] Added : 21 causal constraints over 5 iterations in 95 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[42, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 1]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 100/100 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 13:25:02] [INFO ] Invariant cache hit.
[2024-06-01 13:25:03] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 13:25:03] [INFO ] Invariant cache hit.
[2024-06-01 13:25:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:25:03] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-06-01 13:25:03] [INFO ] Redundant transitions in 7 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 13:25:03] [INFO ] Invariant cache hit.
[2024-06-01 13:25:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/213 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 144 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/213 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 112/256 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 257 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 17088ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 17093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17675 ms. Remains : 100/100 places, 113/113 transitions.
RANDOM walk for 40000 steps (8967 resets) in 1651 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4117 resets) in 461 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4153 resets) in 731 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4098 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4132 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 417811 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 4
Probabilistic random walk after 417811 steps, saw 198001 distinct states, run finished after 3008 ms. (steps per millisecond=138 ) properties seen :0
[2024-06-01 13:25:24] [INFO ] Invariant cache hit.
[2024-06-01 13:25:24] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 59/98 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 67/165 variables, 30/71 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 25/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 48/213 variables, 31/127 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 17/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 144 constraints, problems are : Problem set: 1 solved, 3 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 59/98 variables, 39/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 67/165 variables, 30/71 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 25/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 3/99 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 48/213 variables, 31/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 17/147 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/213 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 148 constraints, problems are : Problem set: 1 solved, 3 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 595ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 496 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 100/100 places, 113/113 transitions.
RANDOM walk for 40000 steps (9005 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (4202 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4139 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4225 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 630711 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 3
Probabilistic random walk after 630711 steps, saw 295896 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2024-06-01 13:25:29] [INFO ] Invariant cache hit.
[2024-06-01 13:25:29] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 59/98 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 67/165 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 48/213 variables, 31/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 17/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 144 constraints, problems are : Problem set: 0 solved, 3 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 59/98 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 67/165 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 48/213 variables, 31/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:25:29] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 148 constraints, problems are : Problem set: 0 solved, 3 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 464ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 446 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/100 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 13:25:30] [INFO ] Invariant cache hit.
[2024-06-01 13:25:30] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 13:25:30] [INFO ] Invariant cache hit.
[2024-06-01 13:25:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:25:30] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-06-01 13:25:30] [INFO ] Redundant transitions in 1 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 13:25:30] [INFO ] Invariant cache hit.
[2024-06-01 13:25:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/213 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 144 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/213 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 112/256 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 13:25:37] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 257 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 15548ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 15550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16071 ms. Remains : 100/100 places, 113/113 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 100 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 94 transition count 105
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 94 transition count 88
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 77 transition count 88
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 73 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 72 transition count 93
Applied a total of 58 rules in 18 ms. Remains 72 /100 variables (removed 28) and now considering 93/113 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 93 rows 72 cols
[2024-06-01 13:25:46] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:25:46] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 13:25:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:25:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:25:46] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 13:25:46] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2024-06-01 13:25:46] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 13:25:46] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 263 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[42, 1]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-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:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
// Phase 1: matrix 113 rows 100 cols
[2024-06-01 13:25:46] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2243 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10000 steps (976 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-06-01 13:25:46] [INFO ] Invariant cache hit.
[2024-06-01 13:25:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 13:25:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:25:46] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 13:25:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:25:46] [INFO ] [Real]Added 42 Read/Feed constraints in 17 ms returned sat
[2024-06-01 13:25:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:25:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:25:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:25:46] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 13:25:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:25:46] [INFO ] Computed and/alt/rep : 27/61/27 causal constraints (skipped 85 transitions) in 12 ms.
[2024-06-01 13:25:46] [INFO ] Added : 13 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 98 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 98 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 97 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 97 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 96 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 96 transition count 107
Applied a total of 9 rules in 10 ms. Remains 96 /100 variables (removed 4) and now considering 107/113 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 96/100 places, 107/113 transitions.
// Phase 1: matrix 107 rows 96 cols
[2024-06-01 13:25:46] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224759 resets) in 1239 ms. (806 steps per ms)
BEST_FIRST walk for 1000000 steps (103613 resets) in 536 ms. (1862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-06-01 13:25:48] [INFO ] Invariant cache hit.
[2024-06-01 13:25:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:25:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:25:48] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 13:25:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-01 13:25:48] [INFO ] [Real]Added 39 Read/Feed constraints in 9 ms returned sat
[2024-06-01 13:25:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:25:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:25:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 13:25:48] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 13:25:48] [INFO ] [Nat]Added 39 Read/Feed constraints in 11 ms returned sat
[2024-06-01 13:25:48] [INFO ] Computed and/alt/rep : 25/60/25 causal constraints (skipped 81 transitions) in 8 ms.
[2024-06-01 13:25:48] [INFO ] Added : 15 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 96/96 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-06-01 13:25:49] [INFO ] Invariant cache hit.
[2024-06-01 13:25:49] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 13:25:49] [INFO ] Invariant cache hit.
[2024-06-01 13:25:49] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-01 13:25:49] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-06-01 13:25:49] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 13:25:49] [INFO ] Invariant cache hit.
[2024-06-01 13:25:49] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/203 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 39/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 137 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5203 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/203 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 39/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 106/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 244 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
After SMT, in 14670ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 14673ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15258 ms. Remains : 96/96 places, 107/107 transitions.
RANDOM walk for 40000 steps (8956 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4099 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4199 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 769240 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 2
Probabilistic random walk after 769240 steps, saw 361223 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
[2024-06-01 13:26:07] [INFO ] Invariant cache hit.
[2024-06-01 13:26:07] [INFO ] State equation strengthened by 39 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/76 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/108 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/110 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 91/201 variables, 77/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 37/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/203 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/203 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/203 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 137 constraints, problems are : Problem set: 1 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/76 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/108 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 9/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/110 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 91/201 variables, 77/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 37/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/203 variables, 2/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/203 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/203 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/203 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 139 constraints, problems are : Problem set: 1 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 320ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 96/96 places, 107/107 transitions.
RANDOM walk for 40000 steps (8947 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4057 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2200764 steps, run visited all 1 properties in 2810 ms. (steps per millisecond=783 )
Probabilistic random walk after 2200764 steps, saw 1031697 distinct states, run finished after 2816 ms. (steps per millisecond=781 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-01 in 24240 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 113 rows 100 cols
[2024-06-01 13:26:10] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2177 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (1004 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 13:26:10] [INFO ] Invariant cache hit.
[2024-06-01 13:26:10] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:26:10] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 13:26:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:26:10] [INFO ] [Real]Added 42 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:26:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:26:10] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-01 13:26:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2024-06-01 13:26:10] [INFO ] Computed and/alt/rep : 27/61/27 causal constraints (skipped 85 transitions) in 8 ms.
[2024-06-01 13:26:10] [INFO ] Added : 21 causal constraints over 5 iterations in 92 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 100 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p28) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 112/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 98 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 98 transition count 109
Applied a total of 5 rules in 17 ms. Remains 98 /100 variables (removed 2) and now considering 109/112 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 98/100 places, 109/112 transitions.
// Phase 1: matrix 109 rows 98 cols
[2024-06-01 13:26:11] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (224739 resets) in 1356 ms. (736 steps per ms)
BEST_FIRST walk for 1000001 steps (103333 resets) in 557 ms. (1792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 13:26:13] [INFO ] Invariant cache hit.
[2024-06-01 13:26:13] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:26:13] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 13:26:13] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:26:13] [INFO ] [Real]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-06-01 13:26:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:26:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:26:13] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 13:26:13] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2024-06-01 13:26:13] [INFO ] Computed and/alt/rep : 25/58/25 causal constraints (skipped 83 transitions) in 10 ms.
[2024-06-01 13:26:13] [INFO ] Added : 20 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-01 13:26:13] [INFO ] Invariant cache hit.
[2024-06-01 13:26:13] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 13:26:13] [INFO ] Invariant cache hit.
[2024-06-01 13:26:13] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:26:14] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-06-01 13:26:14] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 13:26:14] [INFO ] Invariant cache hit.
[2024-06-01 13:26:14] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/207 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 13:26:18] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/207 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/207 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 15781ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 15784ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16380 ms. Remains : 98/98 places, 109/109 transitions.
RANDOM walk for 40000 steps (8965 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4207 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4140 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 756357 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 2
Probabilistic random walk after 756357 steps, saw 355156 distinct states, run finished after 3002 ms. (steps per millisecond=251 ) properties seen :0
[2024-06-01 13:26:33] [INFO ] Invariant cache hit.
[2024-06-01 13:26:33] [INFO ] State equation strengthened by 41 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) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/94 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/158 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 49/207 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 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) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/94 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/158 variables, 28/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 24/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 49/207 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 109/109 transitions.
RANDOM walk for 40000 steps (8993 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4096 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4121 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 843520 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 2
Probabilistic random walk after 843520 steps, saw 394559 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
[2024-06-01 13:26:36] [INFO ] Invariant cache hit.
[2024-06-01 13:26:36] [INFO ] State equation strengthened by 41 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) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/94 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/158 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 49/207 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 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) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/94 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/158 variables, 28/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 24/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 49/207 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-01 13:26:36] [INFO ] Invariant cache hit.
[2024-06-01 13:26:37] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 13:26:37] [INFO ] Invariant cache hit.
[2024-06-01 13:26:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:26:37] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-01 13:26:37] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 13:26:37] [INFO ] Invariant cache hit.
[2024-06-01 13:26:37] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/207 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/207 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/207 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 15393ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 15394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15895 ms. Remains : 98/98 places, 109/109 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 101
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 101
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 92 transition count 84
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 75 transition count 84
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 71 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 88
Applied a total of 58 rules in 21 ms. Remains 70 /98 variables (removed 28) and now considering 88/109 (removed 21) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 88 rows 70 cols
[2024-06-01 13:26:52] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:26:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 13:26:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:26:52] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 13:26:53] [INFO ] After 103ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-01 13:26:53] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 202 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-05 in 42388 ms.
[2024-06-01 13:26:53] [INFO ] Flatten gal took : 88 ms
[2024-06-01 13:26:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 13:26:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 113 transitions and 447 arcs took 8 ms.
Total runtime 258593 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 : SieveSingleMsgMbox-PT-d2m18-UpperBounds-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m18-UpperBounds-05
BK_STOP 1717248413817
--------------------
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 SieveSingleMsgMbox-PT-d2m18-UpperBounds-01
ub formula formula --maxsum=/tmp/1084/ub_0_
ub formula name SieveSingleMsgMbox-PT-d2m18-UpperBounds-05
ub formula formula --maxsum=/tmp/1084/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m18"
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 SieveSingleMsgMbox-PT-d2m18, 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 r532-smll-171683810800117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m18.tgz
mv SieveSingleMsgMbox-PT-d2m18 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 ;