About the Execution of GreatSPN+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 |
| 725.432 | 387784.00 | 435924.00 | 1211.20 | 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.r267-smll-171654406000229.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 greatspnxred
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 r267-smll-171654406000229
=====================================================================
--------------------
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 1716738094837
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 15:41:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 15:41:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 15:41:37] [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-05-26 15:41:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 15:41:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1257 ms
[2024-05-26 15:41:38] [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 15 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2024-05-26 15:41:38] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-26 15:41:38] [INFO ] Skeletonized 10 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-05-26 15:41:38] [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-05-26 15:41:39] [INFO ] Invariant cache hit.
[2024-05-26 15:41:39] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-26 15:41:39] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-26 15:41:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-26 15:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 15:41:39] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-26 15:41:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-26 15:41:39] [INFO ] Added : 11 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 19 ms.
[2024-05-26 15:41:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 15:41:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-26 15:41:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 15:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 15:41:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 15:41:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-26 15:41:39] [INFO ] Added : 11 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 15:41:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 15:41:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 15:41:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 15:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 15:41:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 15:41:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 15:41:39] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 10 ms.
[2024-05-26 15:41:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 15:41:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 15:41:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 15:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 15:41:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 15:41:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 15:41:39] [INFO ] Added : 12 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 15:41:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 15:41:40] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-26 15:41:40] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 15:41:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 15:41:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-26 15:41:40] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 15:41:40] [INFO ] Added : 11 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 15:41:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 15:41:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 15:41:40] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 15:41:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 15:41:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 15:41:40] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 15:41:40] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 15:41:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 15:41:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 15:41:40] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 15:41:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 15:41:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-26 15:41:40] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 15:41:40] [INFO ] Added : 11 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 9 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-05-26 15:41:40] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 104 ms.
[2024-05-26 15:41:40] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 27 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-05-26 15:41:40] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:41:40] [INFO ] Computed 23 invariants in 39 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 277 ms. (35 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 262 ms. (152 steps per ms)
FORMULA Peterson-COL-5-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 3] Max Struct:[6, 6, 6]
[2024-05-26 15:41:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:41:41] [INFO ] Invariant cache hit.
[2024-05-26 15:41:41] [INFO ] [Real]Absence check using 17 positive place invariants in 38 ms returned sat
[2024-05-26 15:41:41] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 20 ms returned sat
[2024-05-26 15:41:42] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2024-05-26 15:41:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:41:42] [INFO ] [Real]Added 205 Read/Feed constraints in 104 ms returned sat
[2024-05-26 15:41:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 36 ms returned sat
[2024-05-26 15:41:42] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2024-05-26 15:41:43] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2024-05-26 15:41:43] [INFO ] [Nat]Added 205 Read/Feed constraints in 241 ms returned sat
[2024-05-26 15:41:44] [INFO ] Deduced a trap composed of 23 places in 622 ms of which 110 ms to minimize.
[2024-05-26 15:41:45] [INFO ] Deduced a trap composed of 11 places in 925 ms of which 11 ms to minimize.
[2024-05-26 15:41:46] [INFO ] Deduced a trap composed of 11 places in 901 ms of which 12 ms to minimize.
[2024-05-26 15:41:47] [INFO ] Deduced a trap composed of 13 places in 680 ms of which 10 ms to minimize.
[2024-05-26 15:41:48] [INFO ] Deduced a trap composed of 23 places in 635 ms of which 11 ms to minimize.
[2024-05-26 15:41:48] [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-05-26 15:41:48] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2024-05-26 15:41:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2024-05-26 15:41:49] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2024-05-26 15:41:49] [INFO ] [Real]Added 205 Read/Feed constraints in 86 ms returned sat
[2024-05-26 15:41:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 35 ms returned sat
[2024-05-26 15:41:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2024-05-26 15:41:50] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2024-05-26 15:41:50] [INFO ] [Nat]Added 205 Read/Feed constraints in 324 ms returned sat
[2024-05-26 15:41:51] [INFO ] Deduced a trap composed of 37 places in 807 ms of which 10 ms to minimize.
[2024-05-26 15:41:52] [INFO ] Deduced a trap composed of 53 places in 663 ms of which 15 ms to minimize.
[2024-05-26 15:41:53] [INFO ] Deduced a trap composed of 41 places in 782 ms of which 11 ms to minimize.
[2024-05-26 15:41:54] [INFO ] Deduced a trap composed of 22 places in 761 ms of which 7 ms to minimize.
[2024-05-26 15:41:54] [INFO ] Deduced a trap composed of 71 places in 626 ms of which 9 ms to minimize.
[2024-05-26 15:41:54] [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-05-26 15:41:55] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2024-05-26 15:41:55] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2024-05-26 15:41:55] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2024-05-26 15:41:56] [INFO ] [Real]Added 205 Read/Feed constraints in 94 ms returned sat
[2024-05-26 15:41:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:41:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2024-05-26 15:41:56] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2024-05-26 15:41:57] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2024-05-26 15:41:57] [INFO ] [Nat]Added 205 Read/Feed constraints in 189 ms returned sat
[2024-05-26 15:41:58] [INFO ] Deduced a trap composed of 56 places in 926 ms of which 13 ms to minimize.
[2024-05-26 15:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1105 ms
[2024-05-26 15:41:58] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 158 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 3] Max Struct:[6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 1, 3] Max Struct:[6, 6, 6]
Support contains 216 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 4 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 272 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 295 ms. Remains : 504/834 places, 912/1242 transitions.
[2024-05-26 15:42:01] [INFO ] Flow matrix only has 792 transitions (discarded 120 similar events)
// Phase 1: matrix 792 rows 504 cols
[2024-05-26 15:42:01] [INFO ] Computed 23 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 1, 3] Max Struct:[6, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 6410 ms. (155 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 6666 ms. (449 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 1, 5] Max Struct:[6, 6, 6]
[2024-05-26 15:42:14] [INFO ] Flow matrix only has 792 transitions (discarded 120 similar events)
[2024-05-26 15:42:14] [INFO ] Invariant cache hit.
[2024-05-26 15:42:14] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-26 15:42:14] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-26 15:42:14] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-26 15:42:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:42:15] [INFO ] [Real]Added 205 Read/Feed constraints in 79 ms returned sat
[2024-05-26 15:42:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:42:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-26 15:42:15] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-26 15:42:15] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2024-05-26 15:42:15] [INFO ] [Nat]Added 205 Read/Feed constraints in 148 ms returned sat
[2024-05-26 15:42:16] [INFO ] Deduced a trap composed of 9 places in 423 ms of which 7 ms to minimize.
[2024-05-26 15:42:16] [INFO ] Deduced a trap composed of 9 places in 440 ms of which 7 ms to minimize.
[2024-05-26 15:42:17] [INFO ] Deduced a trap composed of 11 places in 451 ms of which 7 ms to minimize.
[2024-05-26 15:42:17] [INFO ] Deduced a trap composed of 9 places in 435 ms of which 7 ms to minimize.
[2024-05-26 15:42:18] [INFO ] Deduced a trap composed of 13 places in 451 ms of which 7 ms to minimize.
[2024-05-26 15:42:18] [INFO ] Deduced a trap composed of 11 places in 455 ms of which 6 ms to minimize.
[2024-05-26 15:42:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 2977 ms
[2024-05-26 15:42:19] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2024-05-26 15:42:19] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-26 15:42:19] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2024-05-26 15:42:19] [INFO ] [Real]Added 205 Read/Feed constraints in 47 ms returned sat
[2024-05-26 15:42:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:42:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-26 15:42:19] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2024-05-26 15:42:20] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2024-05-26 15:42:20] [INFO ] [Nat]Added 205 Read/Feed constraints in 139 ms returned sat
[2024-05-26 15:42:20] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 5 ms to minimize.
[2024-05-26 15:42:21] [INFO ] Deduced a trap composed of 67 places in 396 ms of which 7 ms to minimize.
[2024-05-26 15:42:21] [INFO ] Deduced a trap composed of 41 places in 444 ms of which 6 ms to minimize.
[2024-05-26 15:42:22] [INFO ] Deduced a trap composed of 13 places in 437 ms of which 7 ms to minimize.
[2024-05-26 15:42:22] [INFO ] Deduced a trap composed of 65 places in 434 ms of which 7 ms to minimize.
[2024-05-26 15:42:23] [INFO ] Deduced a trap composed of 28 places in 380 ms of which 7 ms to minimize.
[2024-05-26 15:42:23] [INFO ] Deduced a trap composed of 55 places in 463 ms of which 7 ms to minimize.
[2024-05-26 15:42:24] [INFO ] Deduced a trap composed of 70 places in 467 ms of which 7 ms to minimize.
[2024-05-26 15:42:24] [INFO ] Deduced a trap composed of 43 places in 450 ms of which 6 ms to minimize.
[2024-05-26 15:42:25] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 7 ms to minimize.
[2024-05-26 15:42:25] [INFO ] Deduced a trap composed of 106 places in 459 ms of which 7 ms to minimize.
[2024-05-26 15:42:26] [INFO ] Deduced a trap composed of 62 places in 446 ms of which 10 ms to minimize.
[2024-05-26 15:42:26] [INFO ] Deduced a trap composed of 30 places in 450 ms of which 7 ms to minimize.
[2024-05-26 15:42:27] [INFO ] Deduced a trap composed of 26 places in 446 ms of which 7 ms to minimize.
[2024-05-26 15:42:27] [INFO ] Deduced a trap composed of 85 places in 413 ms of which 7 ms to minimize.
[2024-05-26 15:42:28] [INFO ] Deduced a trap composed of 39 places in 423 ms of which 7 ms to minimize.
[2024-05-26 15:42:28] [INFO ] Deduced a trap composed of 46 places in 420 ms of which 6 ms to minimize.
[2024-05-26 15:42:29] [INFO ] Deduced a trap composed of 39 places in 433 ms of which 7 ms to minimize.
[2024-05-26 15:42:29] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 6 ms to minimize.
[2024-05-26 15:42:30] [INFO ] Deduced a trap composed of 43 places in 428 ms of which 7 ms to minimize.
[2024-05-26 15:42:30] [INFO ] Deduced a trap composed of 58 places in 411 ms of which 7 ms to minimize.
[2024-05-26 15:42:31] [INFO ] Deduced a trap composed of 63 places in 416 ms of which 6 ms to minimize.
[2024-05-26 15:42:31] [INFO ] Deduced a trap composed of 45 places in 414 ms of which 6 ms to minimize.
[2024-05-26 15:42:32] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 6 ms to minimize.
[2024-05-26 15:42:32] [INFO ] Deduced a trap composed of 41 places in 441 ms of which 6 ms to minimize.
[2024-05-26 15:42:33] [INFO ] Deduced a trap composed of 56 places in 435 ms of which 7 ms to minimize.
[2024-05-26 15:42:33] [INFO ] Deduced a trap composed of 91 places in 437 ms of which 6 ms to minimize.
[2024-05-26 15:42:34] [INFO ] Deduced a trap composed of 66 places in 453 ms of which 7 ms to minimize.
[2024-05-26 15:42:34] [INFO ] Deduced a trap composed of 71 places in 432 ms of which 6 ms to minimize.
[2024-05-26 15:42:35] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 7 ms to minimize.
[2024-05-26 15:42:35] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 6 ms to minimize.
[2024-05-26 15:42:35] [INFO ] Deduced a trap composed of 24 places in 408 ms of which 7 ms to minimize.
[2024-05-26 15:42:36] [INFO ] Deduced a trap composed of 95 places in 384 ms of which 7 ms to minimize.
[2024-05-26 15:42:36] [INFO ] Deduced a trap composed of 15 places in 413 ms of which 6 ms to minimize.
[2024-05-26 15:42:37] [INFO ] Deduced a trap composed of 92 places in 407 ms of which 7 ms to minimize.
[2024-05-26 15:42:37] [INFO ] Deduced a trap composed of 41 places in 411 ms of which 6 ms to minimize.
[2024-05-26 15:42:41] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 4 ms to minimize.
[2024-05-26 15:42:42] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 7 ms to minimize.
[2024-05-26 15:42:42] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 6 ms to minimize.
[2024-05-26 15:42:42] [INFO ] Deduced a trap composed of 22 places in 421 ms of which 9 ms to minimize.
[2024-05-26 15:42:43] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 7 ms to minimize.
[2024-05-26 15:42:43] [INFO ] Deduced a trap composed of 49 places in 344 ms of which 6 ms to minimize.
[2024-05-26 15:42:44] [INFO ] Deduced a trap composed of 49 places in 368 ms of which 6 ms to minimize.
[2024-05-26 15:42:44] [INFO ] Deduced a trap composed of 64 places in 386 ms of which 6 ms to minimize.
[2024-05-26 15:42:45] [INFO ] Deduced a trap composed of 58 places in 380 ms of which 6 ms to minimize.
[2024-05-26 15:42:45] [INFO ] Deduced a trap composed of 43 places in 390 ms of which 6 ms to minimize.
[2024-05-26 15:42:46] [INFO ] Deduced a trap composed of 45 places in 367 ms of which 6 ms to minimize.
[2024-05-26 15:42:47] [INFO ] Deduced a trap composed of 79 places in 368 ms of which 6 ms to minimize.
[2024-05-26 15:42:47] [INFO ] Deduced a trap composed of 49 places in 383 ms of which 6 ms to minimize.
[2024-05-26 15:42:48] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 6 ms to minimize.
[2024-05-26 15:42:50] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 6 ms to minimize.
[2024-05-26 15:42:50] [INFO ] Deduced a trap composed of 57 places in 398 ms of which 6 ms to minimize.
[2024-05-26 15:42:51] [INFO ] Deduced a trap composed of 15 places in 444 ms of which 7 ms to minimize.
[2024-05-26 15:42:52] [INFO ] Deduced a trap composed of 65 places in 404 ms of which 7 ms to minimize.
[2024-05-26 15:42:52] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 6 ms to minimize.
[2024-05-26 15:42:53] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 5 ms to minimize.
[2024-05-26 15:42:54] [INFO ] Deduced a trap composed of 35 places in 307 ms of which 5 ms to minimize.
[2024-05-26 15:42:55] [INFO ] Deduced a trap composed of 42 places in 407 ms of which 6 ms to minimize.
[2024-05-26 15:42:57] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 4 ms to minimize.
[2024-05-26 15:42:58] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 4 ms to minimize.
[2024-05-26 15:42:58] [INFO ] Deduced a trap composed of 17 places in 371 ms of which 5 ms to minimize.
[2024-05-26 15:42:59] [INFO ] Deduced a trap composed of 45 places in 403 ms of which 6 ms to minimize.
[2024-05-26 15:43:00] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 4 ms to minimize.
[2024-05-26 15:43:00] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 4 ms to minimize.
[2024-05-26 15:43:01] [INFO ] Deduced a trap composed of 61 places in 258 ms of which 4 ms to minimize.
[2024-05-26 15:43:02] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 6 ms to minimize.
[2024-05-26 15:43:02] [INFO ] Deduced a trap composed of 26 places in 362 ms of which 6 ms to minimize.
[2024-05-26 15:43:04] [INFO ] Deduced a trap composed of 56 places in 321 ms of which 6 ms to minimize.
[2024-05-26 15:43:04] [INFO ] Deduced a trap composed of 49 places in 368 ms of which 6 ms to minimize.
[2024-05-26 15:43:04] [INFO ] Deduced a trap composed of 56 places in 388 ms of which 6 ms to minimize.
[2024-05-26 15:43:04] [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-05-26 15:43:05] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-26 15:43:05] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2024-05-26 15:43:05] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-26 15:43:05] [INFO ] [Real]Added 205 Read/Feed constraints in 82 ms returned sat
[2024-05-26 15:43:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:43:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-26 15:43:05] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2024-05-26 15:43:06] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2024-05-26 15:43:06] [INFO ] [Nat]Added 205 Read/Feed constraints in 102 ms returned sat
[2024-05-26 15:43:06] [INFO ] Deduced a trap composed of 75 places in 461 ms of which 7 ms to minimize.
[2024-05-26 15:43:07] [INFO ] Deduced a trap composed of 9 places in 543 ms of which 8 ms to minimize.
[2024-05-26 15:43:08] [INFO ] Deduced a trap composed of 9 places in 547 ms of which 8 ms to minimize.
[2024-05-26 15:43:08] [INFO ] Deduced a trap composed of 46 places in 531 ms of which 7 ms to minimize.
[2024-05-26 15:43:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2329 ms
[2024-05-26 15:43:08] [INFO ] Computed and/alt/rep : 726/1662/726 causal constraints (skipped 60 transitions) in 111 ms.
[2024-05-26 15:43:12] [INFO ] Deduced a trap composed of 36 places in 465 ms of which 7 ms to minimize.
[2024-05-26 15:43:12] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 8 ms to minimize.
[2024-05-26 15:43:13] [INFO ] Deduced a trap composed of 20 places in 529 ms of which 8 ms to minimize.
[2024-05-26 15:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1845 ms
[2024-05-26 15:43:13] [INFO ] Added : 143 causal constraints over 30 iterations in 4858 ms. Result :sat
Minimization took 506 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, 6] 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 69 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 71 ms. Remains : 480/504 places, 888/912 transitions.
[2024-05-26 15:43:14] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 480 cols
[2024-05-26 15:43:14] [INFO ] Computed 23 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 6] Max Struct:[6, 6]
FORMULA Peterson-COL-5-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 2243 ms. (445 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 619 ms. (1612 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-26 15:43:17] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-05-26 15:43:17] [INFO ] Invariant cache hit.
[2024-05-26 15:43:17] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-26 15:43:17] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2024-05-26 15:43:18] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2024-05-26 15:43:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:43:18] [INFO ] [Real]Added 205 Read/Feed constraints in 53 ms returned sat
[2024-05-26 15:43:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:43:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-26 15:43:18] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-26 15:43:19] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2024-05-26 15:43:19] [INFO ] [Nat]Added 205 Read/Feed constraints in 168 ms returned sat
[2024-05-26 15:43:19] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 7 ms to minimize.
[2024-05-26 15:43:20] [INFO ] Deduced a trap composed of 32 places in 401 ms of which 6 ms to minimize.
[2024-05-26 15:43:20] [INFO ] Deduced a trap composed of 44 places in 439 ms of which 6 ms to minimize.
[2024-05-26 15:43:21] [INFO ] Deduced a trap composed of 90 places in 324 ms of which 7 ms to minimize.
[2024-05-26 15:43:21] [INFO ] Deduced a trap composed of 11 places in 423 ms of which 6 ms to minimize.
[2024-05-26 15:43:21] [INFO ] Deduced a trap composed of 37 places in 409 ms of which 6 ms to minimize.
[2024-05-26 15:43:22] [INFO ] Deduced a trap composed of 11 places in 427 ms of which 6 ms to minimize.
[2024-05-26 15:43:22] [INFO ] Deduced a trap composed of 28 places in 358 ms of which 6 ms to minimize.
[2024-05-26 15:43:23] [INFO ] Deduced a trap composed of 42 places in 376 ms of which 6 ms to minimize.
[2024-05-26 15:43:23] [INFO ] Deduced a trap composed of 25 places in 385 ms of which 6 ms to minimize.
[2024-05-26 15:43:24] [INFO ] Deduced a trap composed of 27 places in 397 ms of which 6 ms to minimize.
[2024-05-26 15:43:24] [INFO ] Deduced a trap composed of 74 places in 381 ms of which 6 ms to minimize.
[2024-05-26 15:43:25] [INFO ] Deduced a trap composed of 85 places in 424 ms of which 6 ms to minimize.
[2024-05-26 15:43:25] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 6 ms to minimize.
[2024-05-26 15:43:26] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 6 ms to minimize.
[2024-05-26 15:43:26] [INFO ] Deduced a trap composed of 35 places in 398 ms of which 6 ms to minimize.
[2024-05-26 15:43:27] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 6 ms to minimize.
[2024-05-26 15:43:27] [INFO ] Deduced a trap composed of 40 places in 422 ms of which 7 ms to minimize.
[2024-05-26 15:43:28] [INFO ] Deduced a trap composed of 34 places in 450 ms of which 6 ms to minimize.
[2024-05-26 15:43:28] [INFO ] Deduced a trap composed of 26 places in 406 ms of which 6 ms to minimize.
[2024-05-26 15:43:30] [INFO ] Deduced a trap composed of 44 places in 352 ms of which 6 ms to minimize.
[2024-05-26 15:43:30] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 7 ms to minimize.
[2024-05-26 15:43:31] [INFO ] Deduced a trap composed of 75 places in 340 ms of which 6 ms to minimize.
[2024-05-26 15:43:31] [INFO ] Deduced a trap composed of 70 places in 363 ms of which 6 ms to minimize.
[2024-05-26 15:43:31] [INFO ] Deduced a trap composed of 61 places in 318 ms of which 5 ms to minimize.
[2024-05-26 15:43:32] [INFO ] Deduced a trap composed of 75 places in 358 ms of which 6 ms to minimize.
[2024-05-26 15:43:32] [INFO ] Deduced a trap composed of 55 places in 358 ms of which 5 ms to minimize.
[2024-05-26 15:43:33] [INFO ] Deduced a trap composed of 55 places in 380 ms of which 6 ms to minimize.
[2024-05-26 15:43:34] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 5 ms to minimize.
[2024-05-26 15:43:34] [INFO ] Deduced a trap composed of 51 places in 340 ms of which 5 ms to minimize.
[2024-05-26 15:43:34] [INFO ] Deduced a trap composed of 77 places in 323 ms of which 5 ms to minimize.
[2024-05-26 15:43:35] [INFO ] Deduced a trap composed of 53 places in 354 ms of which 5 ms to minimize.
[2024-05-26 15:43:35] [INFO ] Deduced a trap composed of 58 places in 373 ms of which 5 ms to minimize.
[2024-05-26 15:43:36] [INFO ] Deduced a trap composed of 53 places in 403 ms of which 7 ms to minimize.
[2024-05-26 15:43:36] [INFO ] Deduced a trap composed of 19 places in 411 ms of which 6 ms to minimize.
[2024-05-26 15:43:37] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 10 ms to minimize.
[2024-05-26 15:43:37] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 6 ms to minimize.
[2024-05-26 15:43:38] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 6 ms to minimize.
[2024-05-26 15:43:38] [INFO ] Deduced a trap composed of 9 places in 401 ms of which 6 ms to minimize.
[2024-05-26 15:43:39] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 6 ms to minimize.
[2024-05-26 15:43:39] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 6 ms to minimize.
[2024-05-26 15:43:40] [INFO ] Deduced a trap composed of 44 places in 437 ms of which 6 ms to minimize.
[2024-05-26 15:43:40] [INFO ] Deduced a trap composed of 38 places in 434 ms of which 6 ms to minimize.
[2024-05-26 15:43:41] [INFO ] Deduced a trap composed of 9 places in 427 ms of which 6 ms to minimize.
[2024-05-26 15:43:41] [INFO ] Deduced a trap composed of 53 places in 403 ms of which 6 ms to minimize.
[2024-05-26 15:43:42] [INFO ] Deduced a trap composed of 28 places in 457 ms of which 6 ms to minimize.
[2024-05-26 15:43:43] [INFO ] Deduced a trap composed of 39 places in 411 ms of which 6 ms to minimize.
[2024-05-26 15:43:43] [INFO ] Deduced a trap composed of 24 places in 416 ms of which 6 ms to minimize.
[2024-05-26 15:43:44] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 6 ms to minimize.
[2024-05-26 15:43:44] [INFO ] Deduced a trap composed of 145 places in 436 ms of which 6 ms to minimize.
[2024-05-26 15:43:45] [INFO ] Deduced a trap composed of 77 places in 389 ms of which 6 ms to minimize.
[2024-05-26 15:43:45] [INFO ] Deduced a trap composed of 58 places in 376 ms of which 6 ms to minimize.
[2024-05-26 15:43:49] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 4 ms to minimize.
[2024-05-26 15:43:50] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 6 ms to minimize.
[2024-05-26 15:43:50] [INFO ] Deduced a trap composed of 19 places in 404 ms of which 6 ms to minimize.
[2024-05-26 15:43:52] [INFO ] Deduced a trap composed of 131 places in 195 ms of which 3 ms to minimize.
[2024-05-26 15:43:52] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 5 ms to minimize.
[2024-05-26 15:43:52] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 5 ms to minimize.
[2024-05-26 15:43:53] [INFO ] Deduced a trap composed of 44 places in 341 ms of which 6 ms to minimize.
[2024-05-26 15:43:53] [INFO ] Deduced a trap composed of 65 places in 325 ms of which 6 ms to minimize.
[2024-05-26 15:43:54] [INFO ] Deduced a trap composed of 80 places in 421 ms of which 6 ms to minimize.
[2024-05-26 15:43:54] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 5 ms to minimize.
[2024-05-26 15:43:58] [INFO ] Deduced a trap composed of 43 places in 336 ms of which 6 ms to minimize.
[2024-05-26 15:43:58] [INFO ] Deduced a trap composed of 39 places in 384 ms of which 6 ms to minimize.
[2024-05-26 15:44:01] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 6 ms to minimize.
[2024-05-26 15:44:03] [INFO ] Trap strengthening (SAT) tested/added 65/65 trap constraints in 44234 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 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 480 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 425 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 425 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 300 transition count 708
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 420 place count 270 transition count 678
Applied a total of 420 rules in 66 ms. Remains 270 /480 variables (removed 210) and now considering 678/888 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 270/480 places, 678/888 transitions.
[2024-05-26 15:44:03] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2024-05-26 15:44:03] [INFO ] Computed 23 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1859 ms. (537 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 601 ms. (1661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-26 15:44:06] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:44:06] [INFO ] Invariant cache hit.
[2024-05-26 15:44:06] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-26 15:44:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-26 15:44:06] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-26 15:44:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:44:06] [INFO ] [Real]Added 205 Read/Feed constraints in 42 ms returned sat
[2024-05-26 15:44:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:44:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-26 15:44:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-26 15:44:06] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-05-26 15:44:06] [INFO ] [Nat]Added 205 Read/Feed constraints in 89 ms returned sat
[2024-05-26 15:44:07] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 4 ms to minimize.
[2024-05-26 15:44:07] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 4 ms to minimize.
[2024-05-26 15:44:07] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 4 ms to minimize.
[2024-05-26 15:44:08] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 4 ms to minimize.
[2024-05-26 15:44:08] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 4 ms to minimize.
[2024-05-26 15:44:08] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 3 ms to minimize.
[2024-05-26 15:44:08] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 3 ms to minimize.
[2024-05-26 15:44:09] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 4 ms to minimize.
[2024-05-26 15:44:09] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 4 ms to minimize.
[2024-05-26 15:44:09] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 4 ms to minimize.
[2024-05-26 15:44:10] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 4 ms to minimize.
[2024-05-26 15:44:10] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 4 ms to minimize.
[2024-05-26 15:44:10] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 4 ms to minimize.
[2024-05-26 15:44:11] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 4 ms to minimize.
[2024-05-26 15:44:11] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 4 ms to minimize.
[2024-05-26 15:44:11] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 3 ms to minimize.
[2024-05-26 15:44:11] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 4 ms to minimize.
[2024-05-26 15:44:12] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 4 ms to minimize.
[2024-05-26 15:44:12] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 3 ms to minimize.
[2024-05-26 15:44:12] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 4 ms to minimize.
[2024-05-26 15:44:13] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 4 ms to minimize.
[2024-05-26 15:44:13] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 4 ms to minimize.
[2024-05-26 15:44:13] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 4 ms to minimize.
[2024-05-26 15:44:14] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 4 ms to minimize.
[2024-05-26 15:44:14] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 4 ms to minimize.
[2024-05-26 15:44:14] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 4 ms to minimize.
[2024-05-26 15:44:14] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 4 ms to minimize.
[2024-05-26 15:44:15] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 4 ms to minimize.
[2024-05-26 15:44:15] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 4 ms to minimize.
[2024-05-26 15:44:15] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 4 ms to minimize.
[2024-05-26 15:44:16] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 4 ms to minimize.
[2024-05-26 15:44:16] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 3 ms to minimize.
[2024-05-26 15:44:16] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 5 ms to minimize.
[2024-05-26 15:44:18] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 3 ms to minimize.
[2024-05-26 15:44:18] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 4 ms to minimize.
[2024-05-26 15:44:18] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2024-05-26 15:44:18] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 3 ms to minimize.
[2024-05-26 15:44:18] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 3 ms to minimize.
[2024-05-26 15:44:19] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 4 ms to minimize.
[2024-05-26 15:44:19] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 4 ms to minimize.
[2024-05-26 15:44:19] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 4 ms to minimize.
[2024-05-26 15:44:20] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 4 ms to minimize.
[2024-05-26 15:44:21] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 4 ms to minimize.
[2024-05-26 15:44:22] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 4 ms to minimize.
[2024-05-26 15:44:22] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 4 ms to minimize.
[2024-05-26 15:44:22] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2024-05-26 15:44:22] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 4 ms to minimize.
[2024-05-26 15:44:24] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 4 ms to minimize.
[2024-05-26 15:44:24] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-26 15:44:24] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 4 ms to minimize.
[2024-05-26 15:44:24] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 4 ms to minimize.
[2024-05-26 15:44:25] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 3 ms to minimize.
[2024-05-26 15:44:25] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2024-05-26 15:44:25] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 4 ms to minimize.
[2024-05-26 15:44:25] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 3 ms to minimize.
[2024-05-26 15:44:26] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 3 ms to minimize.
[2024-05-26 15:44:27] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 3 ms to minimize.
[2024-05-26 15:44:27] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 4 ms to minimize.
[2024-05-26 15:44:28] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-26 15:44:29] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 3 ms to minimize.
[2024-05-26 15:44:29] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 4 ms to minimize.
[2024-05-26 15:44:29] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 4 ms to minimize.
[2024-05-26 15:44:30] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-05-26 15:44:30] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2024-05-26 15:44:31] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2024-05-26 15:44:32] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2024-05-26 15:44:34] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-26 15:44:35] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 3 ms to minimize.
[2024-05-26 15:44:35] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 3 ms to minimize.
[2024-05-26 15:44:35] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 3 ms to minimize.
[2024-05-26 15:44:35] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2024-05-26 15:44:36] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
[2024-05-26 15:44:36] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-05-26 15:44:36] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
[2024-05-26 15:44:36] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-05-26 15:44:37] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2024-05-26 15:44:37] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 4 ms to minimize.
[2024-05-26 15:44:37] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 3 ms to minimize.
[2024-05-26 15:44:38] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 4 ms to minimize.
[2024-05-26 15:44:38] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 4 ms to minimize.
[2024-05-26 15:44:39] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 4 ms to minimize.
[2024-05-26 15:44:39] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 4 ms to minimize.
[2024-05-26 15:44:39] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-26 15:44:40] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 3 ms to minimize.
[2024-05-26 15:44:40] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 3 ms to minimize.
[2024-05-26 15:44:40] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-26 15:44:40] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
[2024-05-26 15:44:41] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 3 ms to minimize.
[2024-05-26 15:44:41] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 4 ms to minimize.
[2024-05-26 15:44:41] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 3 ms to minimize.
[2024-05-26 15:44:42] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 5 ms to minimize.
[2024-05-26 15:44:42] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 3 ms to minimize.
[2024-05-26 15:44:43] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 3 ms to minimize.
[2024-05-26 15:44:43] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-05-26 15:44:43] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 3 ms to minimize.
[2024-05-26 15:44:43] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 4 ms to minimize.
[2024-05-26 15:44:44] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 5 ms to minimize.
[2024-05-26 15:44:44] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-26 15:44:44] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-26 15:44:44] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-05-26 15:44:45] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-05-26 15:44:45] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2024-05-26 15:44:46] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-05-26 15:44:46] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
[2024-05-26 15:44:46] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-26 15:44:46] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-26 15:44:47] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-26 15:44:49] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-26 15:44:49] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-26 15:44:49] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-26 15:44:50] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-26 15:44:51] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-26 15:44:51] [INFO ] Trap strengthening (SAT) tested/added 112/112 trap constraints in 44551 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 21 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 270/270 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 19 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2024-05-26 15:44:51] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:44:51] [INFO ] Invariant cache hit.
[2024-05-26 15:44:51] [INFO ] Implicit Places using invariants in 358 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 362 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 264/270 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 2 iterations and 405 ms. Remains : 264/270 places, 678/678 transitions.
[2024-05-26 15:44:51] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2024-05-26 15:44:51] [INFO ] Computed 17 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1920 ms. (520 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 599 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-26 15:44:54] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:44:54] [INFO ] Invariant cache hit.
[2024-05-26 15:44:54] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-26 15:44:54] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-05-26 15:44:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:44:54] [INFO ] [Real]Added 205 Read/Feed constraints in 33 ms returned sat
[2024-05-26 15:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 15:44:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-26 15:44:55] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2024-05-26 15:44:55] [INFO ] [Nat]Added 205 Read/Feed constraints in 70 ms returned sat
[2024-05-26 15:44:55] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 3 ms to minimize.
[2024-05-26 15:44:55] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2024-05-26 15:44:56] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 3 ms to minimize.
[2024-05-26 15:44:56] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 4 ms to minimize.
[2024-05-26 15:44:56] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 4 ms to minimize.
[2024-05-26 15:44:56] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 4 ms to minimize.
[2024-05-26 15:44:57] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 4 ms to minimize.
[2024-05-26 15:44:57] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 4 ms to minimize.
[2024-05-26 15:44:57] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 4 ms to minimize.
[2024-05-26 15:44:58] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 4 ms to minimize.
[2024-05-26 15:44:58] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 4 ms to minimize.
[2024-05-26 15:44:58] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 4 ms to minimize.
[2024-05-26 15:44:59] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 4 ms to minimize.
[2024-05-26 15:44:59] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 4 ms to minimize.
[2024-05-26 15:44:59] [INFO ] Deduced a trap composed of 35 places in 266 ms of which 4 ms to minimize.
[2024-05-26 15:44:59] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 4 ms to minimize.
[2024-05-26 15:45:00] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 4 ms to minimize.
[2024-05-26 15:45:00] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2024-05-26 15:45:00] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 3 ms to minimize.
[2024-05-26 15:45:01] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 4 ms to minimize.
[2024-05-26 15:45:01] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 4 ms to minimize.
[2024-05-26 15:45:01] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 4 ms to minimize.
[2024-05-26 15:45:01] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 4 ms to minimize.
[2024-05-26 15:45:02] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 3 ms to minimize.
[2024-05-26 15:45:02] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 3 ms to minimize.
[2024-05-26 15:45:02] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 3 ms to minimize.
[2024-05-26 15:45:03] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 4 ms to minimize.
[2024-05-26 15:45:03] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 4 ms to minimize.
[2024-05-26 15:45:03] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 4 ms to minimize.
[2024-05-26 15:45:03] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 4 ms to minimize.
[2024-05-26 15:45:04] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 4 ms to minimize.
[2024-05-26 15:45:04] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 4 ms to minimize.
[2024-05-26 15:45:04] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 3 ms to minimize.
[2024-05-26 15:45:04] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 4 ms to minimize.
[2024-05-26 15:45:05] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 4 ms to minimize.
[2024-05-26 15:45:05] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 3 ms to minimize.
[2024-05-26 15:45:06] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-05-26 15:45:06] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 3 ms to minimize.
[2024-05-26 15:45:06] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
[2024-05-26 15:45:06] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-26 15:45:07] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2024-05-26 15:45:07] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-05-26 15:45:07] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-05-26 15:45:08] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-26 15:45:08] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 4 ms to minimize.
[2024-05-26 15:45:09] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 3 ms to minimize.
[2024-05-26 15:45:09] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 3 ms to minimize.
[2024-05-26 15:45:09] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 4 ms to minimize.
[2024-05-26 15:45:09] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 3 ms to minimize.
[2024-05-26 15:45:10] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2024-05-26 15:45:10] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 4 ms to minimize.
[2024-05-26 15:45:10] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 3 ms to minimize.
[2024-05-26 15:45:11] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-05-26 15:45:11] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-05-26 15:45:11] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2024-05-26 15:45:11] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 3 ms to minimize.
[2024-05-26 15:45:12] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-05-26 15:45:12] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-05-26 15:45:13] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 4 ms to minimize.
[2024-05-26 15:45:13] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-05-26 15:45:13] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-26 15:45:14] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
[2024-05-26 15:45:15] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-05-26 15:45:16] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 4 ms to minimize.
[2024-05-26 15:45:16] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
[2024-05-26 15:45:17] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 4 ms to minimize.
[2024-05-26 15:45:17] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
[2024-05-26 15:45:17] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 3 ms to minimize.
[2024-05-26 15:45:17] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 4 ms to minimize.
[2024-05-26 15:45:18] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 3 ms to minimize.
[2024-05-26 15:45:18] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 3 ms to minimize.
[2024-05-26 15:45:18] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2024-05-26 15:45:19] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 3 ms to minimize.
[2024-05-26 15:45:19] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 4 ms to minimize.
[2024-05-26 15:45:19] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 4 ms to minimize.
[2024-05-26 15:45:20] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 3 ms to minimize.
[2024-05-26 15:45:20] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 4 ms to minimize.
[2024-05-26 15:45:20] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 4 ms to minimize.
[2024-05-26 15:45:21] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 3 ms to minimize.
[2024-05-26 15:45:21] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 3 ms to minimize.
[2024-05-26 15:45:21] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 3 ms to minimize.
[2024-05-26 15:45:22] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-05-26 15:45:22] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 4 ms to minimize.
[2024-05-26 15:45:22] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 3 ms to minimize.
[2024-05-26 15:45:22] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-05-26 15:45:23] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 3 ms to minimize.
[2024-05-26 15:45:23] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-05-26 15:45:23] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
[2024-05-26 15:45:23] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-05-26 15:45:23] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-05-26 15:45:24] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-05-26 15:45:24] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-05-26 15:45:24] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-05-26 15:45:25] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 4 ms to minimize.
[2024-05-26 15:45:25] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 4 ms to minimize.
[2024-05-26 15:45:26] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-05-26 15:45:26] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-26 15:45:26] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
[2024-05-26 15:45:26] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-26 15:45:26] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-05-26 15:45:27] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-26 15:45:27] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 4 ms to minimize.
[2024-05-26 15:45:27] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
[2024-05-26 15:45:27] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-05-26 15:45:28] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-05-26 15:45:28] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 4 ms to minimize.
[2024-05-26 15:45:30] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 4 ms to minimize.
[2024-05-26 15:45:30] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 3 ms to minimize.
[2024-05-26 15:45:30] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2024-05-26 15:45:32] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-26 15:45:33] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
[2024-05-26 15:45:34] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
[2024-05-26 15:45:34] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-05-26 15:45:34] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-05-26 15:45:35] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 4 ms to minimize.
[2024-05-26 15:45:36] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2024-05-26 15:45:36] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2024-05-26 15:45:39] [INFO ] Trap strengthening (SAT) tested/added 117/117 trap constraints in 44576 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
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 13 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 14 ms. Remains : 264/264 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 12 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2024-05-26 15:45:39] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:45:39] [INFO ] Invariant cache hit.
[2024-05-26 15:45:40] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-26 15:45:40] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:45:40] [INFO ] Invariant cache hit.
[2024-05-26 15:45:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:45:41] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2024-05-26 15:45:41] [INFO ] Redundant transitions in 71 ms returned []
Running 672 sub problems to find dead transitions.
[2024-05-26 15:45:41] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:45:41] [INFO ] Invariant cache hit.
[2024-05-26 15:45:42] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-26 15:45:49] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 5 ms to minimize.
[2024-05-26 15:45:49] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 5 ms to minimize.
[2024-05-26 15:45:49] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 4 ms to minimize.
[2024-05-26 15:45:50] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 4 ms to minimize.
[2024-05-26 15:45:50] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 4 ms to minimize.
[2024-05-26 15:45:50] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 4 ms to minimize.
[2024-05-26 15:45:50] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 4 ms to minimize.
[2024-05-26 15:45:51] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 4 ms to minimize.
[2024-05-26 15:45:51] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 4 ms to minimize.
[2024-05-26 15:45:51] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 5 ms to minimize.
[2024-05-26 15:45:52] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 3 ms to minimize.
[2024-05-26 15:45:52] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 3 ms to minimize.
[2024-05-26 15:45:52] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 3 ms to minimize.
[2024-05-26 15:45:52] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 3 ms to minimize.
[2024-05-26 15:45:53] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 4 ms to minimize.
[2024-05-26 15:45:53] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 4 ms to minimize.
[2024-05-26 15:45:53] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 4 ms to minimize.
[2024-05-26 15:45:54] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 4 ms to minimize.
[2024-05-26 15:45:54] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 4 ms to minimize.
[2024-05-26 15:45:54] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-26 15:45:55] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 4 ms to minimize.
[2024-05-26 15:45:55] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 4 ms to minimize.
[2024-05-26 15:45:55] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 4 ms to minimize.
[2024-05-26 15:45:55] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 4 ms to minimize.
[2024-05-26 15:45:56] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 3 ms to minimize.
[2024-05-26 15:45:56] [INFO ] Deduced a trap composed of 11 places in 306 ms of which 4 ms to minimize.
[2024-05-26 15:45:56] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 4 ms to minimize.
[2024-05-26 15:45:57] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 4 ms to minimize.
[2024-05-26 15:45:57] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 4 ms to minimize.
[2024-05-26 15:45:57] [INFO ] Deduced a trap composed of 54 places in 241 ms of which 4 ms to minimize.
[2024-05-26 15:45:58] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 4 ms to minimize.
[2024-05-26 15:45:58] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 4 ms to minimize.
[2024-05-26 15:45:58] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 4 ms to minimize.
[2024-05-26 15:45:58] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 3 ms to minimize.
[2024-05-26 15:45:59] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 3 ms to minimize.
[2024-05-26 15:45:59] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 4 ms to minimize.
[2024-05-26 15:45:59] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 3 ms to minimize.
[2024-05-26 15:45:59] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 4 ms to minimize.
[2024-05-26 15:46:00] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 3 ms to minimize.
[2024-05-26 15:46:00] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-26 15:46:01] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 4 ms to minimize.
[2024-05-26 15:46:01] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 4 ms to minimize.
[2024-05-26 15:46:01] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 4 ms to minimize.
[2024-05-26 15:46:01] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 3 ms to minimize.
[2024-05-26 15:46:02] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 4 ms to minimize.
[2024-05-26 15:46:02] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 3 ms to minimize.
[2024-05-26 15:46:02] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 3 ms to minimize.
[2024-05-26 15:46:02] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 3 ms to minimize.
[2024-05-26 15:46:03] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 4 ms to minimize.
[2024-05-26 15:46:03] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 3 ms to minimize.
[2024-05-26 15:46:03] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2024-05-26 15:46:03] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-26 15:46:04] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-05-26 15:46:04] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 4 ms to minimize.
[2024-05-26 15:46:04] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 3 ms to minimize.
[2024-05-26 15:46:04] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 4 ms to minimize.
[2024-05-26 15:46:05] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 4 ms to minimize.
[2024-05-26 15:46:05] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-05-26 15:46:05] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 3 ms to minimize.
[2024-05-26 15:46:05] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-26 15:46:12] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 2 ms to minimize.
[2024-05-26 15:46:12] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 3 ms to minimize.
SMT process timed out in 30681ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 30725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32675 ms. Remains : 264/264 places, 678/678 transitions.
RANDOM walk for 40000 steps (8 resets) in 1205 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 385315 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 2
Probabilistic random walk after 385315 steps, saw 57527 distinct states, run finished after 3018 ms. (steps per millisecond=127 ) properties seen :0
[2024-05-26 15:46:16] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:46:16] [INFO ] Invariant cache hit.
[2024-05-26 15:46:16] [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 662 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-05-26 15:46:17] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-05-26 15:46:17] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 3 ms to minimize.
[2024-05-26 15:46:18] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-05-26 15:46:18] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 3 ms to minimize.
[2024-05-26 15:46:18] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-26 15:46:18] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 4 ms to minimize.
[2024-05-26 15:46:18] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 4 ms to minimize.
[2024-05-26 15:46:19] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 4 ms to minimize.
[2024-05-26 15:46:19] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 4 ms to minimize.
[2024-05-26 15:46:19] [INFO ] Deduced a trap composed of 59 places in 265 ms of which 4 ms to minimize.
[2024-05-26 15:46:20] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 4 ms to minimize.
[2024-05-26 15:46:20] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 4 ms to minimize.
[2024-05-26 15:46:20] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 4 ms to minimize.
[2024-05-26 15:46:20] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 4 ms to minimize.
[2024-05-26 15:46:21] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 3 ms to minimize.
[2024-05-26 15:46:21] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 4 ms to minimize.
[2024-05-26 15:46:21] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 4 ms to minimize.
[2024-05-26 15:46:21] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 4 ms to minimize.
[2024-05-26 15:46:22] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 4 ms to minimize.
SMT process timed out in 5863ms, After SMT, problems are : Problem set: 0 solved, 2 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 38 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 39 ms. Remains : 264/264 places, 678/678 transitions.
RANDOM walk for 40000 steps (8 resets) in 430 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 444458 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 2
Probabilistic random walk after 444458 steps, saw 66137 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-05-26 15:46:25] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:46:25] [INFO ] Invariant cache hit.
[2024-05-26 15:46:25] [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 595 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-05-26 15:46:26] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
[2024-05-26 15:46:27] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 3 ms to minimize.
[2024-05-26 15:46:27] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-05-26 15:46:27] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 4 ms to minimize.
[2024-05-26 15:46:27] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 4 ms to minimize.
[2024-05-26 15:46:27] [INFO ] Deduced a trap composed of 46 places in 289 ms of which 4 ms to minimize.
[2024-05-26 15:46:28] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 4 ms to minimize.
[2024-05-26 15:46:28] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 2 ms to minimize.
[2024-05-26 15:46:28] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2024-05-26 15:46:28] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 2 ms to minimize.
[2024-05-26 15:46:29] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-05-26 15:46:29] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 2 ms to minimize.
[2024-05-26 15:46:29] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 4 ms to minimize.
[2024-05-26 15:46:29] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 3 ms to minimize.
[2024-05-26 15:46:29] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 4 ms to minimize.
[2024-05-26 15:46:30] [INFO ] Deduced a trap composed of 38 places in 274 ms of which 4 ms to minimize.
[2024-05-26 15:46:30] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 4 ms to minimize.
[2024-05-26 15:46:30] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 4 ms to minimize.
[2024-05-26 15:46:31] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 4 ms to minimize.
[2024-05-26 15:46:31] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/822 variables, 20/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:46:31] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 4 ms to minimize.
[2024-05-26 15:46:32] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 4 ms to minimize.
[2024-05-26 15:46:32] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-26 15:46:32] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 4 ms to minimize.
[2024-05-26 15:46:32] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 3 ms to minimize.
[2024-05-26 15:46:33] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-05-26 15:46:33] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 3 ms to minimize.
[2024-05-26 15:46:33] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2024-05-26 15:46:33] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 4 ms to minimize.
[2024-05-26 15:46:34] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 4 ms to minimize.
[2024-05-26 15:46:34] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 4 ms to minimize.
[2024-05-26 15:46:34] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-05-26 15:46:34] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 4 ms to minimize.
[2024-05-26 15:46:35] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
[2024-05-26 15:46:35] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 3 ms to minimize.
[2024-05-26 15:46:35] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 3 ms to minimize.
[2024-05-26 15:46:35] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 4 ms to minimize.
[2024-05-26 15:46:36] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 4 ms to minimize.
[2024-05-26 15:46:36] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 2 ms to minimize.
[2024-05-26 15:46:36] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 20/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 15:46:36] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2024-05-26 15:46:37] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 3 ms to minimize.
[2024-05-26 15:46:37] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 4 ms to minimize.
[2024-05-26 15:46:37] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 4 ms to minimize.
[2024-05-26 15:46:37] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 4 ms to minimize.
[2024-05-26 15:46:38] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-05-26 15:46:38] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-05-26 15:46:38] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 4 ms to minimize.
[2024-05-26 15:46:38] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 4 ms to minimize.
[2024-05-26 15:46:38] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 3 ms to minimize.
[2024-05-26 15:46:39] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 4 ms to minimize.
[2024-05-26 15:46:39] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 3 ms to minimize.
[2024-05-26 15:46:39] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2024-05-26 15:46:39] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-05-26 15:46:40] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-05-26 15:46:40] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 4 ms to minimize.
[2024-05-26 15:46:40] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 3 ms to minimize.
[2024-05-26 15:46:40] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 3 ms to minimize.
[2024-05-26 15:46:41] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-26 15:46:41] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 20/548 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 15:46:41] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-26 15:46:41] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-26 15:46:41] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 2 ms to minimize.
[2024-05-26 15:46:41] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 3 ms to minimize.
[2024-05-26 15:46:42] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-05-26 15:46:42] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-05-26 15:46:42] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 3 ms to minimize.
[2024-05-26 15:46:42] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 4 ms to minimize.
[2024-05-26 15:46:43] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 4 ms to minimize.
[2024-05-26 15:46:43] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 3 ms to minimize.
[2024-05-26 15:46:43] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 3 ms to minimize.
[2024-05-26 15:46:44] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 3 ms to minimize.
[2024-05-26 15:46:44] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 3 ms to minimize.
[2024-05-26 15:46:44] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 3 ms to minimize.
[2024-05-26 15:46:44] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-05-26 15:46:44] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 3 ms to minimize.
[2024-05-26 15:46:45] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-05-26 15:46:45] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 2 ms to minimize.
[2024-05-26 15:46:45] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-26 15:46:45] [INFO ] Deduced a trap composed of 45 places in 121 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-05-26 15:46:45] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-26 15:46:46] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-05-26 15:46:46] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-05-26 15:46:46] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
[2024-05-26 15:46:46] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-26 15:46:46] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2024-05-26 15:46:47] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-05-26 15:46:47] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 3 ms to minimize.
[2024-05-26 15:46:47] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-26 15:46:47] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-26 15:46:47] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-26 15:46:48] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2024-05-26 15:46:48] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 2 ms to minimize.
[2024-05-26 15:46:48] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 3 ms to minimize.
[2024-05-26 15:46:48] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 3 ms to minimize.
[2024-05-26 15:46:49] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 2 ms to minimize.
[2024-05-26 15:46:49] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 4 ms to minimize.
[2024-05-26 15:46:49] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 4 ms to minimize.
[2024-05-26 15:46:49] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-05-26 15:46:50] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 20/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 15:46:50] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 3 ms to minimize.
[2024-05-26 15:46:50] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-26 15:46:50] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-05-26 15:46:51] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-26 15:46:51] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 3 ms to minimize.
[2024-05-26 15:46:51] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 3 ms to minimize.
[2024-05-26 15:46:51] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-26 15:46:53] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-26 15:46:53] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-26 15:46:53] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-26 15:46:54] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-26 15:46:55] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-05-26 15:46:55] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-26 15:46:55] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-05-26 15:46:55] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
[2024-05-26 15:46:55] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-05-26 15:46:56] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 3 ms to minimize.
[2024-05-26 15:46:56] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-05-26 15:46:56] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 4 ms to minimize.
[2024-05-26 15:46:56] [INFO ] Deduced a trap composed of 58 places in 188 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-05-26 15:46:57] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 3 ms to minimize.
[2024-05-26 15:46:57] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2024-05-26 15:46:57] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 3 ms to minimize.
[2024-05-26 15:46:57] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 3 ms to minimize.
[2024-05-26 15:46:58] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 3 ms to minimize.
[2024-05-26 15:46:58] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 4 ms to minimize.
[2024-05-26 15:46:58] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-05-26 15:47:00] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-05-26 15:47:00] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-26 15:47:01] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2024-05-26 15:47:01] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-26 15:47:04] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 4 ms to minimize.
[2024-05-26 15:47:04] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 4 ms to minimize.
[2024-05-26 15:47:05] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 4 ms to minimize.
[2024-05-26 15:47:05] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-05-26 15:47:05] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-26 15:47:06] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/822 variables, and 625 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45005 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: 137/137 constraints]
After SMT, in 45614ms 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 17 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 18 ms. Remains : 264/264 places, 678/678 transitions.
RANDOM walk for 40000 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 668542 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 668542 steps, saw 98218 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-26 15:47:14] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-05-26 15:47:14] [INFO ] Invariant cache hit.
[2024-05-26 15:47:14] [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 410 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-05-26 15:47:14] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
[2024-05-26 15:47:15] [INFO ] Deduced a trap composed of 48 places in 111 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-05-26 15:47:15] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 3 ms to minimize.
[2024-05-26 15:47:15] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 4 ms to minimize.
[2024-05-26 15:47:16] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 3 ms to minimize.
[2024-05-26 15:47:16] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 3 ms to minimize.
[2024-05-26 15:47:16] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 3 ms to minimize.
[2024-05-26 15:47:16] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 2 ms to minimize.
[2024-05-26 15:47:17] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 2 ms to minimize.
[2024-05-26 15:47:17] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-26 15:47:17] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-05-26 15:47:17] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 3 ms to minimize.
[2024-05-26 15:47:17] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 2 ms to minimize.
[2024-05-26 15:47:18] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2024-05-26 15:47:18] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-05-26 15:47:18] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-05-26 15:47:18] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-05-26 15:47:18] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-26 15:47:18] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-05-26 15:47:19] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 3 ms to minimize.
[2024-05-26 15:47:19] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 4 ms to minimize.
[2024-05-26 15:47:19] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 20/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:19] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-05-26 15:47:20] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 3 ms to minimize.
[2024-05-26 15:47:20] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2024-05-26 15:47:20] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 4 ms to minimize.
[2024-05-26 15:47:21] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 4 ms to minimize.
[2024-05-26 15:47:21] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 3 ms to minimize.
[2024-05-26 15:47:21] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 4 ms to minimize.
[2024-05-26 15:47:21] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 3 ms to minimize.
[2024-05-26 15:47:22] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-05-26 15:47:22] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
[2024-05-26 15:47:22] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 3 ms to minimize.
[2024-05-26 15:47:22] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 3 ms to minimize.
[2024-05-26 15:47:23] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 4 ms to minimize.
[2024-05-26 15:47:23] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 3 ms to minimize.
[2024-05-26 15:47:23] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 3 ms to minimize.
[2024-05-26 15:47:23] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 3 ms to minimize.
[2024-05-26 15:47:24] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 3 ms to minimize.
[2024-05-26 15:47:24] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 4 ms to minimize.
[2024-05-26 15:47:24] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 4 ms to minimize.
[2024-05-26 15:47:24] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 20/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:25] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2024-05-26 15:47:25] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-26 15:47:25] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-26 15:47:25] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 3 ms to minimize.
[2024-05-26 15:47:26] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-05-26 15:47:26] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 4 ms to minimize.
[2024-05-26 15:47:26] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 3 ms to minimize.
[2024-05-26 15:47:26] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 3 ms to minimize.
[2024-05-26 15:47:26] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-26 15:47:27] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-05-26 15:47:27] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2024-05-26 15:47:27] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-05-26 15:47:27] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 3 ms to minimize.
[2024-05-26 15:47:27] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-05-26 15:47:28] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 4 ms to minimize.
[2024-05-26 15:47:28] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-05-26 15:47:28] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 2 ms to minimize.
[2024-05-26 15:47:28] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 2 ms to minimize.
[2024-05-26 15:47:29] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 3 ms to minimize.
[2024-05-26 15:47:29] [INFO ] Deduced a trap composed of 19 places in 229 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-05-26 15:47:29] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-26 15:47:29] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-05-26 15:47:29] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-26 15:47:30] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-26 15:47:30] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-05-26 15:47:30] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-05-26 15:47:30] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-26 15:47:31] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2024-05-26 15:47:31] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-05-26 15:47:31] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-26 15:47:31] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-05-26 15:47:31] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
[2024-05-26 15:47:32] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 3 ms to minimize.
[2024-05-26 15:47:32] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 3 ms to minimize.
[2024-05-26 15:47:32] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
[2024-05-26 15:47:32] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 3 ms to minimize.
[2024-05-26 15:47:32] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-05-26 15:47:33] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-05-26 15:47:33] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2024-05-26 15:47:35] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 20/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:35] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 3 ms to minimize.
[2024-05-26 15:47:35] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 3 ms to minimize.
[2024-05-26 15:47:35] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 3 ms to minimize.
[2024-05-26 15:47:36] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-05-26 15:47:36] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 3 ms to minimize.
[2024-05-26 15:47:36] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-26 15:47:36] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-26 15:47:36] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-05-26 15:47:37] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-05-26 15:47:37] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-05-26 15:47:38] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
[2024-05-26 15:47:38] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-26 15:47:38] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 4 ms to minimize.
[2024-05-26 15:47:38] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 4 ms to minimize.
[2024-05-26 15:47:39] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 4 ms to minimize.
[2024-05-26 15:47:39] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 4 ms to minimize.
[2024-05-26 15:47:39] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 3 ms to minimize.
[2024-05-26 15:47:40] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 3 ms to minimize.
[2024-05-26 15:47:40] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2024-05-26 15:47:40] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/822 variables, 20/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:40] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 3 ms to minimize.
[2024-05-26 15:47:40] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-26 15:47:41] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 3 ms to minimize.
[2024-05-26 15:47:41] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-05-26 15:47:41] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-05-26 15:47:42] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 3 ms to minimize.
[2024-05-26 15:47:42] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 3 ms to minimize.
[2024-05-26 15:47:42] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-05-26 15:47:42] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-26 15:47:42] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-26 15:47:42] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-26 15:47:43] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-26 15:47:43] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-26 15:47:43] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-05-26 15:47:44] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-05-26 15:47:44] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-26 15:47:44] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-05-26 15:47:45] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2024-05-26 15:47:45] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-26 15:47:45] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/822 variables, 20/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:46] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-26 15:47:46] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2024-05-26 15:47:46] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-26 15:47:46] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-05-26 15:47:46] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-05-26 15:47:47] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 3 ms to minimize.
[2024-05-26 15:47:47] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-05-26 15:47:47] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-26 15:47:47] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-26 15:47:48] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-26 15:47:48] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2024-05-26 15:47:48] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-26 15:47:51] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-26 15:47:51] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2024-05-26 15:47:52] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-26 15:47:52] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 3 ms to minimize.
[2024-05-26 15:47:52] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-26 15:47:52] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 3 ms to minimize.
[2024-05-26 15:47:53] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 3 ms to minimize.
[2024-05-26 15:47:53] [INFO ] Deduced a trap composed of 37 places in 212 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-05-26 15:47:53] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 3 ms to minimize.
[2024-05-26 15:47:53] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-05-26 15:47:54] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-05-26 15:47:54] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-26 15:47:54] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 3 ms to minimize.
[2024-05-26 15:47:54] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2024-05-26 15:47:54] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2024-05-26 15:47:55] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-26 15:47:55] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-26 15:47:55] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 4 ms to minimize.
[2024-05-26 15:47:55] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-05-26 15:47:56] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-26 15:47:57] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-26 15:47:57] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-26 15:47:58] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-26 15:47:58] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 822/822 variables, and 645 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47927 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: 158/158 constraints]
After SMT, in 48353ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Peterson-COL-5-UpperBounds-07 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 385301 ms.
ITS solved all properties within timeout
BK_STOP 1716738482621
--------------------
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="greatspnxred"
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 greatspnxred"
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 r267-smll-171654406000229"
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 ;