Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700261.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717253417519

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:50:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 14:50:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:50:19] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-06-01 14:50:19] [INFO ] Transformed 844 places.
[2024-06-01 14:50:19] [INFO ] Transformed 1812 transitions.
[2024-06-01 14:50:19] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 14:50:19] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-06-01 14:50:19] [INFO ] Computed 58 invariants in 109 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 10, 1, 1, +inf, 87, 1, +inf, +inf, 87, +inf]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 124 ms. (80 steps per ms)
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (30 resets) in 492 ms. (243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 10, +inf, 87, +inf, +inf, 87, +inf]
[2024-06-01 14:50:19] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-06-01 14:50:19] [INFO ] Invariant cache hit.
[2024-06-01 14:50:20] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-06-01 14:50:20] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 24 ms returned unsat
[2024-06-01 14:50:20] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-06-01 14:50:20] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 27 ms returned unsat
[2024-06-01 14:50:20] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 14:50:20] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned unsat
[2024-06-01 14:50:20] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-01 14:50:20] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned sat
[2024-06-01 14:50:23] [INFO ] [Real]Absence check using state equation in 2759 ms returned sat
[2024-06-01 14:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:50:23] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 27 ms returned sat
[2024-06-01 14:50:26] [INFO ] [Nat]Absence check using state equation in 2930 ms returned sat
[2024-06-01 14:50:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:50:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:50:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 1023 ms returned unknown
[2024-06-01 14:50:27] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-01 14:50:27] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 45 ms returned sat
[2024-06-01 14:50:29] [INFO ] [Real]Absence check using state equation in 1614 ms returned sat
[2024-06-01 14:50:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-06-01 14:50:29] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 45 ms returned sat
[2024-06-01 14:50:31] [INFO ] [Nat]Absence check using state equation in 2107 ms returned sat
[2024-06-01 14:50:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:50:32] [INFO ] [Nat]Added 120 Read/Feed constraints in 927 ms returned sat
[2024-06-01 14:50:33] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 257 ms.
[2024-06-01 14:50:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 14:50:34] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-01 14:50:34] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 5 ms returned unsat
[2024-06-01 14:50:35] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 14:50:35] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned sat
[2024-06-01 14:50:36] [INFO ] [Real]Absence check using state equation in 1207 ms returned sat
[2024-06-01 14:50:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:50:36] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 29 ms returned sat
[2024-06-01 14:50:38] [INFO ] [Nat]Absence check using state equation in 2099 ms returned unknown
[2024-06-01 14:50:38] [INFO ] [Real]Absence check using 13 positive place invariants in 31 ms returned sat
[2024-06-01 14:50:38] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 50 ms returned unsat
[2024-06-01 14:50:38] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-01 14:50:39] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned unsat
[2024-06-01 14:50:39] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 14:50:39] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 21 ms returned unsat
[2024-06-01 14:50:39] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 14:50:39] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 43 ms returned unsat
[2024-06-01 14:50:39] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 14:50:39] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 1, 1] Max Struct:[2, 1, 2, +inf, +inf, 1, +inf, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[+inf, +inf, +inf]
Support contains 31 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 417 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-06-01 14:50:40] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-06-01 14:50:40] [INFO ] Computed 56 invariants in 63 ms
[2024-06-01 14:50:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 25 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 3 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 44 places in 357 ms of which 1 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 1 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 2 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 3 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 186 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 332 places in 225 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1894 variables, and 69 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-06-01 14:51:15] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1894 variables, and 71 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 17/17 constraints]
After SMT, in 43880ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43930ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44382 ms. Remains : 552/844 places, 1362/1652 transitions.
[2024-06-01 14:51:23] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 15:26:21] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 15:26:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[200, 30, 360]
RANDOM walk for 1000000 steps (337 resets) in 6921 ms. (144 steps per ms)
BEST_FIRST walk for 3000002 steps (1102 resets) in 8821 ms. (340 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[200, 30, 360]
[2024-06-01 15:26:36] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 15:26:36] [INFO ] Invariant cache hit.
[2024-06-01 15:26:37] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 15:26:37] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 21 ms returned sat
[2024-06-01 15:26:38] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2024-06-01 15:26:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:26:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 15:26:38] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 28 ms returned sat
[2024-06-01 15:26:40] [INFO ] [Nat]Absence check using state equation in 1819 ms returned sat
[2024-06-01 15:26:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:26:41] [INFO ] [Nat]Added 120 Read/Feed constraints in 1048 ms returned sat
[2024-06-01 15:26:41] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:26:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 253 ms
[2024-06-01 15:26:41] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-06-01 15:26:41] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 44 ms returned sat
[2024-06-01 15:26:42] [INFO ] [Real]Absence check using state equation in 1010 ms returned sat
[2024-06-01 15:26:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:26:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:26:42] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 18 ms returned sat
[2024-06-01 15:26:43] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2024-06-01 15:26:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 784 ms returned sat
[2024-06-01 15:26:45] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 4 ms to minimize.
[2024-06-01 15:26:45] [INFO ] Deduced a trap composed of 207 places in 431 ms of which 4 ms to minimize.
[2024-06-01 15:26:45] [INFO ] Deduced a trap composed of 277 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:26:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1575 ms
[2024-06-01 15:26:46] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 155 ms.
[2024-06-01 15:26:47] [INFO ] Added : 25 causal constraints over 5 iterations in 901 ms. Result :sat
Minimization took 4693 ms.
[2024-06-01 15:26:51] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 15:26:51] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 26 ms returned sat
[2024-06-01 15:26:52] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2024-06-01 15:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:26:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-06-01 15:26:52] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 30 ms returned sat
[2024-06-01 15:26:53] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2024-06-01 15:26:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:27:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 9010 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[1, 30, 360]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[30, 360]
Support contains 11 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 70 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 552/552 places, 1362/1362 transitions.
[2024-06-01 15:27:02] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 15:27:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[30, 360]
RANDOM walk for 1000000 steps (376 resets) in 5906 ms. (169 steps per ms)
BEST_FIRST walk for 2000002 steps (252 resets) in 5141 ms. (388 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[30, 360]
[2024-06-01 15:27:14] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 15:27:14] [INFO ] Invariant cache hit.
[2024-06-01 15:27:14] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-06-01 15:27:14] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 24 ms returned sat
[2024-06-01 15:27:15] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2024-06-01 15:27:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:27:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:27:15] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 17 ms returned sat
[2024-06-01 15:27:16] [INFO ] [Nat]Absence check using state equation in 1199 ms returned sat
[2024-06-01 15:27:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:27:17] [INFO ] [Nat]Added 120 Read/Feed constraints in 522 ms returned sat
[2024-06-01 15:27:17] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 4 ms to minimize.
[2024-06-01 15:27:17] [INFO ] Deduced a trap composed of 207 places in 380 ms of which 4 ms to minimize.
[2024-06-01 15:27:18] [INFO ] Deduced a trap composed of 277 places in 295 ms of which 4 ms to minimize.
[2024-06-01 15:27:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1559 ms
[2024-06-01 15:27:18] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 151 ms.
[2024-06-01 15:27:19] [INFO ] Added : 25 causal constraints over 5 iterations in 909 ms. Result :sat
Minimization took 5581 ms.
[2024-06-01 15:27:25] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-06-01 15:27:25] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 28 ms returned sat
[2024-06-01 15:27:25] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2024-06-01 15:27:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:27:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:27:26] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 19 ms returned sat
[2024-06-01 15:27:27] [INFO ] [Nat]Absence check using state equation in 1029 ms returned sat
[2024-06-01 15:27:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:27:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 9015 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[30, 360]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[30, 360]
Support contains 11 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 71 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 41 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-06-01 15:27:36] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 15:27:36] [INFO ] Invariant cache hit.
[2024-06-01 15:27:37] [INFO ] Implicit Places using invariants in 804 ms returned [66, 133, 165, 292, 338, 367, 370, 408, 519, 550]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 811 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 1353
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 1353
Applied a total of 18 rules in 84 ms. Remains 533 /542 variables (removed 9) and now considering 1353/1362 (removed 9) transitions.
[2024-06-01 15:27:37] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2024-06-01 15:27:37] [INFO ] Computed 46 invariants in 70 ms
[2024-06-01 15:27:38] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2024-06-01 15:27:38] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:27:38] [INFO ] Invariant cache hit.
[2024-06-01 15:27:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:27:50] [INFO ] Implicit Places using invariants and state equation in 11965 ms returned []
Implicit Place search using SMT with State Equation took 13288 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 533/552 places, 1353/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14226 ms. Remains : 533/552 places, 1353/1362 transitions.
[2024-06-01 15:27:50] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:27:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[30, 360]
RANDOM walk for 1000000 steps (359 resets) in 5383 ms. (185 steps per ms)
BEST_FIRST walk for 2000000 steps (242 resets) in 5081 ms. (393 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[30, 360]
[2024-06-01 15:28:00] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:28:00] [INFO ] Invariant cache hit.
[2024-06-01 15:28:01] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:28:01] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 31 ms returned sat
[2024-06-01 15:28:01] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2024-06-01 15:28:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:28:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:28:02] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 30 ms returned sat
[2024-06-01 15:28:04] [INFO ] [Nat]Absence check using state equation in 2311 ms returned sat
[2024-06-01 15:28:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:28:06] [INFO ] [Nat]Added 120 Read/Feed constraints in 2175 ms returned sat
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:28:07] [INFO ] Deduced a trap composed of 226 places in 369 ms of which 3 ms to minimize.
[2024-06-01 15:28:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 769 ms
[2024-06-01 15:28:07] [INFO ] Computed and/alt/rep : 401/910/391 causal constraints (skipped 940 transitions) in 85 ms.
[2024-06-01 15:28:08] [INFO ] Added : 30 causal constraints over 6 iterations in 626 ms. Result :sat
Minimization took 5087 ms.
[2024-06-01 15:28:13] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:28:13] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 27 ms returned sat
[2024-06-01 15:28:14] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2024-06-01 15:28:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:28:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 15:28:14] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 17 ms returned sat
[2024-06-01 15:28:21] [INFO ] [Nat]Absence check using state equation in 7829 ms returned sat
[2024-06-01 15:28:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 1167 ms returned sat
[2024-06-01 15:28:23] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:28:23] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:28:23] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:28:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 677 ms
[2024-06-01 15:28:23] [INFO ] Computed and/alt/rep : 401/910/391 causal constraints (skipped 940 transitions) in 109 ms.
[2024-06-01 15:28:34] [INFO ] Added : 30 causal constraints over 6 iterations in 10354 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[30, 360]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[30, 360]
Support contains 11 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 34 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 32 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-06-01 15:28:34] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:28:34] [INFO ] Invariant cache hit.
[2024-06-01 15:28:35] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-01 15:28:35] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:28:35] [INFO ] Invariant cache hit.
[2024-06-01 15:28:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:28:46] [INFO ] Implicit Places using invariants and state equation in 11148 ms returned []
Implicit Place search using SMT with State Equation took 11794 ms to find 0 implicit places.
[2024-06-01 15:28:46] [INFO ] Redundant transitions in 91 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 15:28:46] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:28:46] [INFO ] Invariant cache hit.
[2024-06-01 15:28:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 3 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:28:59] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:28:59] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:28:59] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:28:59] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:28:59] [INFO ] Deduced a trap composed of 82 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:29:01] [INFO ] Deduced a trap composed of 186 places in 311 ms of which 4 ms to minimize.
[2024-06-01 15:29:04] [INFO ] Deduced a trap composed of 332 places in 233 ms of which 3 ms to minimize.
[2024-06-01 15:29:08] [INFO ] Deduced a trap composed of 178 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:29:08] [INFO ] Deduced a trap composed of 188 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:29:09] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:29:09] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:29:10] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:29:16] [INFO ] Deduced a trap composed of 200 places in 212 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63209ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75155 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (15 resets) in 1340 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 484 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 316 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 119422 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 4
Probabilistic random walk after 119422 steps, saw 82914 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 15:29:53] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:29:53] [INFO ] Invariant cache hit.
[2024-06-01 15:29:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 15:29:56] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 6 ms to minimize.
[2024-06-01 15:29:56] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:29:56] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:29:56] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:29:56] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:29:56] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 1 ms to minimize.
[2024-06-01 15:29:56] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 9 ms to minimize.
[2024-06-01 15:29:56] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 8/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1333/1864 variables, 531/585 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 120/705 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1864/1866 variables, and 707 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4752 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 531/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 6599ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 11 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 30 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-06-01 15:30:00] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:30:00] [INFO ] Invariant cache hit.
[2024-06-01 15:30:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:30:13] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:30:13] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:30:13] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:30:13] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:30:14] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:30:14] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:30:14] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:30:14] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:30:14] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:30:14] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:30:14] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:30:14] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:30:15] [INFO ] Deduced a trap composed of 82 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:30:17] [INFO ] Deduced a trap composed of 186 places in 314 ms of which 4 ms to minimize.
[2024-06-01 15:30:20] [INFO ] Deduced a trap composed of 332 places in 325 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 59 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:30:34] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2024-06-01 15:30:35] [INFO ] Deduced a trap composed of 222 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:30:42] [INFO ] Deduced a trap composed of 198 places in 338 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 63 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 19/19 constraints]
After SMT, in 43756ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 43775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43812 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (19 resets) in 431 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 152286 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 152286 steps, saw 104762 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 15:30:47] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:30:47] [INFO ] Invariant cache hit.
[2024-06-01 15:30:47] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 2 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:30:48] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:30:48] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:30:48] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1333/1864 variables, 531/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 120/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MIN1 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 2/707 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 15:30:52] [INFO ] Deduced a trap composed of 279 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:30:52] [INFO ] Deduced a trap composed of 251 places in 351 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 2/709 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1866 variables, 2/711 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 1/712 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 712 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5050 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 5917ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 22 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (15 resets) in 408 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (12 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 184521 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 184521 steps, saw 125763 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-06-01 15:30:56] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:30:56] [INFO ] Invariant cache hit.
[2024-06-01 15:30:56] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:30:57] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:30:58] [INFO ] Deduced a trap composed of 44 places in 350 ms of which 4 ms to minimize.
[2024-06-01 15:30:58] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 3 ms to minimize.
[2024-06-01 15:30:58] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:30:59] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 3 ms to minimize.
[2024-06-01 15:30:59] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:30:59] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:31:00] [INFO ] Deduced a trap composed of 248 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:31:00] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:31:00] [INFO ] Deduced a trap composed of 201 places in 237 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1866 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:31:03] [INFO ] Deduced a trap composed of 250 places in 374 ms of which 4 ms to minimize.
[2024-06-01 15:31:04] [INFO ] Deduced a trap composed of 24 places in 378 ms of which 4 ms to minimize.
[2024-06-01 15:31:05] [INFO ] Deduced a trap composed of 23 places in 382 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1866 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1866 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 713 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8155 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9072ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 28 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 27 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-06-01 15:31:05] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:31:05] [INFO ] Invariant cache hit.
[2024-06-01 15:31:06] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-06-01 15:31:06] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:31:06] [INFO ] Invariant cache hit.
[2024-06-01 15:31:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:31:23] [INFO ] Implicit Places using invariants and state equation in 16750 ms returned []
Implicit Place search using SMT with State Equation took 17512 ms to find 0 implicit places.
[2024-06-01 15:31:23] [INFO ] Redundant transitions in 86 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 15:31:23] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:31:23] [INFO ] Invariant cache hit.
[2024-06-01 15:31:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:31:36] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:31:38] [INFO ] Deduced a trap composed of 82 places in 318 ms of which 4 ms to minimize.
[2024-06-01 15:31:40] [INFO ] Deduced a trap composed of 186 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:31:43] [INFO ] Deduced a trap composed of 332 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:31:47] [INFO ] Deduced a trap composed of 178 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:31:47] [INFO ] Deduced a trap composed of 188 places in 231 ms of which 3 ms to minimize.
[2024-06-01 15:31:48] [INFO ] Deduced a trap composed of 243 places in 256 ms of which 2 ms to minimize.
[2024-06-01 15:31:48] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:31:49] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:31:55] [INFO ] Deduced a trap composed of 200 places in 276 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:32:26] [INFO ] Deduced a trap composed of 62 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:32:27] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 3 ms to minimize.
SMT process timed out in 63665ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81319 ms. Remains : 533/533 places, 1353/1353 transitions.
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-08 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[30]
Starting property specific reduction for PolyORBLF-PT-S02J06T10-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
[2024-06-01 15:32:27] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:32:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (2 resets) in 60 ms. (163 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 26 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2024-06-01 15:32:27] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:32:27] [INFO ] Invariant cache hit.
[2024-06-01 15:32:27] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:32:27] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 30 ms returned sat
[2024-06-01 15:32:28] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-06-01 15:32:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:32:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 15:32:28] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 15:32:30] [INFO ] [Nat]Absence check using state equation in 2517 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 40 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-06-01 15:32:30] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:32:30] [INFO ] Invariant cache hit.
[2024-06-01 15:32:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:32:44] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:32:44] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:32:44] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:32:44] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
[2024-06-01 15:32:44] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
[2024-06-01 15:32:45] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:32:45] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:32:45] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:32:45] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:32:45] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:32:45] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:32:45] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-06-01 15:32:46] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:32:47] [INFO ] Deduced a trap composed of 186 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:32:50] [INFO ] Deduced a trap composed of 332 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:32:54] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:32:54] [INFO ] Deduced a trap composed of 188 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:32:54] [INFO ] Deduced a trap composed of 243 places in 292 ms of which 4 ms to minimize.
SMT process timed out in 24143ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 24167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24212 ms. Remains : 533/533 places, 1353/1353 transitions.
[2024-06-01 15:32:54] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:32:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 1000000 steps (370 resets) in 5435 ms. (183 steps per ms)
BEST_FIRST walk for 1000000 steps (161 resets) in 2434 ms. (410 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2024-06-01 15:33:02] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:33:02] [INFO ] Invariant cache hit.
[2024-06-01 15:33:02] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 15:33:02] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 23 ms returned sat
[2024-06-01 15:33:04] [INFO ] [Real]Absence check using state equation in 1069 ms returned sat
[2024-06-01 15:33:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:33:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 15:33:04] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 29 ms returned sat
[2024-06-01 15:33:06] [INFO ] [Nat]Absence check using state equation in 2350 ms returned sat
[2024-06-01 15:33:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:33:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 2163 ms returned sat
[2024-06-01 15:33:09] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 2 ms to minimize.
[2024-06-01 15:33:09] [INFO ] Deduced a trap composed of 226 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:33:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2024-06-01 15:33:09] [INFO ] Computed and/alt/rep : 401/910/391 causal constraints (skipped 940 transitions) in 103 ms.
[2024-06-01 15:33:10] [INFO ] Added : 30 causal constraints over 6 iterations in 706 ms. Result :sat
Minimization took 4673 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 68 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 41 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-06-01 15:33:14] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:33:14] [INFO ] Invariant cache hit.
[2024-06-01 15:33:15] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-06-01 15:33:15] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:33:15] [INFO ] Invariant cache hit.
[2024-06-01 15:33:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:33:30] [INFO ] Implicit Places using invariants and state equation in 15375 ms returned []
Implicit Place search using SMT with State Equation took 15934 ms to find 0 implicit places.
[2024-06-01 15:33:30] [INFO ] Redundant transitions in 48 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 15:33:30] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:33:31] [INFO ] Invariant cache hit.
[2024-06-01 15:33:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:33:42] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:33:42] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:33:44] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 3 ms to minimize.
[2024-06-01 15:33:46] [INFO ] Deduced a trap composed of 186 places in 204 ms of which 3 ms to minimize.
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 332 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:33:52] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:33:52] [INFO ] Deduced a trap composed of 188 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:33:53] [INFO ] Deduced a trap composed of 243 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:33:53] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:33:54] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:34:01] [INFO ] Deduced a trap composed of 200 places in 329 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63338ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63351ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79411 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (13 resets) in 388 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 130539 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 130539 steps, saw 90220 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 15:34:37] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:34:37] [INFO ] Invariant cache hit.
[2024-06-01 15:34:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 45 places in 275 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/700 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1866 variables, 2/702 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 1/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1866 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 703 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2343 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 44 places in 328 ms of which 4 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 44 places in 331 ms of which 4 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 232 places in 240 ms of which 2 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1864/1866 variables, and 585 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2779 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 531/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 5145ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 47 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-06-01 15:34:42] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:34:42] [INFO ] Invariant cache hit.
[2024-06-01 15:34:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 82 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:34:57] [INFO ] Deduced a trap composed of 186 places in 307 ms of which 3 ms to minimize.
[2024-06-01 15:35:00] [INFO ] Deduced a trap composed of 332 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 188 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 243 places in 260 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 62 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:35:14] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:35:17] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:35:23] [INFO ] Deduced a trap composed of 199 places in 230 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 42706ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 42727ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42780 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (15 resets) in 454 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 178570 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 178570 steps, saw 121887 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-06-01 15:35:28] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:35:28] [INFO ] Invariant cache hit.
[2024-06-01 15:35:28] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:35:30] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 3 ms to minimize.
[2024-06-01 15:35:30] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 3 ms to minimize.
[2024-06-01 15:35:30] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:35:31] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 2 ms to minimize.
[2024-06-01 15:35:31] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:35:31] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:35:32] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:35:32] [INFO ] Deduced a trap composed of 248 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:35:32] [INFO ] Deduced a trap composed of 226 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:35:32] [INFO ] Deduced a trap composed of 201 places in 249 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1866 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:35:35] [INFO ] Deduced a trap composed of 268 places in 296 ms of which 3 ms to minimize.
[2024-06-01 15:35:37] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1866 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 712 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7545 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 8701ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 276 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 22 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 22 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-06-01 15:35:37] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:35:37] [INFO ] Invariant cache hit.
[2024-06-01 15:35:38] [INFO ] Implicit Places using invariants in 718 ms returned []
[2024-06-01 15:35:38] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:35:38] [INFO ] Invariant cache hit.
[2024-06-01 15:35:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:35:54] [INFO ] Implicit Places using invariants and state equation in 15991 ms returned []
Implicit Place search using SMT with State Equation took 16711 ms to find 0 implicit places.
[2024-06-01 15:35:54] [INFO ] Redundant transitions in 56 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 15:35:54] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 15:35:54] [INFO ] Invariant cache hit.
[2024-06-01 15:35:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:36:05] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:36:06] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:36:07] [INFO ] Deduced a trap composed of 82 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:36:08] [INFO ] Deduced a trap composed of 186 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:36:11] [INFO ] Deduced a trap composed of 332 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:36:15] [INFO ] Deduced a trap composed of 178 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:36:15] [INFO ] Deduced a trap composed of 188 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 243 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:36:17] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:36:22] [INFO ] Deduced a trap composed of 200 places in 219 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 15:36:57] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 3 ms to minimize.
SMT process timed out in 62555ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 62569ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79374 ms. Remains : 533/533 places, 1353/1353 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[30]
Ending property specific reduction for PolyORBLF-PT-S02J06T10-UpperBounds-04 in 269963 ms.
[2024-06-01 15:36:57] [INFO ] Flatten gal took : 222 ms
[2024-06-01 15:36:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 15:36:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 533 places, 1353 transitions and 6973 arcs took 11 ms.
Total runtime 2798685 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-UpperBounds-04

BK_STOP 1717256217795

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBLF-PT-S02J06T10-UpperBounds-04
ub formula formula --maxsum=/tmp/1562/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T10, 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 r516-tajo-171654446700261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 ;