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-171654406000269.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-PT-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K 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-PT-4-UpperBounds-00
FORMULA_NAME Peterson-PT-4-UpperBounds-01
FORMULA_NAME Peterson-PT-4-UpperBounds-02
FORMULA_NAME Peterson-PT-4-UpperBounds-03
FORMULA_NAME Peterson-PT-4-UpperBounds-04
FORMULA_NAME Peterson-PT-4-UpperBounds-05
FORMULA_NAME Peterson-PT-4-UpperBounds-06
FORMULA_NAME Peterson-PT-4-UpperBounds-07
FORMULA_NAME Peterson-PT-4-UpperBounds-08
FORMULA_NAME Peterson-PT-4-UpperBounds-09
FORMULA_NAME Peterson-PT-4-UpperBounds-10
FORMULA_NAME Peterson-PT-4-UpperBounds-11
FORMULA_NAME Peterson-PT-4-UpperBounds-12
FORMULA_NAME Peterson-PT-4-UpperBounds-13
FORMULA_NAME Peterson-PT-4-UpperBounds-14
FORMULA_NAME Peterson-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716772902939

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 01:21:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 01:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:21:46] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2024-05-27 01:21:46] [INFO ] Transformed 480 places.
[2024-05-27 01:21:46] [INFO ] Transformed 690 transitions.
[2024-05-27 01:21:46] [INFO ] Found NUPN structural information;
[2024-05-27 01:21:46] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 577 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 24 ms.
Reduction of identical properties reduced properties to check from 16 to 15
FORMULA Peterson-PT-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[80, 5, 20, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[80, 5, 20, 100, 100, 1, 1, 1, 1, 1, 1, 1]
[2024-05-27 01:21:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-27 01:21:46] [INFO ] Computed 19 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[80, 5, 20, 100, 100, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 163 ms. (60 steps per ms)
FORMULA Peterson-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 254 ms. (235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 1, 5, 5, 3, 0] Max Struct:[80, 5, 20, 100, 100, 1]
[2024-05-27 01:21:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-27 01:21:46] [INFO ] Invariant cache hit.
[2024-05-27 01:21:47] [INFO ] [Real]Absence check using 14 positive place invariants in 31 ms returned unsat
[2024-05-27 01:21:47] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2024-05-27 01:21:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-27 01:21:48] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2024-05-27 01:21:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 01:21:48] [INFO ] [Real]Added 116 Read/Feed constraints in 53 ms returned sat
[2024-05-27 01:21:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:21:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2024-05-27 01:21:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-27 01:21:49] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2024-05-27 01:21:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 153 ms returned sat
[2024-05-27 01:21:49] [INFO ] Deduced a trap composed of 10 places in 460 ms of which 69 ms to minimize.
[2024-05-27 01:21:50] [INFO ] Deduced a trap composed of 32 places in 469 ms of which 7 ms to minimize.
[2024-05-27 01:21:50] [INFO ] Deduced a trap composed of 39 places in 365 ms of which 7 ms to minimize.
[2024-05-27 01:21:51] [INFO ] Deduced a trap composed of 61 places in 533 ms of which 8 ms to minimize.
[2024-05-27 01:21:52] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 8 ms to minimize.
[2024-05-27 01:21:52] [INFO ] Deduced a trap composed of 18 places in 342 ms of which 7 ms to minimize.
[2024-05-27 01:21:52] [INFO ] Deduced a trap composed of 33 places in 413 ms of which 7 ms to minimize.
[2024-05-27 01:21:53] [INFO ] Deduced a trap composed of 54 places in 430 ms of which 7 ms to minimize.
[2024-05-27 01:21:53] [INFO ] Deduced a trap composed of 40 places in 372 ms of which 6 ms to minimize.
[2024-05-27 01:21:53] [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-27 01:21:54] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned unsat
[2024-05-27 01:21:54] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned unsat
[2024-05-27 01:21:54] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-27 01:21:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 01:21:54] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2024-05-27 01:21:54] [INFO ] [Real]Added 116 Read/Feed constraints in 24 ms returned sat
[2024-05-27 01:21:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:21:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-27 01:21:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-27 01:21:55] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-27 01:21:55] [INFO ] [Nat]Added 116 Read/Feed constraints in 165 ms returned sat
[2024-05-27 01:21:55] [INFO ] Deduced a trap composed of 17 places in 444 ms of which 8 ms to minimize.
[2024-05-27 01:21:56] [INFO ] Deduced a trap composed of 44 places in 443 ms of which 6 ms to minimize.
[2024-05-27 01:21:56] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 5 ms to minimize.
[2024-05-27 01:21:57] [INFO ] Deduced a trap composed of 18 places in 354 ms of which 7 ms to minimize.
[2024-05-27 01:21:57] [INFO ] Deduced a trap composed of 21 places in 476 ms of which 9 ms to minimize.
[2024-05-27 01:21:57] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 5 ms to minimize.
[2024-05-27 01:21:58] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 4 ms to minimize.
[2024-05-27 01:21:58] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 5 ms to minimize.
[2024-05-27 01:21:59] [INFO ] Deduced a trap composed of 10 places in 439 ms of which 7 ms to minimize.
[2024-05-27 01:21:59] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 3 ms to minimize.
[2024-05-27 01:21:59] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 4 ms to minimize.
[2024-05-27 01:21:59] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 4 ms to minimize.
[2024-05-27 01:21:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 01:22:00] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2024-05-27 01:22:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 01:22:00] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2024-05-27 01:22:00] [INFO ] [Real]Added 116 Read/Feed constraints in 23 ms returned sat
[2024-05-27 01:22:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:22:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2024-05-27 01:22:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 01:22:01] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2024-05-27 01:22:01] [INFO ] [Nat]Added 116 Read/Feed constraints in 24 ms returned sat
[2024-05-27 01:22:01] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 85 ms.
Maximisation of solution failed !
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 1, 5, 5, 3, 0] Max Struct:[5, 5, 5, 5, 100, 1]
FORMULA Peterson-PT-4-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 3, 0] Max Struct:[5, 100, 1]
Support contains 106 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 480 transition count 611
Reduce places removed 79 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 158 rules applied. Total rules applied 237 place count 401 transition count 532
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 316 place count 322 transition count 532
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 316 place count 322 transition count 497
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 386 place count 287 transition count 497
Applied a total of 386 rules in 178 ms. Remains 287 /480 variables (removed 193) and now considering 497/690 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 287/480 places, 497/690 transitions.
[2024-05-27 01:22:05] [INFO ] Flow matrix only has 437 transitions (discarded 60 similar events)
// Phase 1: matrix 437 rows 287 cols
[2024-05-27 01:22:05] [INFO ] Computed 19 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 3, 0] Max Struct:[5, 100, 1]
RANDOM walk for 1000000 steps (2 resets) in 3041 ms. (328 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 3260 ms. (919 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 5, 0] Max Struct:[5, 100, 1]
[2024-05-27 01:22:12] [INFO ] Flow matrix only has 437 transitions (discarded 60 similar events)
[2024-05-27 01:22:12] [INFO ] Invariant cache hit.
[2024-05-27 01:22:12] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-05-27 01:22:12] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 01:22:12] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2024-05-27 01:22:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 01:22:12] [INFO ] [Real]Added 116 Read/Feed constraints in 28 ms returned sat
[2024-05-27 01:22:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:22:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-05-27 01:22:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 01:22:13] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-05-27 01:22:13] [INFO ] [Nat]Added 116 Read/Feed constraints in 55 ms returned sat
[2024-05-27 01:22:13] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 3 ms to minimize.
[2024-05-27 01:22:13] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:22:13] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 4 ms to minimize.
[2024-05-27 01:22:13] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 4 ms to minimize.
[2024-05-27 01:22:14] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 4 ms to minimize.
[2024-05-27 01:22:14] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 4 ms to minimize.
[2024-05-27 01:22:14] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 4 ms to minimize.
[2024-05-27 01:22:14] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 4 ms to minimize.
[2024-05-27 01:22:15] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 4 ms to minimize.
[2024-05-27 01:22:15] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 3 ms to minimize.
[2024-05-27 01:22:15] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 4 ms to minimize.
[2024-05-27 01:22:15] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 4 ms to minimize.
[2024-05-27 01:22:16] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 4 ms to minimize.
[2024-05-27 01:22:16] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 6 ms to minimize.
[2024-05-27 01:22:16] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 4 ms to minimize.
[2024-05-27 01:22:16] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 3 ms to minimize.
[2024-05-27 01:22:17] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 4 ms to minimize.
[2024-05-27 01:22:17] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 4 ms to minimize.
[2024-05-27 01:22:17] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2024-05-27 01:22:17] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 3 ms to minimize.
[2024-05-27 01:22:18] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 4 ms to minimize.
[2024-05-27 01:22:18] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 4 ms to minimize.
[2024-05-27 01:22:18] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 4 ms to minimize.
[2024-05-27 01:22:18] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 6 ms to minimize.
[2024-05-27 01:22:19] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 3 ms to minimize.
[2024-05-27 01:22:19] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 3 ms to minimize.
[2024-05-27 01:22:19] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 4 ms to minimize.
[2024-05-27 01:22:20] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 3 ms to minimize.
[2024-05-27 01:22:20] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 5 ms to minimize.
[2024-05-27 01:22:21] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 4 ms to minimize.
[2024-05-27 01:22:21] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 4 ms to minimize.
[2024-05-27 01:22:21] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 5 ms to minimize.
[2024-05-27 01:22:21] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 4 ms to minimize.
[2024-05-27 01:22:22] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 4 ms to minimize.
[2024-05-27 01:22:22] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 8 ms to minimize.
[2024-05-27 01:22:22] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 4 ms to minimize.
[2024-05-27 01:22:22] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 3 ms to minimize.
[2024-05-27 01:22:23] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 3 ms to minimize.
[2024-05-27 01:22:23] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 4 ms to minimize.
[2024-05-27 01:22:23] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 3 ms to minimize.
[2024-05-27 01:22:23] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-05-27 01:22:24] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 4 ms to minimize.
[2024-05-27 01:22:24] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 3 ms to minimize.
[2024-05-27 01:22:24] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 3 ms to minimize.
[2024-05-27 01:22:25] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 4 ms to minimize.
[2024-05-27 01:22:25] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 3 ms to minimize.
[2024-05-27 01:22:26] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:22:27] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 3 ms to minimize.
[2024-05-27 01:22:27] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-05-27 01:22:27] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 4 ms to minimize.
[2024-05-27 01:22:27] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 4 ms to minimize.
[2024-05-27 01:22:28] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 4 ms to minimize.
[2024-05-27 01:22:28] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
[2024-05-27 01:22:29] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 3 ms to minimize.
[2024-05-27 01:22:29] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:22:30] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-27 01:22:30] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:22:30] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:22:30] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2024-05-27 01:22:30] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:22:31] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 3 ms to minimize.
[2024-05-27 01:22:31] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 3 ms to minimize.
[2024-05-27 01:22:31] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 3 ms to minimize.
[2024-05-27 01:22:31] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:22:31] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 3 ms to minimize.
[2024-05-27 01:22:32] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 3 ms to minimize.
[2024-05-27 01:22:32] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-05-27 01:22:33] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:22:36] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 4 ms to minimize.
[2024-05-27 01:22:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 69 trap constraints in 24930 ms
[2024-05-27 01:22:38] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
[2024-05-27 01:22:38] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 01:22:38] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 01:22:38] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-05-27 01:22:38] [INFO ] [Real]Added 116 Read/Feed constraints in 24 ms returned sat
[2024-05-27 01:22:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:22:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2024-05-27 01:22:38] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-27 01:22:38] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-05-27 01:22:38] [INFO ] [Nat]Added 116 Read/Feed constraints in 25 ms returned sat
[2024-05-27 01:22:39] [INFO ] Computed and/alt/rep : 396/913/396 causal constraints (skipped 36 transitions) in 60 ms.
[2024-05-27 01:22:39] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 4 ms to minimize.
[2024-05-27 01:22:40] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 4 ms to minimize.
[2024-05-27 01:22:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 593 ms
[2024-05-27 01:22:40] [INFO ] Added : 53 causal constraints over 13 iterations in 1350 ms. Result :sat
Minimization took 303 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 5, 0] Max Struct:[1, 5, 1]
FORMULA Peterson-PT-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 287 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place TestIdentity_1_1_4) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 496/496 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 286 transition count 458
Reduce places removed 37 places and 1 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 249 transition count 457
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 74 place count 249 transition count 388
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 212 place count 180 transition count 388
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 250 place count 161 transition count 369
Applied a total of 250 rules in 83 ms. Remains 161 /287 variables (removed 126) and now considering 369/496 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 161/287 places, 369/496 transitions.
[2024-05-27 01:22:41] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
// Phase 1: matrix 309 rows 161 cols
[2024-05-27 01:22:41] [INFO ] Computed 19 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1633 ms. (611 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 578 ms. (1727 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:22:43] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-27 01:22:43] [INFO ] Invariant cache hit.
[2024-05-27 01:22:43] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 01:22:43] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 01:22:43] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-27 01:22:43] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-27 01:22:43] [INFO ] [Real]Added 115 Read/Feed constraints in 18 ms returned sat
[2024-05-27 01:22:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:22:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 01:22:43] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 01:22:43] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-27 01:22:43] [INFO ] [Nat]Added 115 Read/Feed constraints in 17 ms returned sat
[2024-05-27 01:22:43] [INFO ] Computed and/alt/rep : 268/779/268 causal constraints (skipped 36 transitions) in 37 ms.
[2024-05-27 01:22:44] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2024-05-27 01:22:44] [INFO ] Added : 46 causal constraints over 10 iterations in 553 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 369/369 transitions.
Applied a total of 0 rules in 23 ms. Remains 161 /161 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 161/161 places, 369/369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 369/369 transitions.
Applied a total of 0 rules in 20 ms. Remains 161 /161 variables (removed 0) and now considering 369/369 (removed 0) transitions.
[2024-05-27 01:22:44] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-27 01:22:44] [INFO ] Invariant cache hit.
[2024-05-27 01:22:44] [INFO ] Implicit Places using invariants in 346 ms returned [151, 152, 153, 154, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 349 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/161 places, 369/369 transitions.
Applied a total of 0 rules in 21 ms. Remains 156 /156 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 397 ms. Remains : 156/161 places, 369/369 transitions.
[2024-05-27 01:22:45] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
// Phase 1: matrix 309 rows 156 cols
[2024-05-27 01:22:45] [INFO ] Computed 14 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1656 ms. (603 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 446 ms. (2237 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:22:47] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-27 01:22:47] [INFO ] Invariant cache hit.
[2024-05-27 01:22:47] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 01:22:47] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-27 01:22:47] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-27 01:22:47] [INFO ] [Real]Added 115 Read/Feed constraints in 13 ms returned sat
[2024-05-27 01:22:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:22:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 01:22:47] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-27 01:22:47] [INFO ] [Nat]Added 115 Read/Feed constraints in 20 ms returned sat
[2024-05-27 01:22:47] [INFO ] Computed and/alt/rep : 268/779/268 causal constraints (skipped 36 transitions) in 40 ms.
[2024-05-27 01:22:47] [INFO ] Added : 6 causal constraints over 2 iterations in 129 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 369/369 transitions.
Applied a total of 0 rules in 19 ms. Remains 156 /156 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 156/156 places, 369/369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 369/369 transitions.
Applied a total of 0 rules in 15 ms. Remains 156 /156 variables (removed 0) and now considering 369/369 (removed 0) transitions.
[2024-05-27 01:22:47] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-27 01:22:47] [INFO ] Invariant cache hit.
[2024-05-27 01:22:48] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-27 01:22:48] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-27 01:22:48] [INFO ] Invariant cache hit.
[2024-05-27 01:22:48] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-27 01:22:48] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2024-05-27 01:22:48] [INFO ] Redundant transitions in 42 ms returned []
Running 364 sub problems to find dead transitions.
[2024-05-27 01:22:48] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-27 01:22:48] [INFO ] Invariant cache hit.
[2024-05-27 01:22:48] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 3 ms to minimize.
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 3 ms to minimize.
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:22:52] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 6 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 3 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-27 01:22:53] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:22:54] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:22:54] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-27 01:22:54] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:22:54] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:22:55] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-27 01:22:55] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-27 01:22:55] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:22:55] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-27 01:22:55] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:22:55] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-27 01:22:55] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:22:56] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 3 ms to minimize.
[2024-05-27 01:22:56] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:22:56] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-27 01:22:56] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-27 01:22:56] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-27 01:22:57] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:22:57] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:22:57] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:22:57] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-27 01:22:57] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-27 01:22:57] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-27 01:23:00] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-27 01:23:01] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 3 ms to minimize.
[2024-05-27 01:23:01] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:23:01] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:23:02] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2024-05-27 01:23:02] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-27 01:23:03] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-27 01:23:04] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:23:05] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-27 01:23:12] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 5 ms to minimize.
[2024-05-27 01:23:12] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 3 ms to minimize.
[2024-05-27 01:23:12] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:23:12] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:23:12] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:23:12] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:23:13] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 3 ms to minimize.
[2024-05-27 01:23:13] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:23:13] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:23:13] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-27 01:23:13] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-27 01:23:13] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-27 01:23:14] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-27 01:23:14] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-27 01:23:14] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-27 01:23:14] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-27 01:23:14] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-27 01:23:14] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-27 01:23:14] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-27 01:23:14] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
Problem TDEAD223 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 20/239 constraints. Problems are: Problem set: 1 solved, 363 unsolved
[2024-05-27 01:23:18] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:23:18] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:23:18] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:23:18] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:23:18] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-27 01:23:19] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/465 variables, and 245 constraints, problems are : Problem set: 1 solved, 363 unsolved in 30037 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 1 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/168 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 68/236 constraints. Problems are: Problem set: 1 solved, 363 unsolved
[2024-05-27 01:23:22] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-27 01:23:22] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/238 constraints. Problems are: Problem set: 1 solved, 363 unsolved
[2024-05-27 01:23:25] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/239 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 1/240 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/241 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 7/248 constraints. Problems are: Problem set: 1 solved, 363 unsolved
[2024-05-27 01:23:30] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:23:31] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-27 01:23:31] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:23:31] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:23:31] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-27 01:23:31] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-27 01:23:31] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:23:32] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
[2024-05-27 01:23:32] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-05-27 01:23:32] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:23:33] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
[2024-05-27 01:23:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-27 01:23:33] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:23:33] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:23:34] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:23:34] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:23:34] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:23:34] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:23:34] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:23:34] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 20/268 constraints. Problems are: Problem set: 1 solved, 363 unsolved
[2024-05-27 01:23:36] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 3 ms to minimize.
[2024-05-27 01:23:37] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:23:37] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:23:38] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:23:38] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 3 ms to minimize.
[2024-05-27 01:23:39] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:23:39] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:23:39] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:23:39] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 3 ms to minimize.
[2024-05-27 01:23:39] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:23:40] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:23:40] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:23:40] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:23:41] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-27 01:23:41] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:23:41] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 16/284 constraints. Problems are: Problem set: 1 solved, 363 unsolved
[2024-05-27 01:23:42] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:23:45] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:23:45] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:23:45] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:23:45] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:23:46] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:23:46] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:23:46] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 3 ms to minimize.
[2024-05-27 01:23:46] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 9/293 constraints. Problems are: Problem set: 1 solved, 363 unsolved
[2024-05-27 01:23:48] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/465 variables, and 294 constraints, problems are : Problem set: 1 solved, 363 unsolved in 30028 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 0/364 constraints, Known Traps: 124/124 constraints]
After SMT, in 60379ms problems are : Problem set: 1 solved, 363 unsolved
Search for dead transitions found 1 dead transitions in 60411ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/156 places, 368/369 transitions.
Applied a total of 0 rules in 25 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-27 01:23:49] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61548 ms. Remains : 156/156 places, 368/369 transitions.
[2024-05-27 01:23:49] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
// Phase 1: matrix 308 rows 156 cols
[2024-05-27 01:23:49] [INFO ] Computed 14 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1768 ms. (565 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 454 ms. (2197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:23:51] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:23:51] [INFO ] Invariant cache hit.
[2024-05-27 01:23:51] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 01:23:51] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-27 01:23:51] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-27 01:23:51] [INFO ] [Real]Added 114 Read/Feed constraints in 17 ms returned sat
[2024-05-27 01:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:23:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 01:23:52] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-27 01:23:52] [INFO ] [Nat]Added 114 Read/Feed constraints in 22 ms returned sat
[2024-05-27 01:23:52] [INFO ] Computed and/alt/rep : 267/773/267 causal constraints (skipped 36 transitions) in 43 ms.
[2024-05-27 01:23:52] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:23:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-27 01:23:52] [INFO ] Added : 50 causal constraints over 10 iterations in 546 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 15 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 156/156 places, 368/368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 13 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-27 01:23:52] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:23:52] [INFO ] Invariant cache hit.
[2024-05-27 01:23:53] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-27 01:23:53] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:23:53] [INFO ] Invariant cache hit.
[2024-05-27 01:23:53] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-27 01:23:53] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2024-05-27 01:23:53] [INFO ] Redundant transitions in 5 ms returned []
Running 363 sub problems to find dead transitions.
[2024-05-27 01:23:53] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:23:53] [INFO ] Invariant cache hit.
[2024-05-27 01:23:53] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:23:56] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-05-27 01:23:56] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:23:56] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:23:57] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-27 01:23:58] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:23:58] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-27 01:23:58] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:23:58] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:23:58] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-27 01:23:58] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-27 01:23:58] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-27 01:23:58] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:23:59] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:23:59] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:23:59] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:23:59] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-27 01:24:00] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-27 01:24:00] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:24:00] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-27 01:24:00] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-27 01:24:00] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:24:00] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:24:00] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 3 ms to minimize.
[2024-05-27 01:24:01] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
[2024-05-27 01:24:01] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:24:01] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-27 01:24:01] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:24:01] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:24:02] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:24:02] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 6 ms to minimize.
[2024-05-27 01:24:02] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-27 01:24:02] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:05] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-27 01:24:05] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 3 ms to minimize.
[2024-05-27 01:24:07] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:24:07] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 3 ms to minimize.
[2024-05-27 01:24:07] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-27 01:24:07] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:24:07] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:13] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:24:13] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:24:14] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:24:14] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:24:14] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:24:14] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:24:14] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-05-27 01:24:14] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:24:14] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:24:15] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:24:15] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-05-27 01:24:15] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:24:15] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:24:15] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:24:15] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 3 ms to minimize.
[2024-05-27 01:24:16] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-05-27 01:24:16] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:24:16] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:24:16] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-27 01:24:16] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:17] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:24:18] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-27 01:24:18] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:24:18] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:24:18] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-27 01:24:19] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:24:19] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:24:19] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 3 ms to minimize.
[2024-05-27 01:24:19] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-27 01:24:19] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-27 01:24:19] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-27 01:24:19] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:24:19] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:24:20] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:24:20] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:24:20] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:24:20] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-05-27 01:24:20] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:24:21] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:24:21] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/464 variables, and 257 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30022 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/114 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 78/246 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:25] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:24:26] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:24:27] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:24:27] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:24:27] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:29] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:24:30] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:24:31] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:33] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:24:34] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:24:34] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:42] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:24:43] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:24:43] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:24:44] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:24:44] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-27 01:24:44] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-27 01:24:44] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:24:44] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:24:45] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:24:45] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:24:45] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:24:45] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 4 ms to minimize.
[2024-05-27 01:24:46] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 13/281 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:49] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:24:50] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:24:51] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-27 01:24:51] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-27 01:24:51] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:24:51] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:24:53] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/464 variables, and 288 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/114 constraints, PredecessorRefiner: 0/363 constraints, Known Traps: 118/118 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61262 ms. Remains : 156/156 places, 368/368 transitions.
RANDOM walk for 40000 steps (8 resets) in 1121 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 819282 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 2
Probabilistic random walk after 819282 steps, saw 136944 distinct states, run finished after 3006 ms. (steps per millisecond=272 ) properties seen :0
[2024-05-27 01:24:57] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:24:57] [INFO ] Invariant cache hit.
[2024-05-27 01:24:57] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/88 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/172 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 160/332 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 107/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 72/404 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 72/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/408 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 56/464 variables, 76/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/464 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/464 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 296 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/88 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/172 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 160/332 variables, 32/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 32/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 107/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 72/404 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 01:24:58] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 3 ms to minimize.
[2024-05-27 01:24:58] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-27 01:24:58] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 3 ms to minimize.
[2024-05-27 01:24:58] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/404 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 4/408 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/408 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/408 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 56/464 variables, 76/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/464 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/464 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1222 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1527ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 15 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 156/156 places, 368/368 transitions.
RANDOM walk for 40000 steps (8 resets) in 428 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 680214 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 2
Probabilistic random walk after 680214 steps, saw 113793 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
[2024-05-27 01:25:02] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:25:02] [INFO ] Invariant cache hit.
[2024-05-27 01:25:02] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/88 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/172 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 160/332 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 107/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 72/404 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 72/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/408 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 56/464 variables, 76/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/464 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/464 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 419 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/88 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/172 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 160/332 variables, 32/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 32/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 107/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 72/404 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 01:25:03] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 2 ms to minimize.
[2024-05-27 01:25:03] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:25:03] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-27 01:25:03] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/404 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 4/408 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/408 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/408 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 56/464 variables, 76/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/464 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/464 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 968 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1397ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 11 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 156/156 places, 368/368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 12 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-27 01:25:03] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:25:04] [INFO ] Invariant cache hit.
[2024-05-27 01:25:04] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-27 01:25:04] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:25:04] [INFO ] Invariant cache hit.
[2024-05-27 01:25:04] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-27 01:25:05] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2024-05-27 01:25:05] [INFO ] Redundant transitions in 2 ms returned []
Running 363 sub problems to find dead transitions.
[2024-05-27 01:25:05] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:25:05] [INFO ] Invariant cache hit.
[2024-05-27 01:25:05] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:07] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 3 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:25:08] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:25:09] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:25:09] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:25:09] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:25:09] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:25:09] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:25:09] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:25:09] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 3 ms to minimize.
[2024-05-27 01:25:10] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:25:10] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-27 01:25:10] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:10] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-05-27 01:25:10] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:25:10] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:25:10] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:25:11] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:25:11] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:25:11] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:25:11] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-27 01:25:11] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-27 01:25:12] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:25:12] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:25:12] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:25:12] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 3 ms to minimize.
[2024-05-27 01:25:13] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-27 01:25:13] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:25:13] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:25:13] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:25:13] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-05-27 01:25:14] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-27 01:25:14] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:16] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-27 01:25:17] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:25:18] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-27 01:25:18] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:25:18] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-27 01:25:18] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:25:18] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 3 ms to minimize.
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-27 01:25:25] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:25:26] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:25:26] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 2 ms to minimize.
[2024-05-27 01:25:26] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-27 01:25:26] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:25:26] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:25:27] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 3 ms to minimize.
[2024-05-27 01:25:27] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:25:27] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:25:27] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:25:27] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:25:28] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:28] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:25:29] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-27 01:25:29] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:25:29] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-27 01:25:29] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:25:30] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:25:30] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:25:30] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:25:30] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-27 01:25:30] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-27 01:25:30] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-27 01:25:30] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:25:31] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:25:31] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:25:31] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-27 01:25:31] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:25:31] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:25:31] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:25:32] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:25:32] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/464 variables, and 257 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30016 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/114 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 78/246 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:36] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:25:37] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:25:38] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-05-27 01:25:39] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:25:39] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:41] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-27 01:25:42] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:25:42] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:44] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:25:45] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:25:45] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:52] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-27 01:25:53] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:25:53] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:25:53] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 2 ms to minimize.
[2024-05-27 01:25:53] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-27 01:25:54] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-27 01:25:54] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:25:54] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 3 ms to minimize.
[2024-05-27 01:25:55] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:25:55] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:25:55] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:25:55] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:25:55] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 13/281 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:25:58] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:26:00] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:26:00] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:26:00] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:26:00] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:26:00] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:03] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:26:05] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/464 variables, and 289 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/114 constraints, PredecessorRefiner: 0/363 constraints, Known Traps: 119/119 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61333 ms. Remains : 156/156 places, 368/368 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 277 edges and 156 vertex of which 99 / 156 are part of one of the 20 SCC in 6 ms
Free SCC test removed 79 places
Drop transitions (Empty/Sink Transition effects.) removed 158 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 237 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 77 transition count 112
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 58 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 56 place count 47 transition count 109
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 42 transition count 104
Graph (trivial) has 19 edges and 42 vertex of which 16 / 42 are part of one of the 4 SCC in 0 ms
Free SCC test removed 12 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 71 place count 26 transition count 104
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (trivial) has 67 edges and 26 vertex of which 16 / 26 are part of one of the 4 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 88 place count 14 transition count 88
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 163 place count 14 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 175 place count 6 transition count 9
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 4 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 179 place count 3 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 183 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 183 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 2 transition count 1
Applied a total of 185 rules in 41 ms. Remains 2 /156 variables (removed 154) and now considering 1/368 (removed 367) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1 rows 2 cols
[2024-05-27 01:26:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 01:26:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 01:26:05] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-27 01:26:05] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-27 01:26:05] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for Peterson-PT-4-UpperBounds-14
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:26:05] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
// Phase 1: matrix 308 rows 156 cols
[2024-05-27 01:26:05] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:26:05] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:26:05] [INFO ] Invariant cache hit.
[2024-05-27 01:26:05] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 01:26:05] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-27 01:26:05] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-27 01:26:05] [INFO ] [Real]Added 114 Read/Feed constraints in 17 ms returned sat
[2024-05-27 01:26:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:26:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-27 01:26:05] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-27 01:26:05] [INFO ] [Nat]Added 114 Read/Feed constraints in 14 ms returned sat
[2024-05-27 01:26:06] [INFO ] Computed and/alt/rep : 267/773/267 causal constraints (skipped 36 transitions) in 27 ms.
[2024-05-27 01:26:06] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-27 01:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-27 01:26:06] [INFO ] Added : 50 causal constraints over 10 iterations in 345 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 13 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 156/156 places, 368/368 transitions.
[2024-05-27 01:26:06] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:26:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1647 ms. (606 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 446 ms. (2237 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:26:08] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:26:08] [INFO ] Invariant cache hit.
[2024-05-27 01:26:08] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 01:26:08] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-27 01:26:08] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-27 01:26:08] [INFO ] [Real]Added 114 Read/Feed constraints in 14 ms returned sat
[2024-05-27 01:26:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:26:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 01:26:08] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-27 01:26:08] [INFO ] [Nat]Added 114 Read/Feed constraints in 14 ms returned sat
[2024-05-27 01:26:08] [INFO ] Computed and/alt/rep : 267/773/267 causal constraints (skipped 36 transitions) in 31 ms.
[2024-05-27 01:26:09] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-05-27 01:26:09] [INFO ] Added : 50 causal constraints over 10 iterations in 471 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 15 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 156/156 places, 368/368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 17 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-27 01:26:09] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:26:09] [INFO ] Invariant cache hit.
[2024-05-27 01:26:09] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-27 01:26:09] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:26:09] [INFO ] Invariant cache hit.
[2024-05-27 01:26:10] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-27 01:26:10] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
[2024-05-27 01:26:10] [INFO ] Redundant transitions in 3 ms returned []
Running 363 sub problems to find dead transitions.
[2024-05-27 01:26:10] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:26:10] [INFO ] Invariant cache hit.
[2024-05-27 01:26:10] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:13] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 3 ms to minimize.
[2024-05-27 01:26:13] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:26:13] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:26:13] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 3 ms to minimize.
[2024-05-27 01:26:13] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:26:14] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:26:14] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:26:14] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-05-27 01:26:14] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:26:14] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-27 01:26:14] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:26:14] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-27 01:26:14] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-27 01:26:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-27 01:26:15] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:26:15] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-27 01:26:15] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-27 01:26:15] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-27 01:26:15] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-27 01:26:15] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:15] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-27 01:26:16] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:26:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-27 01:26:16] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-27 01:26:16] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-27 01:26:16] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:26:16] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-27 01:26:16] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-27 01:26:17] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:26:17] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:26:17] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:26:17] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:26:17] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:26:18] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-27 01:26:18] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:26:18] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:26:18] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:26:19] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:26:19] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-27 01:26:19] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:21] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-27 01:26:22] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:26:23] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-27 01:26:23] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:26:23] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-27 01:26:24] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:26:24] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:30] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 2 ms to minimize.
[2024-05-27 01:26:30] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:26:30] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 3 ms to minimize.
[2024-05-27 01:26:30] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:26:30] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-27 01:26:30] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-27 01:26:30] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:26:31] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:26:31] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-27 01:26:31] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:26:31] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:26:31] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:26:31] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:26:32] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:26:32] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:26:32] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 3 ms to minimize.
[2024-05-27 01:26:32] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:26:33] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-27 01:26:33] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:26:33] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:34] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:26:34] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-27 01:26:34] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:26:35] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:26:35] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-27 01:26:35] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:26:35] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:26:35] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:26:35] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-27 01:26:35] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-27 01:26:35] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-27 01:26:36] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-27 01:26:36] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:26:36] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:26:36] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:26:36] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:26:36] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:26:37] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:26:37] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 3 ms to minimize.
[2024-05-27 01:26:38] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/464 variables, and 257 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30016 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/114 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 78/246 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:42] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:26:42] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:26:44] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-05-27 01:26:44] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:26:44] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:46] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:26:47] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:26:48] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:50] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:26:50] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 3 ms to minimize.
[2024-05-27 01:26:50] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:26:57] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:26:58] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:26:59] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 3 ms to minimize.
[2024-05-27 01:26:59] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 3 ms to minimize.
[2024-05-27 01:26:59] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-27 01:26:59] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-27 01:26:59] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-27 01:27:00] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:27:00] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:27:00] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:27:01] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:27:01] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:27:01] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 13/281 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:27:04] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:27:06] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:27:06] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-27 01:27:06] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 01:27:06] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:27:07] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-27 01:27:09] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/464 variables, and 288 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/114 constraints, PredecessorRefiner: 0/363 constraints, Known Traps: 118/118 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61204 ms. Remains : 156/156 places, 368/368 transitions.
RANDOM walk for 40000 steps (8 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 726690 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 2
Probabilistic random walk after 726690 steps, saw 121561 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2024-05-27 01:27:14] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:27:14] [INFO ] Invariant cache hit.
[2024-05-27 01:27:14] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/88 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/172 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 160/332 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 107/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 72/404 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 72/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/408 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 56/464 variables, 76/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/464 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/464 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 390 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/88 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/172 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 160/332 variables, 32/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 32/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 107/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 72/404 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 01:27:14] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 2 ms to minimize.
[2024-05-27 01:27:15] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-05-27 01:27:15] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 3 ms to minimize.
[2024-05-27 01:27:15] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/404 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 4/408 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/408 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/408 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 56/464 variables, 76/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/464 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/464 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1176 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1575ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 368/368 transitions.
Applied a total of 0 rules in 13 ms. Remains 156 /156 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 156/156 places, 368/368 transitions.
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 747720 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 2
Probabilistic random walk after 747720 steps, saw 125015 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
[2024-05-27 01:27:18] [INFO ] Flow matrix only has 308 transitions (discarded 60 similar events)
[2024-05-27 01:27:18] [INFO ] Invariant cache hit.
[2024-05-27 01:27:18] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/88 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/172 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 160/332 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 107/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 72/404 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 72/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/408 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 56/464 variables, 76/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/464 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/464 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 350 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/88 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/172 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 160/332 variables, 32/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 32/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 107/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 72/404 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 01:27:19] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 3 ms to minimize.
[2024-05-27 01:27:19] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-05-27 01:27:19] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:27:20] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/404 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 4/408 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/408 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/408 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 56/464 variables, 76/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/464 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/464 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1121 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1490ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 863 steps, including 269 resets, run visited all 2 properties in 14 ms. (steps per millisecond=61 )
Parikh walk visited 2 properties in 24 ms.
FORMULA Peterson-PT-4-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Peterson-PT-4-UpperBounds-14 in 74848 ms.
[2024-05-27 01:27:20] [INFO ] Flatten gal took : 142 ms
Total runtime 335211 ms.
ITS solved all properties within timeout

BK_STOP 1716773240834

--------------------
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-PT-4"
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-PT-4, 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-171654406000269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;