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-171654447300509.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 PolyORBNT-PT-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447300509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 36K Apr 12 11:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 12 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 180K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 160K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 714K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 401K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717261813747

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:10:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 17:10:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:10:16] [INFO ] Load time of PNML (sax parser for PT used): 985 ms
[2024-06-01 17:10:16] [INFO ] Transformed 1234 places.
[2024-06-01 17:10:16] [INFO ] Transformed 12920 transitions.
[2024-06-01 17:10:16] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 1378 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 25 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 1, 0, 0] Max Struct:[+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, 10, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 17:10:16] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-06-01 17:10:17] [INFO ] Computed 152 invariants in 165 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 1, 0, 0] Max Struct:[201, 10, 70, 201, 4, 1, 3, 10, 10, 1, 523, 64, 2, 4]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (559 resets) in 447 ms. (22 steps per ms)
FORMULA PolyORBNT-PT-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (1041 resets) in 522 ms. (191 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4, 0, 0, 0, 1, 2, 1, 0, 3] Max Struct:[201, 10, 70, 201, 3, 10, 523, 64, 2, 4]
[2024-06-01 17:10:18] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-06-01 17:10:18] [INFO ] Invariant cache hit.
[2024-06-01 17:10:18] [INFO ] [Real]Absence check using 121 positive place invariants in 99 ms returned sat
[2024-06-01 17:10:18] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 72 ms returned sat
[2024-06-01 17:10:20] [INFO ] [Real]Absence check using state equation in 1524 ms returned sat
[2024-06-01 17:10:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2024-06-01 17:10:20] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 44 ms returned sat
[2024-06-01 17:10:22] [INFO ] [Nat]Absence check using state equation in 1980 ms returned sat
[2024-06-01 17:10:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:10:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 17:10:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1021 ms returned unknown
[2024-06-01 17:10:24] [INFO ] [Real]Absence check using 121 positive place invariants in 36 ms returned sat
[2024-06-01 17:10:24] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 48 ms returned sat
[2024-06-01 17:10:26] [INFO ] [Real]Absence check using state equation in 1920 ms returned sat
[2024-06-01 17:10:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-06-01 17:10:26] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 46 ms returned sat
[2024-06-01 17:10:28] [INFO ] [Nat]Absence check using state equation in 2077 ms returned unknown
[2024-06-01 17:10:28] [INFO ] [Real]Absence check using 121 positive place invariants in 38 ms returned sat
[2024-06-01 17:10:28] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 56 ms returned sat
[2024-06-01 17:10:30] [INFO ] [Real]Absence check using state equation in 1282 ms returned sat
[2024-06-01 17:10:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:30] [INFO ] [Nat]Absence check using 121 positive place invariants in 55 ms returned sat
[2024-06-01 17:10:30] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 45 ms returned sat
[2024-06-01 17:10:31] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2024-06-01 17:10:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 85 ms returned sat
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 644 places in 924 ms of which 54 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 354 places in 732 ms of which 9 ms to minimize.
[2024-06-01 17:10:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2144 ms
[2024-06-01 17:10:34] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 316 ms.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 19 places in 373 ms of which 2 ms to minimize.
[2024-06-01 17:10:35] [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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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 17:10:35] [INFO ] [Real]Absence check using 121 positive place invariants in 47 ms returned sat
[2024-06-01 17:10:35] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 48 ms returned sat
[2024-06-01 17:10:37] [INFO ] [Real]Absence check using state equation in 1454 ms returned sat
[2024-06-01 17:10:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 58 ms returned sat
[2024-06-01 17:10:37] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 53 ms returned sat
[2024-06-01 17:10:39] [INFO ] [Nat]Absence check using state equation in 1945 ms returned sat
[2024-06-01 17:10:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 114 ms returned sat
[2024-06-01 17:10:40] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 241 ms.
[2024-06-01 17:10:41] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 2 ms to minimize.
[2024-06-01 17:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2024-06-01 17:10:41] [INFO ] Added : 27 causal constraints over 6 iterations in 1932 ms. Result :sat
Minimization took 463 ms.
[2024-06-01 17:10:42] [INFO ] [Real]Absence check using 121 positive place invariants in 26 ms returned sat
[2024-06-01 17:10:42] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 34 ms returned sat
[2024-06-01 17:10:44] [INFO ] [Real]Absence check using state equation in 1480 ms returned sat
[2024-06-01 17:10:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 42 ms returned sat
[2024-06-01 17:10:44] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 49 ms returned sat
[2024-06-01 17:10:45] [INFO ] [Nat]Absence check using state equation in 1289 ms returned sat
[2024-06-01 17:10:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 17:10:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 542 ms returned sat
[2024-06-01 17:10:46] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 225 ms.
[2024-06-01 17:10:47] [INFO ] Added : 11 causal constraints over 3 iterations in 1200 ms. Result :sat
Minimization took 764 ms.
[2024-06-01 17:10:48] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2024-06-01 17:10:48] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 38 ms returned unsat
[2024-06-01 17:10:48] [INFO ] [Real]Absence check using 121 positive place invariants in 26 ms returned sat
[2024-06-01 17:10:48] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 36 ms returned sat
[2024-06-01 17:10:49] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2024-06-01 17:10:50] [INFO ] [Real]Added 1 Read/Feed constraints in 83 ms returned sat
[2024-06-01 17:10:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-06-01 17:10:50] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 34 ms returned sat
[2024-06-01 17:10:51] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2024-06-01 17:10:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 17:10:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1008 ms returned unknown
[2024-06-01 17:10:52] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2024-06-01 17:10:52] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 11 ms returned unsat
[2024-06-01 17:10:52] [INFO ] [Real]Absence check using 121 positive place invariants in 25 ms returned sat
[2024-06-01 17:10:52] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 35 ms returned sat
[2024-06-01 17:10:53] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2024-06-01 17:10:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2024-06-01 17:10:54] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 34 ms returned sat
[2024-06-01 17:10:55] [INFO ] [Nat]Absence check using state equation in 1435 ms returned sat
[2024-06-01 17:10:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 49 ms returned sat
[2024-06-01 17:10:56] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 378 ms.
[2024-06-01 17:10:58] [INFO ] Added : 23 causal constraints over 7 iterations in 2385 ms. Result :sat
Minimization took 679 ms.
[2024-06-01 17:10:58] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-06-01 17:10:59] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 47 ms returned sat
[2024-06-01 17:11:00] [INFO ] [Real]Absence check using state equation in 1010 ms returned sat
[2024-06-01 17:11:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:11:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2024-06-01 17:11:00] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 48 ms returned sat
[2024-06-01 17:11:01] [INFO ] [Nat]Absence check using state equation in 1334 ms returned sat
[2024-06-01 17:11:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 17:11:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1005 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4, 0, 0, 0, 1, 2, 1, 0, 3] Max Struct:[201, 10, 70, 201, 3, 1, 523, 1, 2, 4]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 4, 0, 0, 0, 2, 0, 3] Max Struct:[201, 10, 70, 201, 3, 523, 2, 4]
Support contains 128 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 1220 transition count 2805
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 1219 transition count 2805
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 20 place count 1219 transition count 2741
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 148 place count 1155 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 1154 transition count 2740
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 1154 transition count 2740
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 1152 transition count 2738
Applied a total of 154 rules in 867 ms. Remains 1152 /1234 variables (removed 82) and now considering 2738/2810 (removed 72) transitions.
Running 2727 sub problems to find dead transitions.
[2024-06-01 17:11:03] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
// Phase 1: matrix 2729 rows 1152 cols
[2024-06-01 17:11:03] [INFO ] Computed 142 invariants in 148 ms
[2024-06-01 17:11:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1142 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2727 unsolved
SMT process timed out in 42159ms, After SMT, problems are : Problem set: 0 solved, 2727 unsolved
Search for dead transitions found 0 dead transitions in 42219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43154 ms. Remains : 1152/1234 places, 2738/2810 transitions.
[2024-06-01 17:11:45] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
[2024-06-01 17:11:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 4, 0, 0, 0, 2, 0, 3] Max Struct:[201, 10, 70, 201, 3, 353, 2, 4]
RANDOM walk for 1000000 steps (69562 resets) in 18594 ms. (53 steps per ms)
FORMULA PolyORBNT-PT-S10J60-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000005 steps (41274 resets) in 19071 ms. (314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 1, 1, 3, 3] Max Struct:[201, 10, 70, 201, 353, 4]
[2024-06-01 17:12:23] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
[2024-06-01 17:12:23] [INFO ] Invariant cache hit.
[2024-06-01 17:12:23] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-06-01 17:12:23] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 38 ms returned unsat
[2024-06-01 17:12:24] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2024-06-01 17:12:24] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 54 ms returned sat
[2024-06-01 17:12:26] [INFO ] [Real]Absence check using state equation in 1965 ms returned sat
[2024-06-01 17:12:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:12:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2024-06-01 17:12:26] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 37 ms returned sat
[2024-06-01 17:12:29] [INFO ] [Nat]Absence check using state equation in 2731 ms returned unsat
[2024-06-01 17:12:29] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-06-01 17:12:29] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 33 ms returned unsat
[2024-06-01 17:12:29] [INFO ] [Real]Absence check using 121 positive place invariants in 24 ms returned sat
[2024-06-01 17:12:29] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 8 ms returned unsat
[2024-06-01 17:12:29] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-06-01 17:12:29] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 36 ms returned sat
[2024-06-01 17:12:30] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2024-06-01 17:12:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:12:30] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2024-06-01 17:12:30] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 35 ms returned sat
[2024-06-01 17:12:31] [INFO ] [Nat]Absence check using state equation in 1067 ms returned sat
[2024-06-01 17:12:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:12:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 448 ms returned sat
[2024-06-01 17:12:32] [INFO ] Computed and/alt/rep : 1796/5449/1796 causal constraints (skipped 922 transitions) in 301 ms.
[2024-06-01 17:12:33] [INFO ] Added : 6 causal constraints over 2 iterations in 895 ms. Result :sat
Minimization took 7052 ms.
[2024-06-01 17:12:40] [INFO ] [Real]Absence check using 121 positive place invariants in 24 ms returned sat
[2024-06-01 17:12:40] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 27 ms returned sat
[2024-06-01 17:12:41] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2024-06-01 17:12:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:12:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-06-01 17:12:42] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 39 ms returned sat
[2024-06-01 17:12:43] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2024-06-01 17:12:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 728 ms returned sat
[2024-06-01 17:12:44] [INFO ] Computed and/alt/rep : 1796/5449/1796 causal constraints (skipped 922 transitions) in 336 ms.
[2024-06-01 17:12:45] [INFO ] Added : 6 causal constraints over 2 iterations in 944 ms. Result :sat
Minimization took 5315 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 1, 1, 3, 3] Max Struct:[4, 4, 1, 1, 353, 4]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[353, 4]
Support contains 2 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2738/2738 transitions.
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 61 Pre rules applied. Total rules applied 0 place count 1152 transition count 2677
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 1091 transition count 2677
Applied a total of 122 rules in 246 ms. Remains 1091 /1152 variables (removed 61) and now considering 2677/2738 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 1091/1152 places, 2677/2738 transitions.
[2024-06-01 17:12:50] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
// Phase 1: matrix 2668 rows 1091 cols
[2024-06-01 17:12:50] [INFO ] Computed 142 invariants in 106 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[136, 4]
RANDOM walk for 1000000 steps (70247 resets) in 15437 ms. (64 steps per ms)
BEST_FIRST walk for 2000002 steps (14302 resets) in 5385 ms. (371 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[136, 4]
[2024-06-01 17:13:11] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:13:11] [INFO ] Invariant cache hit.
[2024-06-01 17:13:11] [INFO ] [Real]Absence check using 122 positive place invariants in 30 ms returned sat
[2024-06-01 17:13:11] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 34 ms returned sat
[2024-06-01 17:13:12] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2024-06-01 17:13:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:13:13] [INFO ] [Nat]Absence check using 122 positive place invariants in 32 ms returned sat
[2024-06-01 17:13:13] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 32 ms returned sat
[2024-06-01 17:13:14] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2024-06-01 17:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:13:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 616 ms returned sat
[2024-06-01 17:13:15] [INFO ] Deduced a trap composed of 190 places in 849 ms of which 6 ms to minimize.
[2024-06-01 17:13:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1225 ms
[2024-06-01 17:13:16] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 289 ms.
[2024-06-01 17:13:16] [INFO ] Added : 10 causal constraints over 3 iterations in 914 ms. Result :sat
Minimization took 7667 ms.
[2024-06-01 17:13:24] [INFO ] [Real]Absence check using 122 positive place invariants in 30 ms returned sat
[2024-06-01 17:13:24] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 30 ms returned sat
[2024-06-01 17:13:25] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2024-06-01 17:13:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:13:25] [INFO ] [Nat]Absence check using 122 positive place invariants in 30 ms returned sat
[2024-06-01 17:13:25] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 34 ms returned sat
[2024-06-01 17:13:26] [INFO ] [Nat]Absence check using state equation in 963 ms returned sat
[2024-06-01 17:13:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 784 ms returned sat
[2024-06-01 17:13:28] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 327 ms.
[2024-06-01 17:13:29] [INFO ] Added : 10 causal constraints over 2 iterations in 1540 ms. Result :sat
Minimization took 6802 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[136, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[136, 4]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 227 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 216 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-06-01 17:13:36] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:13:36] [INFO ] Invariant cache hit.
[2024-06-01 17:13:38] [INFO ] Implicit Places using invariants in 2271 ms returned []
[2024-06-01 17:13:38] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:13:38] [INFO ] Invariant cache hit.
[2024-06-01 17:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:14:11] [INFO ] Performed 899/1091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 17:14:14] [INFO ] Implicit Places using invariants and state equation in 35982 ms returned []
Implicit Place search using SMT with State Equation took 38256 ms to find 0 implicit places.
[2024-06-01 17:14:15] [INFO ] Redundant transitions in 167 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-06-01 17:14:15] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:14:15] [INFO ] Invariant cache hit.
[2024-06-01 17:14:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 51992ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 52018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90687 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2813 resets) in 2058 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (293 resets) in 367 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (267 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (273 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (276 resets) in 277 ms. (143 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 103301 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 103301 steps, saw 18713 distinct states, run finished after 3005 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 17:15:11] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:15:11] [INFO ] Invariant cache hit.
[2024-06-01 17:15:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 317/327 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 732/1059 variables, 120/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/1089 variables, 18/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1090 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 317/327 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 732/1059 variables, 120/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/1089 variables, 18/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 458 places in 759 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1089 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1090 variables, 1/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2668/3758 variables, 1090/1233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/3759 variables, 1/1235 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 3/1238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3759 variables, 0/1238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3759 variables, 0/1238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1238 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4356 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 6768ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 316 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 97 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-06-01 17:15:18] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:15:18] [INFO ] Invariant cache hit.
[2024-06-01 17:15:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 41249ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 41283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41396 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2817 resets) in 2229 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (258 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (284 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (297 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 113022 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 3
Probabilistic random walk after 113022 steps, saw 20352 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-06-01 17:16:03] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:16:03] [INFO ] Invariant cache hit.
[2024-06-01 17:16:03] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 317/327 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 732/1059 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/1089 variables, 18/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1090 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2594 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 317/327 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 732/1059 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/1089 variables, 18/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 458 places in 662 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1089 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1090 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2668/3758 variables, 1090/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/3759 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 3/1238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3759 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3759 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1238 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3980 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 6593ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 130 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 96 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-06-01 17:16:10] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:16:10] [INFO ] Invariant cache hit.
[2024-06-01 17:16:12] [INFO ] Implicit Places using invariants in 2123 ms returned []
[2024-06-01 17:16:12] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:16:12] [INFO ] Invariant cache hit.
[2024-06-01 17:16:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:16:45] [INFO ] Performed 997/1091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 17:16:48] [INFO ] Implicit Places using invariants and state equation in 35579 ms returned []
Implicit Place search using SMT with State Equation took 37716 ms to find 0 implicit places.
[2024-06-01 17:16:48] [INFO ] Redundant transitions in 173 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-06-01 17:16:48] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:16:48] [INFO ] Invariant cache hit.
[2024-06-01 17:16:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 50536ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 50567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88591 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[136, 4]
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-12
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:[136]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[136]
[2024-06-01 17:17:39] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:17:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[136]
RANDOM walk for 10000 steps (717 resets) in 245 ms. (40 steps per ms)
BEST_FIRST walk for 10001 steps (55 resets) in 32 ms. (303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-06-01 17:17:39] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:17:39] [INFO ] Invariant cache hit.
[2024-06-01 17:17:39] [INFO ] [Real]Absence check using 122 positive place invariants in 29 ms returned sat
[2024-06-01 17:17:39] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 36 ms returned sat
[2024-06-01 17:17:40] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2024-06-01 17:17:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:17:40] [INFO ] [Nat]Absence check using 122 positive place invariants in 26 ms returned sat
[2024-06-01 17:17:40] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2024-06-01 17:17:41] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2024-06-01 17:17:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:17:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 17:17:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1003 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 131 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-06-01 17:17:42] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:17:42] [INFO ] Invariant cache hit.
[2024-06-01 17:17:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 48379ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 48432ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48580 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-06-01 17:18:31] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:18:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (70415 resets) in 17042 ms. (58 steps per ms)
BEST_FIRST walk for 1000001 steps (7050 resets) in 2828 ms. (353 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-06-01 17:18:50] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:18:50] [INFO ] Invariant cache hit.
[2024-06-01 17:18:51] [INFO ] [Real]Absence check using 122 positive place invariants in 30 ms returned sat
[2024-06-01 17:18:51] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 34 ms returned sat
[2024-06-01 17:18:51] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2024-06-01 17:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:18:52] [INFO ] [Nat]Absence check using 122 positive place invariants in 23 ms returned sat
[2024-06-01 17:18:52] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 26 ms returned sat
[2024-06-01 17:18:53] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2024-06-01 17:18:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:18:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 603 ms returned sat
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 190 places in 887 ms of which 7 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1164 ms
[2024-06-01 17:18:55] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 217 ms.
[2024-06-01 17:18:55] [INFO ] Added : 10 causal constraints over 3 iterations in 945 ms. Result :sat
Minimization took 7391 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 166 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 113 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-06-01 17:19:03] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:19:03] [INFO ] Invariant cache hit.
[2024-06-01 17:19:05] [INFO ] Implicit Places using invariants in 2279 ms returned []
[2024-06-01 17:19:05] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:19:05] [INFO ] Invariant cache hit.
[2024-06-01 17:19:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:19:38] [INFO ] Performed 1035/1091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 17:19:40] [INFO ] Implicit Places using invariants and state equation in 34467 ms returned []
Implicit Place search using SMT with State Equation took 36763 ms to find 0 implicit places.
[2024-06-01 17:19:40] [INFO ] Redundant transitions in 81 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-06-01 17:19:40] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:19:40] [INFO ] Invariant cache hit.
[2024-06-01 17:19:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 50107ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 50130ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87105 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2850 resets) in 934 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (287 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (285 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 124272 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 2
Probabilistic random walk after 124272 steps, saw 22187 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-01 17:20:34] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:20:34] [INFO ] Invariant cache hit.
[2024-06-01 17:20:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/231 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 490/721 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/721 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 300/1021 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 64/1085 variables, 19/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/1090 variables, 5/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3758/3759 variables, and 1232 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1090/1091 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/231 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 490/721 variables, 87/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/721 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 300/1021 variables, 30/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/1085 variables, 19/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1090 variables, 5/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3758/3759 variables, and 1233 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1686 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1090/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3128ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 124 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-06-01 17:20:37] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:20:37] [INFO ] Invariant cache hit.
[2024-06-01 17:20:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 40204ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 40235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40366 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2781 resets) in 958 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (281 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 137208 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 1
Probabilistic random walk after 137208 steps, saw 24220 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-06-01 17:21:21] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:21:21] [INFO ] Invariant cache hit.
[2024-06-01 17:21:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/231 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 490/721 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/721 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 300/1021 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/1085 variables, 19/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/1090 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/231 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 490/721 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/721 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 300/1021 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/1085 variables, 19/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1090 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2110 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3946ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 104 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 92 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-06-01 17:21:25] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:21:25] [INFO ] Invariant cache hit.
[2024-06-01 17:21:27] [INFO ] Implicit Places using invariants in 1906 ms returned []
[2024-06-01 17:21:27] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:21:27] [INFO ] Invariant cache hit.
[2024-06-01 17:21:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:21:58] [INFO ] Implicit Places using invariants and state equation in 31731 ms returned []
Implicit Place search using SMT with State Equation took 33640 ms to find 0 implicit places.
[2024-06-01 17:21:59] [INFO ] Redundant transitions in 81 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-06-01 17:21:59] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:21:59] [INFO ] Invariant cache hit.
[2024-06-01 17:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 51891ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 51914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85759 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[136]
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-12 in 311975 ms.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-15
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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-06-01 17:22:50] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:22:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (719 resets) in 217 ms. (45 steps per ms)
BEST_FIRST walk for 10001 steps (68 resets) in 34 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 17:22:51] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-06-01 17:22:51] [INFO ] Invariant cache hit.
[2024-06-01 17:22:51] [INFO ] [Real]Absence check using 122 positive place invariants in 32 ms returned sat
[2024-06-01 17:22:51] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 49 ms returned sat
[2024-06-01 17:22:52] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2024-06-01 17:22:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:22:52] [INFO ] [Nat]Absence check using 122 positive place invariants in 30 ms returned sat
[2024-06-01 17:22:52] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 33 ms returned sat
[2024-06-01 17:22:53] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2024-06-01 17:22:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:22:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 17:22:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 722 ms returned sat
[2024-06-01 17:22:54] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 209 ms.
[2024-06-01 17:22:55] [INFO ] Added : 10 causal constraints over 2 iterations in 1399 ms. Result :sat
Minimization took 672 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2676
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2676
Applied a total of 2 rules in 129 ms. Remains 1090 /1091 variables (removed 1) and now considering 2676/2677 (removed 1) transitions.
Running 2665 sub problems to find dead transitions.
[2024-06-01 17:22:56] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
// Phase 1: matrix 2667 rows 1090 cols
[2024-06-01 17:22:56] [INFO ] Computed 142 invariants in 42 ms
[2024-06-01 17:22:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
SMT process timed out in 40760ms, After SMT, problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 40783ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40933 ms. Remains : 1090/1091 places, 2676/2677 transitions.
[2024-06-01 17:23:37] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:23:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72479 resets) in 15827 ms. (63 steps per ms)
BEST_FIRST walk for 1000001 steps (7337 resets) in 2454 ms. (407 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 17:23:55] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:23:55] [INFO ] Invariant cache hit.
[2024-06-01 17:23:55] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-06-01 17:23:55] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 25 ms returned sat
[2024-06-01 17:23:56] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-06-01 17:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:23:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-06-01 17:23:56] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 34 ms returned sat
[2024-06-01 17:23:57] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-06-01 17:23:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:23:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 752 ms returned sat
[2024-06-01 17:23:58] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 921 transitions) in 233 ms.
[2024-06-01 17:23:58] [INFO ] Added : 5 causal constraints over 1 iterations in 631 ms. Result :sat
Minimization took 6344 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2676/2676 transitions.
Applied a total of 0 rules in 144 ms. Remains 1090 /1090 variables (removed 0) and now considering 2676/2676 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 1090/1090 places, 2676/2676 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2676/2676 transitions.
Applied a total of 0 rules in 102 ms. Remains 1090 /1090 variables (removed 0) and now considering 2676/2676 (removed 0) transitions.
[2024-06-01 17:24:05] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:24:05] [INFO ] Invariant cache hit.
[2024-06-01 17:24:07] [INFO ] Implicit Places using invariants in 1816 ms returned []
[2024-06-01 17:24:07] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:24:07] [INFO ] Invariant cache hit.
[2024-06-01 17:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:24:38] [INFO ] Performed 948/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 17:24:42] [INFO ] Implicit Places using invariants and state equation in 35721 ms returned []
Implicit Place search using SMT with State Equation took 37539 ms to find 0 implicit places.
[2024-06-01 17:24:43] [INFO ] Redundant transitions in 122 ms returned []
Running 2665 sub problems to find dead transitions.
[2024-06-01 17:24:43] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:24:43] [INFO ] Invariant cache hit.
[2024-06-01 17:24:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1080 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/3757 variables, and 132 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2665/1665 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1080 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/3757 variables, and 132 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1665 constraints, Known Traps: 0/0 constraints]
After SMT, in 79571ms problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 79600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117394 ms. Remains : 1090/1090 places, 2676/2676 transitions.
RANDOM walk for 40000 steps (2892 resets) in 963 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (295 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (277 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 105186 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 2
Probabilistic random walk after 105186 steps, saw 18971 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-06-01 17:26:06] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:26:06] [INFO ] Invariant cache hit.
[2024-06-01 17:26:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 324/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 732/1057 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1057 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/1088 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1089 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2667/3756 variables, 1089/1231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3756 variables, 1/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3756 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/3757 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3757 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3757 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3757/3757 variables, and 1233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1090/1090 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 324/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 732/1057 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1057 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/1088 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1089 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2667/3756 variables, 1089/1231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3756 variables, 1/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:26:09] [INFO ] Deduced a trap composed of 182 places in 687 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3756 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3756 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/3757 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3757 variables, 2/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3757 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/3757 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3757/3757 variables, and 1236 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3063 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1090/1090 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 4730ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2676/2676 transitions.
Applied a total of 0 rules in 97 ms. Remains 1090 /1090 variables (removed 0) and now considering 2676/2676 (removed 0) transitions.
Running 2665 sub problems to find dead transitions.
[2024-06-01 17:26:11] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:26:11] [INFO ] Invariant cache hit.
[2024-06-01 17:26:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
SMT process timed out in 39765ms, After SMT, problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 39794ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39898 ms. Remains : 1090/1090 places, 2676/2676 transitions.
RANDOM walk for 40000 steps (2920 resets) in 1368 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (289 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (286 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 120480 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 120480 steps, saw 21571 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 17:26:54] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:26:54] [INFO ] Invariant cache hit.
[2024-06-01 17:26:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 324/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 732/1057 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1057 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/1088 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1089 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2667/3756 variables, 1089/1231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3756 variables, 1/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3756 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/3757 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3757 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3757 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3757/3757 variables, and 1233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1090/1090 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 324/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 732/1057 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1057 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/1088 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1089 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2667/3756 variables, 1089/1231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3756 variables, 1/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:26:58] [INFO ] Deduced a trap composed of 182 places in 740 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3756 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3756 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/3757 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3757 variables, 2/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3757 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/3757 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3757/3757 variables, and 1236 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1090/1090 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 5126ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 82 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2676/2676 transitions.
Applied a total of 0 rules in 66 ms. Remains 1090 /1090 variables (removed 0) and now considering 2676/2676 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1090/1090 places, 2676/2676 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2676/2676 transitions.
Applied a total of 0 rules in 89 ms. Remains 1090 /1090 variables (removed 0) and now considering 2676/2676 (removed 0) transitions.
[2024-06-01 17:26:59] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:26:59] [INFO ] Invariant cache hit.
[2024-06-01 17:27:01] [INFO ] Implicit Places using invariants in 1675 ms returned []
[2024-06-01 17:27:01] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:27:01] [INFO ] Invariant cache hit.
[2024-06-01 17:27:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:27:32] [INFO ] Performed 984/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 17:27:35] [INFO ] Implicit Places using invariants and state equation in 34192 ms returned []
Implicit Place search using SMT with State Equation took 35868 ms to find 0 implicit places.
[2024-06-01 17:27:35] [INFO ] Redundant transitions in 80 ms returned []
Running 2665 sub problems to find dead transitions.
[2024-06-01 17:27:35] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-06-01 17:27:35] [INFO ] Invariant cache hit.
[2024-06-01 17:27:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1080 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/3757 variables, and 132 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2665/1665 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1080 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/3757 variables, and 132 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1665 constraints, Known Traps: 0/0 constraints]
After SMT, in 79863ms problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 79885ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115936 ms. Remains : 1090/1090 places, 2676/2676 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-15 in 364605 ms.
[2024-06-01 17:28:56] [INFO ] Flatten gal took : 469 ms
[2024-06-01 17:28:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 17:28:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1091 places, 2677 transitions and 16786 arcs took 44 ms.
Total runtime 1121165 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 : PolyORBNT-PT-S10J60-UpperBounds-12
Could not compute solution for formula : PolyORBNT-PT-S10J60-UpperBounds-15

BK_STOP 1717262936770

--------------------
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 PolyORBNT-PT-S10J60-UpperBounds-12
ub formula formula --maxsum=/tmp/931/ub_0_
ub formula name PolyORBNT-PT-S10J60-UpperBounds-15
ub formula formula --maxsum=/tmp/931/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J60"
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 PolyORBNT-PT-S10J60, 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-171654447300509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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