About the Execution of ITS-Tools for PolyORBLF-PT-S02J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1020.724 | 150877.00 | 194050.00 | 65.20 | 5 2 1 2 1 1 1 1 2 1 1 1 1 1 1 1 | normal |
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.r290-tajo-171654446600221.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 itstools
Input is PolyORBLF-PT-S02J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716913064268
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 16:17:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:17:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:17:45] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-28 16:17:45] [INFO ] Transformed 476 places.
[2024-05-28 16:17:45] [INFO ] Transformed 920 transitions.
[2024-05-28 16:17:45] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 16:17:45] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-28 16:17:45] [INFO ] Computed 46 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1] Max Struct:[36, 510, 6, 249, 510, 1, +inf, 49, +inf, 1, 1, 1, +inf, +inf, 6, +inf]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 81 ms. (121 steps per ms)
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120004 steps (35 resets) in 419 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1] Max Struct:[36, 510, 6, 249, 510, +inf, 49, +inf, +inf, +inf, 6, +inf]
[2024-05-28 16:17:46] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 16:17:46] [INFO ] Invariant cache hit.
[2024-05-28 16:17:46] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-28 16:17:46] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 36 ms returned sat
[2024-05-28 16:17:48] [INFO ] [Real]Absence check using state equation in 1279 ms returned sat
[2024-05-28 16:17:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:17:48] [INFO ] [Real]Added 72 Read/Feed constraints in 230 ms returned sat
[2024-05-28 16:17:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:17:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 16:17:48] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 18 ms returned sat
[2024-05-28 16:17:49] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2024-05-28 16:17:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 248 ms returned sat
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 25 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 284 ms
[2024-05-28 16:17:49] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 16:17:49] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 4 ms returned unsat
[2024-05-28 16:17:49] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 2 ms returned unsat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned unsat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned unsat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 21 ms returned unsat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 7 ms returned unsat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 23 ms returned unsat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 16:17:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned sat
[2024-05-28 16:17:51] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2024-05-28 16:17:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:17:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 16:17:51] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned sat
[2024-05-28 16:17:52] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2024-05-28 16:17:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 16:17:52] [INFO ] [Nat]Added 72 Read/Feed constraints in 666 ms returned sat
[2024-05-28 16:17:52] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:17:53] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:17:53] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 5 ms to minimize.
[2024-05-28 16:17:54] [INFO ] Deduced a trap composed of 231 places in 278 ms of which 4 ms to minimize.
[2024-05-28 16:17:54] [INFO ] Deduced a trap composed of 251 places in 266 ms of which 4 ms to minimize.
[2024-05-28 16:17:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2088 ms
[2024-05-28 16:17:54] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 74 ms.
[2024-05-28 16:17:56] [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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 16:17:56] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 16:17:56] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1] Max Struct:[5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 6, 1]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 300 place count 325 transition count 675
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 312 place count 325 transition count 663
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 324 place count 313 transition count 663
Applied a total of 324 rules in 204 ms. Remains 313 /476 variables (removed 163) and now considering 663/824 (removed 161) transitions.
Running 661 sub problems to find dead transitions.
[2024-05-28 16:17:56] [INFO ] Flow matrix only has 651 transitions (discarded 12 similar events)
// Phase 1: matrix 651 rows 313 cols
[2024-05-28 16:17:56] [INFO ] Computed 44 invariants in 21 ms
[2024-05-28 16:17:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 2 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:18:03] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-28 16:18:09] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/964 variables, and 49 constraints, problems are : Problem set: 0 solved, 661 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/313 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/313 variables, 8/57 constraints. Problems are: Problem set: 66 solved, 595 unsolved
[2024-05-28 16:18:28] [INFO ] Deduced a trap composed of 122 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:18:29] [INFO ] Deduced a trap composed of 116 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:18:29] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:18:30] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:18:33] [INFO ] Deduced a trap composed of 149 places in 187 ms of which 2 ms to minimize.
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 116 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 123 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:18:35] [INFO ] Deduced a trap composed of 122 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:18:35] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:18:36] [INFO ] Deduced a trap composed of 114 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:18:36] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 12/69 constraints. Problems are: Problem set: 66 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/964 variables, and 69 constraints, problems are : Problem set: 66 solved, 595 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/313 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/661 constraints, Known Traps: 25/25 constraints]
After SMT, in 41237ms problems are : Problem set: 66 solved, 595 unsolved
Search for dead transitions found 66 dead transitions in 41268ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 313/476 places, 597/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 585
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 299 transition count 573
Applied a total of 14 rules in 23 ms. Remains 299 /313 variables (removed 14) and now considering 573/597 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41519 ms. Remains : 299/476 places, 573/824 transitions.
[2024-05-28 16:18:38] [INFO ] Flow matrix only has 561 transitions (discarded 12 similar events)
// Phase 1: matrix 561 rows 299 cols
[2024-05-28 16:18:38] [INFO ] Computed 44 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (593 resets) in 2995 ms. (333 steps per ms)
BEST_FIRST walk for 1000000 steps (317 resets) in 1686 ms. (592 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-28 16:18:42] [INFO ] Flow matrix only has 561 transitions (discarded 12 similar events)
[2024-05-28 16:18:42] [INFO ] Invariant cache hit.
[2024-05-28 16:18:42] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 16:18:42] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 10 ms returned sat
[2024-05-28 16:18:43] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-28 16:18:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:18:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 16:18:43] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 10 ms returned sat
[2024-05-28 16:18:43] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-05-28 16:18:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:18:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 131 ms returned sat
[2024-05-28 16:18:44] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:18:44] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:18:44] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:18:44] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 3 ms to minimize.
[2024-05-28 16:18:44] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:18:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 683 ms
[2024-05-28 16:18:44] [INFO ] Computed and/alt/rep : 337/1493/331 causal constraints (skipped 228 transitions) in 66 ms.
[2024-05-28 16:18:45] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:18:45] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:18:46] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:18:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 628 ms
[2024-05-28 16:18:46] [INFO ] Added : 87 causal constraints over 18 iterations in 1555 ms. Result :sat
Minimization took 1980 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 573/573 transitions.
Applied a total of 0 rules in 12 ms. Remains 299 /299 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 299/299 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 573/573 transitions.
Applied a total of 0 rules in 12 ms. Remains 299 /299 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-28 16:18:48] [INFO ] Flow matrix only has 561 transitions (discarded 12 similar events)
[2024-05-28 16:18:48] [INFO ] Invariant cache hit.
[2024-05-28 16:18:48] [INFO ] Implicit Places using invariants in 305 ms returned [74, 149, 169, 171, 264, 273]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 308 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 293/299 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 289 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 289 transition count 569
Applied a total of 8 rules in 19 ms. Remains 289 /293 variables (removed 4) and now considering 569/573 (removed 4) transitions.
[2024-05-28 16:18:48] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2024-05-28 16:18:48] [INFO ] Computed 38 invariants in 12 ms
[2024-05-28 16:18:49] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-28 16:18:49] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-28 16:18:49] [INFO ] Invariant cache hit.
[2024-05-28 16:18:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:18:50] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2063 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 289/299 places, 569/573 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2406 ms. Remains : 289/299 places, 569/573 transitions.
[2024-05-28 16:18:50] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-28 16:18:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (588 resets) in 2708 ms. (369 steps per ms)
BEST_FIRST walk for 1000001 steps (297 resets) in 1351 ms. (739 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-28 16:18:54] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-28 16:18:54] [INFO ] Invariant cache hit.
[2024-05-28 16:18:55] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 16:18:55] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 8 ms returned sat
[2024-05-28 16:18:55] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-28 16:18:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:18:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 16:18:55] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 15 ms returned sat
[2024-05-28 16:18:55] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2024-05-28 16:18:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:18:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 130 ms returned sat
[2024-05-28 16:18:56] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:18:56] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:18:56] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:18:56] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:18:56] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:18:57] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:18:57] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2024-05-28 16:18:57] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:18:57] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:18:57] [INFO ] Deduced a trap composed of 109 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 143 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 1 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 2 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:19:02] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:19:02] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6047 ms
[2024-05-28 16:19:02] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 64 ms.
[2024-05-28 16:19:03] [INFO ] Added : 67 causal constraints over 14 iterations in 1130 ms. Result :sat
Minimization took 3294 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 17 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 289/289 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 32 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-28 16:19:07] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-28 16:19:07] [INFO ] Invariant cache hit.
[2024-05-28 16:19:07] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-28 16:19:07] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-28 16:19:07] [INFO ] Invariant cache hit.
[2024-05-28 16:19:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:19:09] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
[2024-05-28 16:19:09] [INFO ] Redundant transitions in 51 ms returned []
Running 567 sub problems to find dead transitions.
[2024-05-28 16:19:09] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-28 16:19:09] [INFO ] Invariant cache hit.
[2024-05-28 16:19:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-28 16:19:12] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:19:12] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:19:12] [INFO ] Deduced a trap composed of 140 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:19:12] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:19:12] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:19:12] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:19:12] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:19:13] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:19:13] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:19:13] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:19:13] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:19:13] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:19:13] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:19:13] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:19:13] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 150 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 114 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 125 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 121 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 155 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 130 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-28 16:19:23] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:19:23] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:19:23] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 105 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 117 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 131 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 132 places in 201 ms of which 2 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 116 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-28 16:19:28] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:19:28] [INFO ] Deduced a trap composed of 162 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:19:28] [INFO ] Deduced a trap composed of 145 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:19:29] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:19:29] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:19:29] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 3 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:19:31] [INFO ] Deduced a trap composed of 115 places in 107 ms of which 3 ms to minimize.
[2024-05-28 16:19:31] [INFO ] Deduced a trap composed of 125 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:19:31] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:19:31] [INFO ] Deduced a trap composed of 156 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:19:32] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:19:32] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:19:32] [INFO ] Deduced a trap composed of 139 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:19:32] [INFO ] Deduced a trap composed of 129 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:19:33] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-28 16:19:33] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:19:34] [INFO ] Deduced a trap composed of 114 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:19:34] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:19:34] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 139 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:19:37] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:19:37] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:19:37] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:19:37] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:19:38] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:19:38] [INFO ] Deduced a trap composed of 159 places in 137 ms of which 1 ms to minimize.
[2024-05-28 16:19:38] [INFO ] Deduced a trap composed of 132 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:19:38] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:19:39] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/846 variables, and 136 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/289 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 100/136 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-28 16:19:43] [INFO ] Deduced a trap composed of 89 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:19:44] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:19:46] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:19:46] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:19:46] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:19:47] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:19:48] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:19:51] [INFO ] Deduced a trap composed of 126 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:19:51] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:19:51] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:19:51] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:19:52] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:19:52] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-28 16:20:00] [INFO ] Deduced a trap composed of 99 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:20:03] [INFO ] Deduced a trap composed of 136 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:20:03] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:20:03] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:20:03] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:20:04] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:20:04] [INFO ] Deduced a trap composed of 124 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:20:04] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:20:04] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:20:05] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:20:05] [INFO ] Deduced a trap composed of 127 places in 166 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/846 variables, and 160 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/289 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/567 constraints, Known Traps: 124/124 constraints]
After SMT, in 60586ms problems are : Problem set: 0 solved, 567 unsolved
Search for dead transitions found 0 dead transitions in 60597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62790 ms. Remains : 289/289 places, 569/569 transitions.
RANDOM walk for 40000 steps (17 resets) in 1238 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (16 resets) in 462 ms. (86 steps per ms) remains 2/2 properties
[2024-05-28 16:20:10] [INFO ] Flatten gal took : 181 ms
[2024-05-28 16:20:10] [INFO ] Flatten gal took : 89 ms
BEST_FIRST walk for 40003 steps (13 resets) in 423 ms. (94 steps per ms) remains 2/2 properties
[2024-05-28 16:20:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7480522335282798527.gal : 26 ms
[2024-05-28 16:20:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11802608945831928348.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7480522335282798527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11802608945831928348.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11802608945831928348.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :44 after 244
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :244 after 254
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :254 after 270
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5520 after 5590
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9820 after 9908
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9908 after 11644
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :11644 after 14361
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :15370 after 22826
Interrupted probabilistic random walk after 228463 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 228463 steps, saw 122334 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-28 16:20:13] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-28 16:20:13] [INFO ] Invariant cache hit.
[2024-05-28 16:20:13] [INFO ] State equation strengthened by 72 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 177/185 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:20:13] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 50/235 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 51/286 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/287 variables, 1/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 557/844 variables, 287/326 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/844 variables, 72/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/844 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/846 variables, 2/400 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/846 variables, 1/401 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/846 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/846 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 846/846 variables, and 401 constraints, problems are : Problem set: 1 solved, 1 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 289/289 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/185 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/235 variables, 12/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 51/286 variables, 19/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 5/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/287 variables, 1/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 557/844 variables, 287/331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/844 variables, 72/403 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 844/846 variables, and 404 constraints, problems are : Problem set: 2 solved, 0 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 287/289 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1453ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 149503 ms.
BK_STOP 1716913215145
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-PT-S02J04T06, 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 r290-tajo-171654446600221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;