About the Execution of LTSMin+red for Peterson-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 553.075 | 393458.00 | 447896.00 | 902.50 | 6 6 6 6 5 6 6 1 6 5 6 5 6 5 6 6 | 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.r512-smll-171654407200229.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 Peterson-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200229
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.0K Apr 12 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 45K 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 Peterson-COL-5-UpperBounds-00
FORMULA_NAME Peterson-COL-5-UpperBounds-01
FORMULA_NAME Peterson-COL-5-UpperBounds-02
FORMULA_NAME Peterson-COL-5-UpperBounds-03
FORMULA_NAME Peterson-COL-5-UpperBounds-04
FORMULA_NAME Peterson-COL-5-UpperBounds-05
FORMULA_NAME Peterson-COL-5-UpperBounds-06
FORMULA_NAME Peterson-COL-5-UpperBounds-07
FORMULA_NAME Peterson-COL-5-UpperBounds-08
FORMULA_NAME Peterson-COL-5-UpperBounds-09
FORMULA_NAME Peterson-COL-5-UpperBounds-10
FORMULA_NAME Peterson-COL-5-UpperBounds-11
FORMULA_NAME Peterson-COL-5-UpperBounds-12
FORMULA_NAME Peterson-COL-5-UpperBounds-13
FORMULA_NAME Peterson-COL-5-UpperBounds-14
FORMULA_NAME Peterson-COL-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717262098967
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:15:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 17:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:15:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:15:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:15:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1322 ms
[2024-06-01 17:15:03] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2024-06-01 17:15:03] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-06-01 17:15:03] [INFO ] Skeletonized 10 HLPN properties in 1 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-06-01 17:15:03] [INFO ] Computed 1 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[6, 0, 0, 0, 6, 0, 0, 0, 5, 0] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 5, 6]
FORMULA Peterson-COL-5-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 17:15:03] [INFO ] Invariant cache hit.
[2024-06-01 17:15:03] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-06-01 17:15:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 17:15:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 17:15:04] [INFO ] Added : 11 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 17:15:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 17:15:04] [INFO ] Added : 11 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 17:15:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 17:15:04] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 17:15:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 17:15:04] [INFO ] Added : 12 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 17:15:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 17:15:04] [INFO ] Added : 11 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 17:15:04] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 17:15:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 17:15:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 17:15:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 17:15:05] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 17:15:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 17:15:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 17:15:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 17:15:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 17:15:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 17:15:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 17:15:05] [INFO ] Added : 11 causal constraints over 5 iterations in 25 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 6, 6]
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 17:15:05] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 118 ms.
[2024-06-01 17:15:05] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 26 ms
Reduce places removed 30 places and 60 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 6, 6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 6, 6]
[2024-06-01 17:15:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 17:15:05] [INFO ] Computed 23 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 285 ms. (34 steps per ms)
FORMULA Peterson-COL-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 2, 4] Max Struct:[6, 6, 6, 6]
[2024-06-01 17:15:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:15:06] [INFO ] Invariant cache hit.
[2024-06-01 17:15:06] [INFO ] [Real]Absence check using 17 positive place invariants in 38 ms returned sat
[2024-06-01 17:15:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2024-06-01 17:15:07] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2024-06-01 17:15:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:15:07] [INFO ] [Real]Added 205 Read/Feed constraints in 72 ms returned sat
[2024-06-01 17:15:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2024-06-01 17:15:07] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2024-06-01 17:15:08] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-06-01 17:15:08] [INFO ] [Nat]Added 205 Read/Feed constraints in 212 ms returned sat
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 23 places in 790 ms of which 121 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 11 places in 792 ms of which 30 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 11 places in 989 ms of which 11 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 13 places in 668 ms of which 7 ms to minimize.
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 23 places in 670 ms of which 10 ms to minimize.
[2024-06-01 17:15:12] [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 17:15:12] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2024-06-01 17:15:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2024-06-01 17:15:13] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2024-06-01 17:15:13] [INFO ] [Real]Added 205 Read/Feed constraints in 89 ms returned sat
[2024-06-01 17:15:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 39 ms returned sat
[2024-06-01 17:15:13] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2024-06-01 17:15:14] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2024-06-01 17:15:15] [INFO ] [Nat]Added 205 Read/Feed constraints in 309 ms returned sat
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 37 places in 663 ms of which 7 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 53 places in 476 ms of which 6 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 41 places in 508 ms of which 6 ms to minimize.
[2024-06-01 17:15:17] [INFO ] Deduced a trap composed of 22 places in 475 ms of which 7 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 71 places in 536 ms of which 7 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 44 places in 644 ms of which 9 ms to minimize.
[2024-06-01 17:15:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 17:15:18] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2024-06-01 17:15:19] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2024-06-01 17:15:19] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2024-06-01 17:15:19] [INFO ] [Real]Added 205 Read/Feed constraints in 32 ms returned sat
[2024-06-01 17:15:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 32 ms returned sat
[2024-06-01 17:15:20] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2024-06-01 17:15:20] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2024-06-01 17:15:20] [INFO ] [Nat]Added 205 Read/Feed constraints in 143 ms returned sat
[2024-06-01 17:15:21] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 166 ms.
[2024-06-01 17:15:23] [INFO ] Deduced a trap composed of 15 places in 940 ms of which 12 ms to minimize.
[2024-06-01 17:15:24] [INFO ] Deduced a trap composed of 11 places in 873 ms of which 11 ms to minimize.
[2024-06-01 17:15:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2177 ms
[2024-06-01 17:15:24] [INFO ] Added : 55 causal constraints over 11 iterations in 3852 ms. Result :unknown
[2024-06-01 17:15:25] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2024-06-01 17:15:25] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2024-06-01 17:15:25] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2024-06-01 17:15:26] [INFO ] [Real]Added 205 Read/Feed constraints in 118 ms returned sat
[2024-06-01 17:15:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-06-01 17:15:26] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 11 ms returned sat
[2024-06-01 17:15:27] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2024-06-01 17:15:27] [INFO ] [Nat]Added 205 Read/Feed constraints in 293 ms returned sat
[2024-06-01 17:15:27] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 160 ms.
[2024-06-01 17:15:27] [INFO ] Added : 0 causal constraints over 0 iterations in 380 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 2, 4] Max Struct:[6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 1, 3, 4] Max Struct:[6, 6, 6, 6]
Support contains 246 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 834 transition count 1092
Reduce places removed 150 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 300 rules applied. Total rules applied 450 place count 684 transition count 942
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 600 place count 534 transition count 942
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 600 place count 534 transition count 912
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 660 place count 504 transition count 912
Applied a total of 660 rules in 277 ms. Remains 504 /834 variables (removed 330) and now considering 912/1242 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 504/834 places, 912/1242 transitions.
[2024-06-01 17:15:29] [INFO ] Flow matrix only has 792 transitions (discarded 120 similar events)
// Phase 1: matrix 792 rows 504 cols
[2024-06-01 17:15:29] [INFO ] Computed 23 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 1, 3, 4] Max Struct:[6, 6, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 6667 ms. (149 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 8357 ms. (478 steps per ms)
FORMULA Peterson-COL-5-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[5, 1, 5] Max Struct:[6, 6, 6]
[2024-06-01 17:15:44] [INFO ] Flow matrix only has 792 transitions (discarded 120 similar events)
[2024-06-01 17:15:44] [INFO ] Invariant cache hit.
[2024-06-01 17:15:44] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2024-06-01 17:15:44] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2024-06-01 17:15:44] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2024-06-01 17:15:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:15:44] [INFO ] [Real]Added 205 Read/Feed constraints in 61 ms returned sat
[2024-06-01 17:15:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 22 ms returned sat
[2024-06-01 17:15:45] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2024-06-01 17:15:45] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2024-06-01 17:15:45] [INFO ] [Nat]Added 205 Read/Feed constraints in 149 ms returned sat
[2024-06-01 17:15:46] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:15:46] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 6 ms to minimize.
[2024-06-01 17:15:46] [INFO ] Deduced a trap composed of 11 places in 459 ms of which 6 ms to minimize.
[2024-06-01 17:15:47] [INFO ] Deduced a trap composed of 9 places in 494 ms of which 7 ms to minimize.
[2024-06-01 17:15:47] [INFO ] Deduced a trap composed of 13 places in 479 ms of which 7 ms to minimize.
[2024-06-01 17:15:48] [INFO ] Deduced a trap composed of 11 places in 505 ms of which 6 ms to minimize.
[2024-06-01 17:15:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 2843 ms
[2024-06-01 17:15:48] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2024-06-01 17:15:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2024-06-01 17:15:49] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-06-01 17:15:49] [INFO ] [Real]Added 205 Read/Feed constraints in 36 ms returned sat
[2024-06-01 17:15:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:15:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-06-01 17:15:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2024-06-01 17:15:49] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-06-01 17:15:50] [INFO ] [Nat]Added 205 Read/Feed constraints in 194 ms returned sat
[2024-06-01 17:15:50] [INFO ] Deduced a trap composed of 27 places in 407 ms of which 6 ms to minimize.
[2024-06-01 17:15:50] [INFO ] Deduced a trap composed of 67 places in 452 ms of which 7 ms to minimize.
[2024-06-01 17:15:51] [INFO ] Deduced a trap composed of 41 places in 459 ms of which 8 ms to minimize.
[2024-06-01 17:15:52] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 6 ms to minimize.
[2024-06-01 17:15:52] [INFO ] Deduced a trap composed of 65 places in 489 ms of which 7 ms to minimize.
[2024-06-01 17:15:53] [INFO ] Deduced a trap composed of 28 places in 464 ms of which 7 ms to minimize.
[2024-06-01 17:15:53] [INFO ] Deduced a trap composed of 55 places in 359 ms of which 5 ms to minimize.
[2024-06-01 17:15:53] [INFO ] Deduced a trap composed of 70 places in 433 ms of which 7 ms to minimize.
[2024-06-01 17:15:54] [INFO ] Deduced a trap composed of 43 places in 448 ms of which 6 ms to minimize.
[2024-06-01 17:15:54] [INFO ] Deduced a trap composed of 26 places in 460 ms of which 8 ms to minimize.
[2024-06-01 17:15:55] [INFO ] Deduced a trap composed of 106 places in 458 ms of which 7 ms to minimize.
[2024-06-01 17:15:56] [INFO ] Deduced a trap composed of 62 places in 403 ms of which 6 ms to minimize.
[2024-06-01 17:15:56] [INFO ] Deduced a trap composed of 30 places in 440 ms of which 7 ms to minimize.
[2024-06-01 17:15:57] [INFO ] Deduced a trap composed of 26 places in 455 ms of which 7 ms to minimize.
[2024-06-01 17:15:57] [INFO ] Deduced a trap composed of 85 places in 425 ms of which 6 ms to minimize.
[2024-06-01 17:15:58] [INFO ] Deduced a trap composed of 39 places in 466 ms of which 8 ms to minimize.
[2024-06-01 17:15:58] [INFO ] Deduced a trap composed of 46 places in 461 ms of which 7 ms to minimize.
[2024-06-01 17:15:59] [INFO ] Deduced a trap composed of 39 places in 441 ms of which 7 ms to minimize.
[2024-06-01 17:15:59] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 7 ms to minimize.
[2024-06-01 17:16:00] [INFO ] Deduced a trap composed of 43 places in 459 ms of which 7 ms to minimize.
[2024-06-01 17:16:00] [INFO ] Deduced a trap composed of 58 places in 447 ms of which 6 ms to minimize.
[2024-06-01 17:16:01] [INFO ] Deduced a trap composed of 63 places in 445 ms of which 6 ms to minimize.
[2024-06-01 17:16:01] [INFO ] Deduced a trap composed of 45 places in 462 ms of which 7 ms to minimize.
[2024-06-01 17:16:02] [INFO ] Deduced a trap composed of 11 places in 396 ms of which 6 ms to minimize.
[2024-06-01 17:16:02] [INFO ] Deduced a trap composed of 41 places in 450 ms of which 7 ms to minimize.
[2024-06-01 17:16:03] [INFO ] Deduced a trap composed of 56 places in 464 ms of which 7 ms to minimize.
[2024-06-01 17:16:03] [INFO ] Deduced a trap composed of 91 places in 476 ms of which 7 ms to minimize.
[2024-06-01 17:16:04] [INFO ] Deduced a trap composed of 66 places in 453 ms of which 6 ms to minimize.
[2024-06-01 17:16:04] [INFO ] Deduced a trap composed of 71 places in 482 ms of which 7 ms to minimize.
[2024-06-01 17:16:05] [INFO ] Deduced a trap composed of 30 places in 431 ms of which 6 ms to minimize.
[2024-06-01 17:16:05] [INFO ] Deduced a trap composed of 31 places in 384 ms of which 6 ms to minimize.
[2024-06-01 17:16:06] [INFO ] Deduced a trap composed of 24 places in 437 ms of which 7 ms to minimize.
[2024-06-01 17:16:06] [INFO ] Deduced a trap composed of 95 places in 441 ms of which 7 ms to minimize.
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 15 places in 442 ms of which 7 ms to minimize.
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 92 places in 424 ms of which 6 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 41 places in 429 ms of which 6 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 11 places in 400 ms of which 7 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 11 places in 467 ms of which 11 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 7 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 22 places in 462 ms of which 6 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 7 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 49 places in 376 ms of which 6 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 49 places in 380 ms of which 6 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 64 places in 416 ms of which 6 ms to minimize.
[2024-06-01 17:16:16] [INFO ] Deduced a trap composed of 58 places in 386 ms of which 6 ms to minimize.
[2024-06-01 17:16:16] [INFO ] Deduced a trap composed of 43 places in 422 ms of which 6 ms to minimize.
[2024-06-01 17:16:17] [INFO ] Deduced a trap composed of 45 places in 334 ms of which 6 ms to minimize.
[2024-06-01 17:16:17] [INFO ] Deduced a trap composed of 79 places in 385 ms of which 6 ms to minimize.
[2024-06-01 17:16:18] [INFO ] Deduced a trap composed of 49 places in 316 ms of which 5 ms to minimize.
[2024-06-01 17:16:18] [INFO ] Deduced a trap composed of 13 places in 484 ms of which 6 ms to minimize.
[2024-06-01 17:16:21] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 4 ms to minimize.
[2024-06-01 17:16:21] [INFO ] Deduced a trap composed of 57 places in 483 ms of which 7 ms to minimize.
[2024-06-01 17:16:22] [INFO ] Deduced a trap composed of 15 places in 406 ms of which 6 ms to minimize.
[2024-06-01 17:16:23] [INFO ] Deduced a trap composed of 65 places in 347 ms of which 8 ms to minimize.
[2024-06-01 17:16:23] [INFO ] Deduced a trap composed of 28 places in 417 ms of which 6 ms to minimize.
[2024-06-01 17:16:24] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 6 ms to minimize.
[2024-06-01 17:16:25] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 6 ms to minimize.
[2024-06-01 17:16:26] [INFO ] Deduced a trap composed of 42 places in 434 ms of which 6 ms to minimize.
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 4 ms to minimize.
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 63 places in 304 ms of which 5 ms to minimize.
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 45 places in 370 ms of which 6 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 34 places in 404 ms of which 8 ms to minimize.
[2024-06-01 17:16:32] [INFO ] Deduced a trap composed of 19 places in 522 ms of which 7 ms to minimize.
[2024-06-01 17:16:34] [INFO ] Deduced a trap composed of 61 places in 416 ms of which 6 ms to minimize.
[2024-06-01 17:16:34] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 6 ms to minimize.
[2024-06-01 17:16:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 17:16:34] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2024-06-01 17:16:34] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2024-06-01 17:16:35] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-06-01 17:16:35] [INFO ] [Real]Added 205 Read/Feed constraints in 83 ms returned sat
[2024-06-01 17:16:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:16:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-06-01 17:16:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2024-06-01 17:16:35] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2024-06-01 17:16:35] [INFO ] [Nat]Added 205 Read/Feed constraints in 103 ms returned sat
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 75 places in 501 ms of which 7 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 9 places in 527 ms of which 8 ms to minimize.
[2024-06-01 17:16:37] [INFO ] Deduced a trap composed of 9 places in 612 ms of which 7 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 46 places in 557 ms of which 7 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2426 ms
[2024-06-01 17:16:38] [INFO ] Computed and/alt/rep : 726/1662/726 causal constraints (skipped 60 transitions) in 114 ms.
[2024-06-01 17:16:41] [INFO ] Deduced a trap composed of 36 places in 469 ms of which 7 ms to minimize.
[2024-06-01 17:16:42] [INFO ] Deduced a trap composed of 24 places in 539 ms of which 8 ms to minimize.
[2024-06-01 17:16:42] [INFO ] Deduced a trap composed of 20 places in 560 ms of which 8 ms to minimize.
[2024-06-01 17:16:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1865 ms
[2024-06-01 17:16:43] [INFO ] Added : 143 causal constraints over 30 iterations in 4764 ms. Result :sat
Minimization took 515 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 1, 5] Max Struct:[5, 6, 6]
FORMULA Peterson-COL-5-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 5] Max Struct:[6, 6]
Support contains 186 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 912/912 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 504 transition count 888
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 480 transition count 888
Applied a total of 48 rules in 94 ms. Remains 480 /504 variables (removed 24) and now considering 888/912 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 480/504 places, 888/912 transitions.
[2024-06-01 17:16:44] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 480 cols
[2024-06-01 17:16:44] [INFO ] Computed 23 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 5797 ms. (172 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 5554 ms. (360 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 5] Max Struct:[6, 6]
[2024-06-01 17:16:55] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:16:55] [INFO ] Invariant cache hit.
[2024-06-01 17:16:55] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 17:16:55] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2024-06-01 17:16:56] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-06-01 17:16:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:16:56] [INFO ] [Real]Added 205 Read/Feed constraints in 51 ms returned sat
[2024-06-01 17:16:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:16:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-06-01 17:16:56] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2024-06-01 17:16:56] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-06-01 17:16:56] [INFO ] [Nat]Added 205 Read/Feed constraints in 159 ms returned sat
[2024-06-01 17:16:57] [INFO ] Deduced a trap composed of 13 places in 388 ms of which 6 ms to minimize.
[2024-06-01 17:16:57] [INFO ] Deduced a trap composed of 32 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:16:58] [INFO ] Deduced a trap composed of 44 places in 438 ms of which 6 ms to minimize.
[2024-06-01 17:16:58] [INFO ] Deduced a trap composed of 90 places in 442 ms of which 6 ms to minimize.
[2024-06-01 17:16:59] [INFO ] Deduced a trap composed of 11 places in 389 ms of which 6 ms to minimize.
[2024-06-01 17:16:59] [INFO ] Deduced a trap composed of 37 places in 466 ms of which 7 ms to minimize.
[2024-06-01 17:17:00] [INFO ] Deduced a trap composed of 11 places in 435 ms of which 6 ms to minimize.
[2024-06-01 17:17:00] [INFO ] Deduced a trap composed of 28 places in 420 ms of which 6 ms to minimize.
[2024-06-01 17:17:01] [INFO ] Deduced a trap composed of 42 places in 368 ms of which 6 ms to minimize.
[2024-06-01 17:17:01] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 6 ms to minimize.
[2024-06-01 17:17:02] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 5 ms to minimize.
[2024-06-01 17:17:02] [INFO ] Deduced a trap composed of 74 places in 406 ms of which 6 ms to minimize.
[2024-06-01 17:17:03] [INFO ] Deduced a trap composed of 85 places in 389 ms of which 6 ms to minimize.
[2024-06-01 17:17:03] [INFO ] Deduced a trap composed of 28 places in 362 ms of which 6 ms to minimize.
[2024-06-01 17:17:04] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 5 ms to minimize.
[2024-06-01 17:17:04] [INFO ] Deduced a trap composed of 35 places in 420 ms of which 5 ms to minimize.
[2024-06-01 17:17:05] [INFO ] Deduced a trap composed of 46 places in 393 ms of which 6 ms to minimize.
[2024-06-01 17:17:05] [INFO ] Deduced a trap composed of 40 places in 391 ms of which 6 ms to minimize.
[2024-06-01 17:17:06] [INFO ] Deduced a trap composed of 34 places in 452 ms of which 6 ms to minimize.
[2024-06-01 17:17:06] [INFO ] Deduced a trap composed of 26 places in 391 ms of which 6 ms to minimize.
[2024-06-01 17:17:07] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 5 ms to minimize.
[2024-06-01 17:17:08] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:17:08] [INFO ] Deduced a trap composed of 75 places in 360 ms of which 5 ms to minimize.
[2024-06-01 17:17:09] [INFO ] Deduced a trap composed of 70 places in 365 ms of which 6 ms to minimize.
[2024-06-01 17:17:09] [INFO ] Deduced a trap composed of 61 places in 357 ms of which 6 ms to minimize.
[2024-06-01 17:17:10] [INFO ] Deduced a trap composed of 75 places in 361 ms of which 6 ms to minimize.
[2024-06-01 17:17:10] [INFO ] Deduced a trap composed of 55 places in 373 ms of which 6 ms to minimize.
[2024-06-01 17:17:10] [INFO ] Deduced a trap composed of 55 places in 394 ms of which 5 ms to minimize.
[2024-06-01 17:17:11] [INFO ] Deduced a trap composed of 73 places in 373 ms of which 5 ms to minimize.
[2024-06-01 17:17:12] [INFO ] Deduced a trap composed of 51 places in 358 ms of which 6 ms to minimize.
[2024-06-01 17:17:12] [INFO ] Deduced a trap composed of 77 places in 376 ms of which 6 ms to minimize.
[2024-06-01 17:17:13] [INFO ] Deduced a trap composed of 53 places in 375 ms of which 5 ms to minimize.
[2024-06-01 17:17:13] [INFO ] Deduced a trap composed of 58 places in 369 ms of which 5 ms to minimize.
[2024-06-01 17:17:14] [INFO ] Deduced a trap composed of 53 places in 419 ms of which 6 ms to minimize.
[2024-06-01 17:17:14] [INFO ] Deduced a trap composed of 19 places in 435 ms of which 6 ms to minimize.
[2024-06-01 17:17:15] [INFO ] Deduced a trap composed of 24 places in 404 ms of which 7 ms to minimize.
[2024-06-01 17:17:15] [INFO ] Deduced a trap composed of 36 places in 438 ms of which 6 ms to minimize.
[2024-06-01 17:17:16] [INFO ] Deduced a trap composed of 37 places in 447 ms of which 6 ms to minimize.
[2024-06-01 17:17:16] [INFO ] Deduced a trap composed of 9 places in 454 ms of which 6 ms to minimize.
[2024-06-01 17:17:17] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 6 ms to minimize.
[2024-06-01 17:17:17] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 7 ms to minimize.
[2024-06-01 17:17:18] [INFO ] Deduced a trap composed of 44 places in 402 ms of which 6 ms to minimize.
[2024-06-01 17:17:18] [INFO ] Deduced a trap composed of 38 places in 422 ms of which 6 ms to minimize.
[2024-06-01 17:17:19] [INFO ] Deduced a trap composed of 9 places in 364 ms of which 5 ms to minimize.
[2024-06-01 17:17:19] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 5 ms to minimize.
[2024-06-01 17:17:20] [INFO ] Deduced a trap composed of 28 places in 433 ms of which 7 ms to minimize.
[2024-06-01 17:17:20] [INFO ] Deduced a trap composed of 39 places in 417 ms of which 7 ms to minimize.
[2024-06-01 17:17:21] [INFO ] Deduced a trap composed of 24 places in 442 ms of which 7 ms to minimize.
[2024-06-01 17:17:21] [INFO ] Deduced a trap composed of 11 places in 440 ms of which 6 ms to minimize.
[2024-06-01 17:17:22] [INFO ] Deduced a trap composed of 145 places in 404 ms of which 6 ms to minimize.
[2024-06-01 17:17:22] [INFO ] Deduced a trap composed of 77 places in 408 ms of which 9 ms to minimize.
[2024-06-01 17:17:23] [INFO ] Deduced a trap composed of 58 places in 364 ms of which 6 ms to minimize.
[2024-06-01 17:17:27] [INFO ] Deduced a trap composed of 72 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:17:28] [INFO ] Deduced a trap composed of 56 places in 371 ms of which 6 ms to minimize.
[2024-06-01 17:17:28] [INFO ] Deduced a trap composed of 19 places in 405 ms of which 6 ms to minimize.
[2024-06-01 17:17:30] [INFO ] Deduced a trap composed of 131 places in 390 ms of which 5 ms to minimize.
[2024-06-01 17:17:31] [INFO ] Deduced a trap composed of 57 places in 380 ms of which 6 ms to minimize.
[2024-06-01 17:17:31] [INFO ] Deduced a trap composed of 77 places in 406 ms of which 6 ms to minimize.
[2024-06-01 17:17:32] [INFO ] Deduced a trap composed of 44 places in 382 ms of which 5 ms to minimize.
[2024-06-01 17:17:32] [INFO ] Deduced a trap composed of 65 places in 418 ms of which 6 ms to minimize.
[2024-06-01 17:17:33] [INFO ] Deduced a trap composed of 80 places in 417 ms of which 6 ms to minimize.
[2024-06-01 17:17:33] [INFO ] Deduced a trap composed of 28 places in 489 ms of which 6 ms to minimize.
[2024-06-01 17:17:37] [INFO ] Deduced a trap composed of 43 places in 320 ms of which 6 ms to minimize.
[2024-06-01 17:17:37] [INFO ] Deduced a trap composed of 39 places in 343 ms of which 5 ms to minimize.
[2024-06-01 17:17:40] [INFO ] Deduced a trap composed of 51 places in 341 ms of which 5 ms to minimize.
[2024-06-01 17:17:41] [INFO ] Trap strengthening (SAT) tested/added 65/65 trap constraints in 44235 ms
[2024-06-01 17:17:41] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 17:17:41] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 17:17:41] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-06-01 17:17:41] [INFO ] [Real]Added 205 Read/Feed constraints in 43 ms returned sat
[2024-06-01 17:17:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:17:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-06-01 17:17:41] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2024-06-01 17:17:42] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2024-06-01 17:17:42] [INFO ] [Nat]Added 205 Read/Feed constraints in 57 ms returned sat
[2024-06-01 17:17:42] [INFO ] Deduced a trap composed of 79 places in 561 ms of which 8 ms to minimize.
[2024-06-01 17:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2024-06-01 17:17:42] [INFO ] Computed and/alt/rep : 702/1758/702 causal constraints (skipped 60 transitions) in 117 ms.
[2024-06-01 17:17:43] [INFO ] Deduced a trap composed of 15 places in 488 ms of which 7 ms to minimize.
[2024-06-01 17:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 618 ms
[2024-06-01 17:17:45] [INFO ] Added : 95 causal constraints over 20 iterations in 2325 ms. Result :sat
Minimization took 477 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 5] Max Struct:[6, 6]
Support contains 186 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 888/888 transitions.
Applied a total of 0 rules in 45 ms. Remains 480 /480 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 480/480 places, 888/888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 888/888 transitions.
Applied a total of 0 rules in 37 ms. Remains 480 /480 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2024-06-01 17:17:46] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:17:46] [INFO ] Invariant cache hit.
[2024-06-01 17:17:46] [INFO ] Implicit Places using invariants in 696 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 701 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/480 places, 888/888 transitions.
Applied a total of 0 rules in 38 ms. Remains 474 /474 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 786 ms. Remains : 474/480 places, 888/888 transitions.
[2024-06-01 17:17:46] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 474 cols
[2024-06-01 17:17:46] [INFO ] Computed 17 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 6009 ms. (166 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 5022 ms. (398 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 5] Max Struct:[6, 6]
[2024-06-01 17:17:57] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:17:57] [INFO ] Invariant cache hit.
[2024-06-01 17:17:58] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 17:17:58] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2024-06-01 17:17:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:17:58] [INFO ] [Real]Added 205 Read/Feed constraints in 30 ms returned sat
[2024-06-01 17:17:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:17:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-06-01 17:17:58] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-06-01 17:17:58] [INFO ] [Nat]Added 205 Read/Feed constraints in 104 ms returned sat
[2024-06-01 17:17:59] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 4 ms to minimize.
[2024-06-01 17:17:59] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:17:59] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:17:59] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 4 ms to minimize.
[2024-06-01 17:18:00] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 4 ms to minimize.
[2024-06-01 17:18:00] [INFO ] Deduced a trap composed of 49 places in 401 ms of which 7 ms to minimize.
[2024-06-01 17:18:01] [INFO ] Deduced a trap composed of 34 places in 457 ms of which 6 ms to minimize.
[2024-06-01 17:18:01] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 7 ms to minimize.
[2024-06-01 17:18:02] [INFO ] Deduced a trap composed of 34 places in 400 ms of which 6 ms to minimize.
[2024-06-01 17:18:02] [INFO ] Deduced a trap composed of 20 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:18:03] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 7 ms to minimize.
[2024-06-01 17:18:03] [INFO ] Deduced a trap composed of 57 places in 422 ms of which 7 ms to minimize.
[2024-06-01 17:18:04] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 6 ms to minimize.
[2024-06-01 17:18:04] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 6 ms to minimize.
[2024-06-01 17:18:04] [INFO ] Deduced a trap composed of 16 places in 399 ms of which 6 ms to minimize.
[2024-06-01 17:18:05] [INFO ] Deduced a trap composed of 9 places in 415 ms of which 7 ms to minimize.
[2024-06-01 17:18:05] [INFO ] Deduced a trap composed of 15 places in 440 ms of which 9 ms to minimize.
[2024-06-01 17:18:06] [INFO ] Deduced a trap composed of 74 places in 407 ms of which 6 ms to minimize.
[2024-06-01 17:18:06] [INFO ] Deduced a trap composed of 78 places in 408 ms of which 7 ms to minimize.
[2024-06-01 17:18:07] [INFO ] Deduced a trap composed of 46 places in 332 ms of which 6 ms to minimize.
[2024-06-01 17:18:07] [INFO ] Deduced a trap composed of 33 places in 417 ms of which 7 ms to minimize.
[2024-06-01 17:18:08] [INFO ] Deduced a trap composed of 9 places in 415 ms of which 7 ms to minimize.
[2024-06-01 17:18:08] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 6 ms to minimize.
[2024-06-01 17:18:09] [INFO ] Deduced a trap composed of 25 places in 385 ms of which 4 ms to minimize.
[2024-06-01 17:18:09] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 5 ms to minimize.
[2024-06-01 17:18:10] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:18:10] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:18:10] [INFO ] Deduced a trap composed of 36 places in 360 ms of which 6 ms to minimize.
[2024-06-01 17:18:11] [INFO ] Deduced a trap composed of 23 places in 373 ms of which 6 ms to minimize.
[2024-06-01 17:18:11] [INFO ] Deduced a trap composed of 30 places in 417 ms of which 6 ms to minimize.
[2024-06-01 17:18:12] [INFO ] Deduced a trap composed of 36 places in 405 ms of which 6 ms to minimize.
[2024-06-01 17:18:12] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 5 ms to minimize.
[2024-06-01 17:18:13] [INFO ] Deduced a trap composed of 39 places in 344 ms of which 5 ms to minimize.
[2024-06-01 17:18:13] [INFO ] Deduced a trap composed of 46 places in 351 ms of which 5 ms to minimize.
[2024-06-01 17:18:14] [INFO ] Deduced a trap composed of 49 places in 364 ms of which 6 ms to minimize.
[2024-06-01 17:18:15] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:18:15] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 4 ms to minimize.
[2024-06-01 17:18:16] [INFO ] Deduced a trap composed of 57 places in 295 ms of which 4 ms to minimize.
[2024-06-01 17:18:16] [INFO ] Deduced a trap composed of 15 places in 349 ms of which 4 ms to minimize.
[2024-06-01 17:18:16] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 4 ms to minimize.
[2024-06-01 17:18:17] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 5 ms to minimize.
[2024-06-01 17:18:17] [INFO ] Deduced a trap composed of 55 places in 342 ms of which 5 ms to minimize.
[2024-06-01 17:18:18] [INFO ] Deduced a trap composed of 41 places in 400 ms of which 6 ms to minimize.
[2024-06-01 17:18:18] [INFO ] Deduced a trap composed of 47 places in 430 ms of which 6 ms to minimize.
[2024-06-01 17:18:19] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 6 ms to minimize.
[2024-06-01 17:18:19] [INFO ] Deduced a trap composed of 52 places in 454 ms of which 6 ms to minimize.
[2024-06-01 17:18:20] [INFO ] Deduced a trap composed of 36 places in 445 ms of which 6 ms to minimize.
[2024-06-01 17:18:20] [INFO ] Deduced a trap composed of 21 places in 412 ms of which 6 ms to minimize.
[2024-06-01 17:18:21] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 5 ms to minimize.
[2024-06-01 17:18:21] [INFO ] Deduced a trap composed of 65 places in 340 ms of which 5 ms to minimize.
[2024-06-01 17:18:22] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 6 ms to minimize.
[2024-06-01 17:18:22] [INFO ] Deduced a trap composed of 51 places in 320 ms of which 5 ms to minimize.
[2024-06-01 17:18:23] [INFO ] Deduced a trap composed of 38 places in 367 ms of which 6 ms to minimize.
[2024-06-01 17:18:23] [INFO ] Deduced a trap composed of 55 places in 322 ms of which 5 ms to minimize.
[2024-06-01 17:18:24] [INFO ] Deduced a trap composed of 35 places in 388 ms of which 6 ms to minimize.
[2024-06-01 17:18:24] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 5 ms to minimize.
[2024-06-01 17:18:25] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 6 ms to minimize.
[2024-06-01 17:18:26] [INFO ] Deduced a trap composed of 41 places in 327 ms of which 5 ms to minimize.
[2024-06-01 17:18:26] [INFO ] Deduced a trap composed of 55 places in 360 ms of which 5 ms to minimize.
[2024-06-01 17:18:27] [INFO ] Deduced a trap composed of 65 places in 376 ms of which 6 ms to minimize.
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 6 ms to minimize.
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 37 places in 365 ms of which 5 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 7 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 56 places in 360 ms of which 5 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 29 places in 305 ms of which 5 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 35 places in 355 ms of which 5 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 36 places in 419 ms of which 5 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 5 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 27 places in 394 ms of which 5 ms to minimize.
[2024-06-01 17:18:33] [INFO ] Deduced a trap composed of 47 places in 402 ms of which 6 ms to minimize.
[2024-06-01 17:18:33] [INFO ] Deduced a trap composed of 61 places in 416 ms of which 6 ms to minimize.
[2024-06-01 17:18:35] [INFO ] Deduced a trap composed of 92 places in 387 ms of which 6 ms to minimize.
[2024-06-01 17:18:35] [INFO ] Deduced a trap composed of 75 places in 431 ms of which 7 ms to minimize.
[2024-06-01 17:18:36] [INFO ] Deduced a trap composed of 36 places in 377 ms of which 6 ms to minimize.
[2024-06-01 17:18:36] [INFO ] Deduced a trap composed of 55 places in 430 ms of which 6 ms to minimize.
[2024-06-01 17:18:37] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 7 ms to minimize.
[2024-06-01 17:18:37] [INFO ] Deduced a trap composed of 49 places in 422 ms of which 6 ms to minimize.
[2024-06-01 17:18:38] [INFO ] Deduced a trap composed of 45 places in 478 ms of which 7 ms to minimize.
[2024-06-01 17:18:38] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 6 ms to minimize.
[2024-06-01 17:18:39] [INFO ] Deduced a trap composed of 48 places in 335 ms of which 6 ms to minimize.
[2024-06-01 17:18:40] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 6 ms to minimize.
[2024-06-01 17:18:43] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 44560 ms
[2024-06-01 17:18:43] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 17:18:43] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-06-01 17:18:43] [INFO ] [Real]Added 205 Read/Feed constraints in 41 ms returned sat
[2024-06-01 17:18:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:18:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 17:18:44] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-06-01 17:18:44] [INFO ] [Nat]Added 205 Read/Feed constraints in 102 ms returned sat
[2024-06-01 17:18:45] [INFO ] Deduced a trap composed of 32 places in 472 ms of which 7 ms to minimize.
[2024-06-01 17:18:45] [INFO ] Deduced a trap composed of 41 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:18:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1046 ms
[2024-06-01 17:18:45] [INFO ] Computed and/alt/rep : 702/1758/702 causal constraints (skipped 60 transitions) in 91 ms.
[2024-06-01 17:18:46] [INFO ] Deduced a trap composed of 30 places in 480 ms of which 7 ms to minimize.
[2024-06-01 17:18:47] [INFO ] Deduced a trap composed of 9 places in 454 ms of which 6 ms to minimize.
[2024-06-01 17:18:47] [INFO ] Deduced a trap composed of 13 places in 512 ms of which 7 ms to minimize.
[2024-06-01 17:18:48] [INFO ] Deduced a trap composed of 9 places in 516 ms of which 7 ms to minimize.
[2024-06-01 17:18:48] [INFO ] Deduced a trap composed of 11 places in 494 ms of which 6 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 9 places in 440 ms of which 6 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 29 places in 513 ms of which 16 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 7 ms to minimize.
[2024-06-01 17:18:51] [INFO ] Deduced a trap composed of 15 places in 429 ms of which 6 ms to minimize.
[2024-06-01 17:18:52] [INFO ] Deduced a trap composed of 82 places in 413 ms of which 9 ms to minimize.
[2024-06-01 17:18:52] [INFO ] Deduced a trap composed of 9 places in 438 ms of which 7 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 61 places in 456 ms of which 7 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 53 places in 414 ms of which 7 ms to minimize.
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 80 places in 415 ms of which 9 ms to minimize.
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 39 places in 388 ms of which 6 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 66 places in 339 ms of which 5 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 49 places in 379 ms of which 6 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 73 places in 447 ms of which 6 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 53 places in 398 ms of which 7 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 61 places in 414 ms of which 6 ms to minimize.
[2024-06-01 17:18:57] [INFO ] Deduced a trap composed of 34 places in 395 ms of which 6 ms to minimize.
[2024-06-01 17:18:57] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-06-01 17:18:57] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 11640 ms
[2024-06-01 17:19:00] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 6 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1080 ms
[2024-06-01 17:19:01] [INFO ] Added : 177 causal constraints over 38 iterations in 16258 ms. Result :sat
Minimization took 538 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 5] Max Struct:[6, 6]
Support contains 186 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 888/888 transitions.
Applied a total of 0 rules in 30 ms. Remains 474 /474 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 474/474 places, 888/888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 888/888 transitions.
Applied a total of 0 rules in 30 ms. Remains 474 /474 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2024-06-01 17:19:03] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:19:03] [INFO ] Invariant cache hit.
[2024-06-01 17:19:03] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-06-01 17:19:03] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:19:03] [INFO ] Invariant cache hit.
[2024-06-01 17:19:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:19:05] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2580 ms to find 0 implicit places.
[2024-06-01 17:19:05] [INFO ] Redundant transitions in 92 ms returned []
Running 882 sub problems to find dead transitions.
[2024-06-01 17:19:05] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:19:05] [INFO ] Invariant cache hit.
[2024-06-01 17:19:05] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 17:19:19] [INFO ] Deduced a trap composed of 55 places in 333 ms of which 6 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 43 places in 416 ms of which 6 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 37 places in 403 ms of which 6 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 37 places in 380 ms of which 6 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 55 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 57 places in 272 ms of which 4 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 53 places in 359 ms of which 5 ms to minimize.
[2024-06-01 17:19:22] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 6 ms to minimize.
[2024-06-01 17:19:22] [INFO ] Deduced a trap composed of 28 places in 428 ms of which 6 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 5 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 6 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 6 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 17 places in 410 ms of which 6 ms to minimize.
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 19 places in 458 ms of which 6 ms to minimize.
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 25 places in 479 ms of which 6 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Deduced a trap composed of 19 places in 402 ms of which 6 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Deduced a trap composed of 28 places in 366 ms of which 6 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Deduced a trap composed of 42 places in 358 ms of which 5 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 35 places in 438 ms of which 6 ms to minimize.
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 6 ms to minimize.
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 28 places in 404 ms of which 6 ms to minimize.
[2024-06-01 17:19:29] [INFO ] Deduced a trap composed of 29 places in 498 ms of which 7 ms to minimize.
[2024-06-01 17:19:29] [INFO ] Deduced a trap composed of 28 places in 429 ms of which 7 ms to minimize.
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 49 places in 441 ms of which 7 ms to minimize.
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 42 places in 485 ms of which 7 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 11 places in 447 ms of which 7 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 29 places in 408 ms of which 6 ms to minimize.
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 15 places in 441 ms of which 6 ms to minimize.
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 17 places in 456 ms of which 6 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 6 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 4 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 27 places in 391 ms of which 5 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 92 places in 395 ms of which 5 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 19 places in 496 ms of which 7 ms to minimize.
[2024-06-01 17:19:35] [INFO ] Deduced a trap composed of 13 places in 494 ms of which 7 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 6 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 17 places in 455 ms of which 7 ms to minimize.
SMT process timed out in 30713ms, After SMT, problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 30765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33499 ms. Remains : 474/474 places, 888/888 transitions.
RANDOM walk for 40000 steps (8 resets) in 3016 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 338534 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :2 out of 4
Probabilistic random walk after 338534 steps, saw 52672 distinct states, run finished after 3007 ms. (steps per millisecond=112 ) properties seen :2
[2024-06-01 17:19:40] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:19:40] [INFO ] Invariant cache hit.
[2024-06-01 17:19:40] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 432/438 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/444 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 768/1212 variables, 444/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1212 variables, 205/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1212 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1242 variables, 30/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1242 variables, 5/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1242 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1242 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1242/1242 variables, and 696 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 474/474 constraints, ReadFeed: 205/205 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 432/438 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/444 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 768/1212 variables, 444/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1212 variables, 205/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1212 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1212 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/1242 variables, 30/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1242 variables, 5/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:19:43] [INFO ] Deduced a trap composed of 19 places in 396 ms of which 3 ms to minimize.
[2024-06-01 17:19:43] [INFO ] Deduced a trap composed of 13 places in 341 ms of which 6 ms to minimize.
[2024-06-01 17:19:44] [INFO ] Deduced a trap composed of 41 places in 469 ms of which 7 ms to minimize.
[2024-06-01 17:19:44] [INFO ] Deduced a trap composed of 11 places in 399 ms of which 6 ms to minimize.
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 20 places in 393 ms of which 6 ms to minimize.
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 47 places in 424 ms of which 6 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 57 places in 404 ms of which 6 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 6 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 7 ms to minimize.
SMT process timed out in 6156ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 888/888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 474 transition count 833
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 419 transition count 833
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 110 place count 419 transition count 708
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 360 place count 294 transition count 708
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 420 place count 264 transition count 678
Applied a total of 420 rules in 75 ms. Remains 264 /474 variables (removed 210) and now considering 678/888 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 264/474 places, 678/888 transitions.
RANDOM walk for 40000 steps (8 resets) in 899 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 530425 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 2
Probabilistic random walk after 530425 steps, saw 78175 distinct states, run finished after 3004 ms. (steps per millisecond=176 ) properties seen :0
[2024-06-01 17:19:50] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2024-06-01 17:19:50] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 17:19:50] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/234 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/792 variables, 234/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 205/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/822 variables, 30/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/822 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 486 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/234 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/792 variables, 234/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 205/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/822 variables, 30/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 5/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:19:51] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-06-01 17:19:51] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-06-01 17:19:52] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 2 ms to minimize.
[2024-06-01 17:19:52] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-06-01 17:19:52] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:19:52] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 4 ms to minimize.
[2024-06-01 17:19:52] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 3 ms to minimize.
[2024-06-01 17:19:53] [INFO ] Deduced a trap composed of 61 places in 267 ms of which 4 ms to minimize.
[2024-06-01 17:19:53] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:19:53] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:19:54] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:19:54] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 4 ms to minimize.
[2024-06-01 17:19:54] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:19:54] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 4 ms to minimize.
[2024-06-01 17:19:55] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:19:55] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 3 ms to minimize.
[2024-06-01 17:19:55] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 4 ms to minimize.
[2024-06-01 17:19:56] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:19:56] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
[2024-06-01 17:19:56] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/822 variables, 20/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:19:56] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:19:57] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 2 ms to minimize.
[2024-06-01 17:19:57] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 3 ms to minimize.
[2024-06-01 17:19:57] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 4 ms to minimize.
[2024-06-01 17:19:57] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 3 ms to minimize.
[2024-06-01 17:19:57] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 4 ms to minimize.
[2024-06-01 17:19:58] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:19:58] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 4 ms to minimize.
[2024-06-01 17:19:58] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 4 ms to minimize.
[2024-06-01 17:19:58] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 4 ms to minimize.
[2024-06-01 17:19:59] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:19:59] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:19:59] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-01 17:19:59] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 4 ms to minimize.
[2024-06-01 17:20:00] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 4 ms to minimize.
[2024-06-01 17:20:00] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-06-01 17:20:00] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-06-01 17:20:00] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2024-06-01 17:20:00] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 4 ms to minimize.
[2024-06-01 17:20:01] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 20/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:20:01] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-01 17:20:01] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 17:20:01] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 17:20:01] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:20:02] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 3 ms to minimize.
[2024-06-01 17:20:02] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 4 ms to minimize.
[2024-06-01 17:20:02] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-06-01 17:20:02] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:20:02] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 2 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-06-01 17:20:04] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2024-06-01 17:20:04] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-06-01 17:20:04] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 3 ms to minimize.
[2024-06-01 17:20:05] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-06-01 17:20:05] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 20/548 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:20:05] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-06-01 17:20:05] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-06-01 17:20:05] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 2 ms to minimize.
[2024-06-01 17:20:06] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-06-01 17:20:06] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-06-01 17:20:06] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-06-01 17:20:06] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 3 ms to minimize.
[2024-06-01 17:20:06] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 5 ms to minimize.
[2024-06-01 17:20:06] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 3 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 3 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 3 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-01 17:20:08] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-01 17:20:08] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-06-01 17:20:09] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-06-01 17:20:09] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-01 17:20:10] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 20/568 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:20:12] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-01 17:20:12] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-01 17:20:12] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-06-01 17:20:12] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-01 17:20:13] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2024-06-01 17:20:13] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-01 17:20:13] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 17:20:15] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-06-01 17:20:15] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 3 ms to minimize.
[2024-06-01 17:20:15] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 2 ms to minimize.
[2024-06-01 17:20:15] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:20:16] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 4 ms to minimize.
[2024-06-01 17:20:16] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-06-01 17:20:17] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-06-01 17:20:18] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 17:20:18] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-06-01 17:20:19] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-01 17:20:20] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-06-01 17:20:20] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:20:20] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 20/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:20:20] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 4 ms to minimize.
[2024-06-01 17:20:21] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 4 ms to minimize.
[2024-06-01 17:20:21] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 4 ms to minimize.
[2024-06-01 17:20:21] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 3 ms to minimize.
[2024-06-01 17:20:22] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:20:22] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:20:24] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 17:20:24] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 17:20:25] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-01 17:20:25] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-06-01 17:20:25] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-06-01 17:20:26] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-01 17:20:26] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:20:26] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-06-01 17:20:26] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:20:27] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-06-01 17:20:27] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:20:27] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-06-01 17:20:27] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 17:20:28] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/822 variables, 20/608 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:20:29] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-06-01 17:20:29] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-06-01 17:20:29] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-06-01 17:20:30] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-06-01 17:20:30] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-06-01 17:20:32] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 3 ms to minimize.
[2024-06-01 17:20:32] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-01 17:20:32] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-06-01 17:20:33] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 17:20:33] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-06-01 17:20:34] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 2 ms to minimize.
[2024-06-01 17:20:34] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:20:35] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 17:20:35] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-06-01 17:20:35] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/822 variables, and 623 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 135/135 constraints]
After SMT, in 45491ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 20 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 264/264 places, 678/678 transitions.
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675640 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 675640 steps, saw 99130 distinct states, run finished after 3003 ms. (steps per millisecond=224 ) properties seen :0
[2024-06-01 17:20:39] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-06-01 17:20:39] [INFO ] Invariant cache hit.
[2024-06-01 17:20:39] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6/234 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/792 variables, 234/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 205/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/822 variables, 30/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/822 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 486 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:39] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-06-01 17:20:40] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/234 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 558/792 variables, 234/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 205/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/822 variables, 30/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/822 variables, 5/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:40] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 4 ms to minimize.
[2024-06-01 17:20:41] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 4 ms to minimize.
[2024-06-01 17:20:41] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 4 ms to minimize.
[2024-06-01 17:20:41] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 3 ms to minimize.
[2024-06-01 17:20:41] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:20:42] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:20:42] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-06-01 17:20:42] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 4 ms to minimize.
[2024-06-01 17:20:42] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 3 ms to minimize.
[2024-06-01 17:20:43] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 4 ms to minimize.
[2024-06-01 17:20:43] [INFO ] Deduced a trap composed of 12 places in 292 ms of which 4 ms to minimize.
[2024-06-01 17:20:43] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 3 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 3 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 4 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 20/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 4 ms to minimize.
[2024-06-01 17:20:47] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 5 ms to minimize.
[2024-06-01 17:20:47] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 4 ms to minimize.
[2024-06-01 17:20:47] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:20:48] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 4 ms to minimize.
[2024-06-01 17:20:48] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:20:48] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:20:48] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 4 ms to minimize.
[2024-06-01 17:20:49] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:20:49] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:20:49] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:20:49] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:20:50] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 4 ms to minimize.
[2024-06-01 17:20:50] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 4 ms to minimize.
[2024-06-01 17:20:50] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 3 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 4 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 20/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 4 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 3 ms to minimize.
[2024-06-01 17:20:54] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-06-01 17:20:54] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 2 ms to minimize.
[2024-06-01 17:20:54] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-06-01 17:20:54] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:20:55] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-06-01 17:20:55] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-06-01 17:20:55] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
[2024-06-01 17:20:55] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:20:55] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 20/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:56] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 4 ms to minimize.
[2024-06-01 17:20:56] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-06-01 17:20:56] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 3 ms to minimize.
[2024-06-01 17:20:56] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-06-01 17:20:56] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 3 ms to minimize.
[2024-06-01 17:20:57] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 3 ms to minimize.
[2024-06-01 17:20:57] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-06-01 17:20:57] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-06-01 17:20:58] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:20:58] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 4 ms to minimize.
[2024-06-01 17:20:58] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:20:58] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 3 ms to minimize.
[2024-06-01 17:20:59] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 2 ms to minimize.
[2024-06-01 17:20:59] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 2 ms to minimize.
[2024-06-01 17:20:59] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 2 ms to minimize.
[2024-06-01 17:20:59] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 2 ms to minimize.
[2024-06-01 17:21:00] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 4 ms to minimize.
[2024-06-01 17:21:00] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 2 ms to minimize.
[2024-06-01 17:21:00] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:21:00] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 20/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:21:01] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2024-06-01 17:21:01] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-06-01 17:21:01] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:21:01] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
[2024-06-01 17:21:02] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:21:02] [INFO ] Deduced a trap composed of 56 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:21:02] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:21:02] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 4 ms to minimize.
[2024-06-01 17:21:02] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-06-01 17:21:03] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2024-06-01 17:21:04] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
[2024-06-01 17:21:04] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:21:05] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:21:05] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 2 ms to minimize.
[2024-06-01 17:21:05] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-06-01 17:21:05] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-06-01 17:21:05] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2024-06-01 17:21:06] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-06-01 17:21:06] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 17:21:06] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/822 variables, 20/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:21:06] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-06-01 17:21:06] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 3 ms to minimize.
[2024-06-01 17:21:06] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 3 ms to minimize.
[2024-06-01 17:21:09] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-06-01 17:21:14] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/822 variables, 20/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2024-06-01 17:21:19] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-06-01 17:21:19] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 4 ms to minimize.
[2024-06-01 17:21:19] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:21:21] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-06-01 17:21:21] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 4 ms to minimize.
[2024-06-01 17:21:21] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 3 ms to minimize.
[2024-06-01 17:21:22] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2024-06-01 17:21:22] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 3 ms to minimize.
[2024-06-01 17:21:22] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-01 17:21:23] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
[2024-06-01 17:21:23] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 4 ms to minimize.
[2024-06-01 17:21:23] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-06-01 17:21:23] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/822 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:21:24] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-01 17:21:24] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 17:21:24] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-06-01 17:21:25] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2024-06-01 17:21:25] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-01 17:21:26] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-06-01 17:21:26] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-06-01 17:21:26] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2024-06-01 17:21:26] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-06-01 17:21:27] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2024-06-01 17:21:27] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-06-01 17:21:31] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-06-01 17:21:31] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 822/822 variables, and 642 constraints, problems are : Problem set: 1 solved, 0 unsolved in 52702 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 155/155 constraints]
After SMT, in 53126ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Peterson-COL-5-UpperBounds-10 6 TECHNIQUES REACHABILITY_MAX
FORMULA Peterson-COL-5-UpperBounds-07 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 390615 ms.
ITS solved all properties within timeout
BK_STOP 1717262492425
--------------------
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
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="Peterson-COL-5"
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 Peterson-COL-5, 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 r512-smll-171654407200229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 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 ;