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-171654446700245.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-S02J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446700245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K 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.9K 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 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K 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-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716915194028

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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 16:53:15] [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:53:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:53:15] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-28 16:53:15] [INFO ] Transformed 536 places.
[2024-05-28 16:53:15] [INFO ] Transformed 1064 transitions.
[2024-05-28 16:53:15] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 221 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:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 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:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 16:53:15] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-28 16:53:15] [INFO ] Computed 50 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 798, 276, 192, 1, 36, 35, 552, 41, 41, 1, 3, 1, 1, 46, 1]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (3 resets) in 103 ms. (96 steps per ms)
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (33 resets) in 429 ms. (255 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 6, 1, 5, 1, 1, 1, 1, 0, 1] Max Struct:[+inf, 798, 276, 192, 36, 35, 552, 41, 41, 3, 46]
[2024-05-28 16:53:16] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 16:53:16] [INFO ] Invariant cache hit.
[2024-05-28 16:53:16] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-28 16:53:16] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 30 ms returned sat
[2024-05-28 16:53:17] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2024-05-28 16:53:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-05-28 16:53:17] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2024-05-28 16:53:19] [INFO ] [Nat]Absence check using state equation in 1443 ms returned sat
[2024-05-28 16:53:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:53:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 16:53:20] [INFO ] [Nat]Added 72 Read/Feed constraints in 1011 ms returned unknown
[2024-05-28 16:53:20] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-28 16:53:20] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2024-05-28 16:53:20] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2024-05-28 16:53:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 16:53:20] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2024-05-28 16:53:21] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-28 16:53:21] [INFO ] [Nat]Added 72 Read/Feed constraints in 235 ms returned sat
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 34 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 263 places in 279 ms of which 4 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 315 places in 240 ms of which 14 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Deduced a trap composed of 283 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1496 ms
[2024-05-28 16:53:23] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 104 ms.
[2024-05-28 16:53:25] [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: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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:53:25] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 16:53:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2024-05-28 16:53:26] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 16:53:26] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2024-05-28 16:53:26] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 16:53:26] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned sat
[2024-05-28 16:53:27] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2024-05-28 16:53:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 16:53:27] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 24 ms returned sat
[2024-05-28 16:53:27] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-05-28 16:53:28] [INFO ] [Nat]Added 72 Read/Feed constraints in 260 ms returned sat
[2024-05-28 16:53:28] [INFO ] Deduced a trap composed of 126 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:53:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 279 ms
[2024-05-28 16:53:28] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 16:53:28] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2024-05-28 16:53:28] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 16:53:28] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 39 ms returned sat
[2024-05-28 16:53:29] [INFO ] [Real]Absence check using state equation in 1335 ms returned sat
[2024-05-28 16:53:30] [INFO ] [Real]Added 72 Read/Feed constraints in 149 ms returned sat
[2024-05-28 16:53:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 16:53:30] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2024-05-28 16:53:31] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2024-05-28 16:53:31] [INFO ] [Nat]Added 72 Read/Feed constraints in 440 ms returned sat
[2024-05-28 16:53:31] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 6 ms to minimize.
[2024-05-28 16:53:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 306 ms
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned unsat
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned unsat
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 21 ms returned sat
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2024-05-28 16:53:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 16:53:32] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 27 ms returned sat
[2024-05-28 16:53:33] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2024-05-28 16:53:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 358 ms returned sat
[2024-05-28 16:53:34] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 104 ms.
[2024-05-28 16:53:35] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 4 ms to minimize.
[2024-05-28 16:53:36] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 3 ms to minimize.
[2024-05-28 16:53:36] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1305 ms
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-28 16:53:37] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 16:53:37] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned sat
[2024-05-28 16:53:39] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2024-05-28 16:53:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 16:53:39] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2024-05-28 16:53:40] [INFO ] [Nat]Absence check using state equation in 1121 ms returned sat
[2024-05-28 16:53:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 424 ms returned sat
[2024-05-28 16:53:41] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:53:41] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:53:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 629 ms
[2024-05-28 16:53:41] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 111 ms.
[2024-05-28 16:53:44] [INFO ] Added : 100 causal constraints over 20 iterations in 2736 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 6, 1, 5, 1, 1, 1, 1, 0, 1] Max Struct:[+inf, 798, 6, 1, 5, 1, 1, 1, 1, 3, 46]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Support contains 14 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 534 transition count 921
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 487 transition count 921
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 487 transition count 861
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 427 transition count 861
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 298 place count 386 transition count 820
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 304 place count 386 transition count 814
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 310 place count 380 transition count 814
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 380 transition count 814
Applied a total of 311 rules in 251 ms. Remains 380 /536 variables (removed 156) and now considering 814/968 (removed 154) transitions.
Running 812 sub problems to find dead transitions.
[2024-05-28 16:53:45] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
// Phase 1: matrix 802 rows 380 cols
[2024-05-28 16:53:45] [INFO ] Computed 48 invariants in 20 ms
[2024-05-28 16:53:45] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:53:50] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 2 ms to minimize.
[2024-05-28 16:53:51] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:53:53] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:53:56] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:53:56] [INFO ] Deduced a trap composed of 119 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:53:56] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 3 ms to minimize.
[2024-05-28 16:53:57] [INFO ] Deduced a trap composed of 145 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:53:57] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 2 ms to minimize.
[2024-05-28 16:53:57] [INFO ] Deduced a trap composed of 96 places in 200 ms of which 2 ms to minimize.
[2024-05-28 16:53:58] [INFO ] Deduced a trap composed of 103 places in 220 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-28 16:53:59] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 10.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1182 variables, and 63 constraints, problems are : Problem set: 0 solved, 812 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/380 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 812 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 4 (OVERLAPS) 2/380 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1182 variables, and 65 constraints, problems are : Problem set: 0 solved, 812 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/380 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/812 constraints, Known Traps: 17/17 constraints]
After SMT, in 41292ms problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 41325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41600 ms. Remains : 380/536 places, 814/968 transitions.
[2024-05-28 16:54:26] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 16:56:18] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2024-05-28 16:56:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
RANDOM walk for 1000000 steps (459 resets) in 3936 ms. (254 steps per ms)
BEST_FIRST walk for 4000003 steps (574 resets) in 6448 ms. (620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
[2024-05-28 16:56:28] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2024-05-28 16:56:28] [INFO ] Invariant cache hit.
[2024-05-28 16:56:28] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:56:28] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 24 ms returned sat
[2024-05-28 16:56:29] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-05-28 16:56:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:56:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:56:29] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 23 ms returned sat
[2024-05-28 16:56:29] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2024-05-28 16:56:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:56:30] [INFO ] [Nat]Added 72 Read/Feed constraints in 759 ms returned sat
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 3 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 145 places in 247 ms of which 3 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1111 ms
[2024-05-28 16:56:31] [INFO ] Computed and/alt/rep : 464/2052/458 causal constraints (skipped 342 transitions) in 71 ms.
[2024-05-28 16:56:35] [INFO ] Added : 121 causal constraints over 25 iterations in 3264 ms. Result :sat
Minimization took 3111 ms.
[2024-05-28 16:56:38] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:56:38] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 22 ms returned sat
[2024-05-28 16:56:38] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2024-05-28 16:56:39] [INFO ] [Real]Added 72 Read/Feed constraints in 93 ms returned sat
[2024-05-28 16:56:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:56:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:56:39] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 26 ms returned sat
[2024-05-28 16:56:39] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2024-05-28 16:56:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 162 ms returned sat
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2024-05-28 16:56:40] [INFO ] Computed and/alt/rep : 464/2052/458 causal constraints (skipped 342 transitions) in 73 ms.
[2024-05-28 16:56:41] [INFO ] Deduced a trap composed of 135 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:56:42] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 4 ms to minimize.
[2024-05-28 16:56:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1437 ms
[2024-05-28 16:56:43] [INFO ] Added : 64 causal constraints over 13 iterations in 2740 ms. Result :sat
Minimization took 2736 ms.
[2024-05-28 16:56:46] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:56:46] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 22 ms returned sat
[2024-05-28 16:56:46] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2024-05-28 16:56:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:56:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:56:46] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 25 ms returned sat
[2024-05-28 16:56:47] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2024-05-28 16:56:51] [INFO ] [Nat]Added 72 Read/Feed constraints in 3655 ms returned sat
[2024-05-28 16:56:51] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 3 ms to minimize.
[2024-05-28 16:56:51] [INFO ] Deduced a trap composed of 114 places in 244 ms of which 3 ms to minimize.
[2024-05-28 16:56:51] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:56:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1276 ms
[2024-05-28 16:56:52] [INFO ] Computed and/alt/rep : 464/2052/458 causal constraints (skipped 342 transitions) in 92 ms.
[2024-05-28 16:56:54] [INFO ] Added : 100 causal constraints over 20 iterations in 2181 ms. Result :sat
Minimization took 3327 ms.
[2024-05-28 16:56:57] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:56:58] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 41 ms returned sat
[2024-05-28 16:56:58] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2024-05-28 16:56:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:56:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:56:58] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 20 ms returned sat
[2024-05-28 16:56:59] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2024-05-28 16:56:59] [INFO ] [Nat]Added 72 Read/Feed constraints in 226 ms returned sat
[2024-05-28 16:56:59] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:56:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2024-05-28 16:56:59] [INFO ] Computed and/alt/rep : 464/2052/458 causal constraints (skipped 342 transitions) in 73 ms.
[2024-05-28 16:57:03] [INFO ] Added : 235 causal constraints over 47 iterations in 3721 ms. Result :sat
Minimization took 4278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Support contains 14 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 814/814 transitions.
Applied a total of 0 rules in 24 ms. Remains 380 /380 variables (removed 0) and now considering 814/814 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 380/380 places, 814/814 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 814/814 transitions.
Applied a total of 0 rules in 19 ms. Remains 380 /380 variables (removed 0) and now considering 814/814 (removed 0) transitions.
[2024-05-28 16:57:10] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2024-05-28 16:57:10] [INFO ] Invariant cache hit.
[2024-05-28 16:57:10] [INFO ] Implicit Places using invariants in 488 ms returned [74, 82, 169, 180, 217, 355]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 492 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 374/380 places, 814/814 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 371 transition count 811
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 371 transition count 811
Applied a total of 6 rules in 66 ms. Remains 371 /374 variables (removed 3) and now considering 811/814 (removed 3) transitions.
[2024-05-28 16:57:10] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
// Phase 1: matrix 799 rows 371 cols
[2024-05-28 16:57:10] [INFO ] Computed 42 invariants in 19 ms
[2024-05-28 16:57:11] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-28 16:57:11] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 16:57:11] [INFO ] Invariant cache hit.
[2024-05-28 16:57:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:57:15] [INFO ] Implicit Places using invariants and state equation in 3799 ms returned []
Implicit Place search using SMT with State Equation took 4281 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 371/380 places, 811/814 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4860 ms. Remains : 371/380 places, 811/814 transitions.
[2024-05-28 16:57:15] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 16:57:26] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 16:57:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
RANDOM walk for 1000000 steps (452 resets) in 3674 ms. (272 steps per ms)
BEST_FIRST walk for 4000001 steps (586 resets) in 5962 ms. (670 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
[2024-05-28 16:57:36] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 16:57:36] [INFO ] Invariant cache hit.
[2024-05-28 16:57:36] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 16:57:36] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 16:57:37] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2024-05-28 16:57:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:57:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 16:57:37] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 16:57:38] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2024-05-28 16:57:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:57:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 373 ms returned sat
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 3 ms to minimize.
[2024-05-28 16:57:38] [INFO ] Deduced a trap composed of 114 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:57:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 588 ms
[2024-05-28 16:57:39] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 50 ms.
[2024-05-28 16:57:39] [INFO ] Added : 57 causal constraints over 12 iterations in 896 ms. Result :sat
Minimization took 2281 ms.
[2024-05-28 16:57:42] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 16:57:42] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-28 16:57:42] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-05-28 16:57:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:57:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 16:57:42] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 16:57:43] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2024-05-28 16:57:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 95 ms returned sat
[2024-05-28 16:57:44] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 3 ms to minimize.
[2024-05-28 16:57:44] [INFO ] Deduced a trap composed of 123 places in 236 ms of which 3 ms to minimize.
[2024-05-28 16:57:44] [INFO ] Deduced a trap composed of 135 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:57:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 852 ms
[2024-05-28 16:57:44] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 56 ms.
[2024-05-28 16:57:46] [INFO ] Added : 87 causal constraints over 18 iterations in 2040 ms. Result :sat
Minimization took 2509 ms.
[2024-05-28 16:57:49] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 16:57:49] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 16:57:49] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2024-05-28 16:57:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:57:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 16:57:49] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 16:57:53] [INFO ] [Nat]Absence check using state equation in 3275 ms returned sat
[2024-05-28 16:57:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 572 ms returned sat
[2024-05-28 16:57:53] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 76 ms.
[2024-05-28 16:57:54] [INFO ] Deduced a trap composed of 177 places in 246 ms of which 3 ms to minimize.
[2024-05-28 16:57:55] [INFO ] Deduced a trap composed of 185 places in 269 ms of which 3 ms to minimize.
[2024-05-28 16:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 5079 ms
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-28 16:58:34] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 16:58:35] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 16:58:35] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2024-05-28 16:58:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:58:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 16:58:35] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 16:58:36] [INFO ] [Nat]Absence check using state equation in 947 ms returned sat
[2024-05-28 16:58:37] [INFO ] [Nat]Added 72 Read/Feed constraints in 396 ms returned sat
[2024-05-28 16:58:37] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:58:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2024-05-28 16:58:37] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 70 ms.
[2024-05-28 16:58:40] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 3 ms to minimize.
[2024-05-28 16:58:40] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 2 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 124 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:58:41] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:58:42] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:58:42] [INFO ] Deduced a trap composed of 132 places in 232 ms of which 3 ms to minimize.
[2024-05-28 16:58:43] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 2 ms to minimize.
[2024-05-28 16:58:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3602 ms
[2024-05-28 16:58:44] [INFO ] Added : 197 causal constraints over 40 iterations in 6693 ms. Result :sat
Minimization took 2548 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Support contains 14 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Applied a total of 0 rules in 40 ms. Remains 371 /371 variables (removed 0) and now considering 811/811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 371/371 places, 811/811 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Applied a total of 0 rules in 32 ms. Remains 371 /371 variables (removed 0) and now considering 811/811 (removed 0) transitions.
[2024-05-28 16:58:48] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 16:58:48] [INFO ] Invariant cache hit.
[2024-05-28 16:58:49] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-28 16:58:49] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 16:58:49] [INFO ] Invariant cache hit.
[2024-05-28 16:58:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:58:52] [INFO ] Implicit Places using invariants and state equation in 3528 ms returned []
Implicit Place search using SMT with State Equation took 3886 ms to find 0 implicit places.
[2024-05-28 16:58:52] [INFO ] Redundant transitions in 72 ms returned []
Running 809 sub problems to find dead transitions.
[2024-05-28 16:58:52] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 16:58:52] [INFO ] Invariant cache hit.
[2024-05-28 16:58:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 809 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-28 16:58:58] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:58:58] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-05-28 16:58:58] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:58:58] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:58:59] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 2 ms to minimize.
[2024-05-28 16:58:59] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:58:59] [INFO ] Deduced a trap composed of 115 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:59:00] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:59:02] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:59:02] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
[2024-05-28 16:59:03] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 4 ms to minimize.
[2024-05-28 16:59:05] [INFO ] Deduced a trap composed of 133 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:59:05] [INFO ] Deduced a trap composed of 132 places in 179 ms of which 2 ms to minimize.
[2024-05-28 16:59:05] [INFO ] Deduced a trap composed of 115 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:59:06] [INFO ] Deduced a trap composed of 142 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:59:06] [INFO ] Deduced a trap composed of 132 places in 232 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-28 16:59:13] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 4 ms to minimize.
[2024-05-28 16:59:13] [INFO ] Deduced a trap composed of 130 places in 221 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-28 16:59:19] [INFO ] Deduced a trap composed of 119 places in 184 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 809 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/1170 variables, and 59 constraints, problems are : Problem set: 0 solved, 809 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/371 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 809/809 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 809 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 809 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 809 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-28 16:59:31] [INFO ] Deduced a trap composed of 122 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:59:35] [INFO ] Deduced a trap composed of 218 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 809 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1170 variables, and 61 constraints, problems are : Problem set: 0 solved, 809 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/371 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/809 constraints, Known Traps: 21/21 constraints]
After SMT, in 61374ms problems are : Problem set: 0 solved, 809 unsolved
Search for dead transitions found 0 dead transitions in 61386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65396 ms. Remains : 371/371 places, 811/811 transitions.
[2024-05-28 16:59:54] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (21 resets) in 1632 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 338 ms. (118 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (10 resets) in 285 ms. (139 steps per ms) remains 7/7 properties
[2024-05-28 17:00:06] [INFO ] Flatten gal took : 222 ms
BEST_FIRST walk for 40004 steps (11 resets) in 315 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (11 resets) in 237 ms. (168 steps per ms) remains 7/7 properties
[2024-05-28 17:00:07] [INFO ] Flatten gal took : 149 ms
BEST_FIRST walk for 40003 steps (10 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
[2024-05-28 17:00:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18157245508915299370.gal : 46 ms
[2024-05-28 17:00:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4132419661427865537.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/ReachabilityCardinality18157245508915299370.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4132419661427865537.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties

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/ReachabilityCardinality4132419661427865537.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :11 after 12
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :14 after 20
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :20 after 22
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :22 after 114
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :114 after 636
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :636 after 754
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :754 after 1022
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1022 after 2306
Interrupted probabilistic random walk after 108200 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 7
Probabilistic random walk after 108200 steps, saw 65112 distinct states, run finished after 3005 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-28 17:00:10] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 17:00:10] [INFO ] Invariant cache hit.
[2024-05-28 17:00:10] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :2306 after 7384
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 277/291 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem MAX3 is UNSAT
At refinement iteration 3 (OVERLAPS) 22/313 variables, 13/25 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 55/368 variables, 15/41 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 799/1168 variables, 369/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1168 variables, 72/483 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1168 variables, 0/483 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/1170 variables, 2/485 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1170 variables, 1/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1170 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1170 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 486 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 371/371 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 277/291 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 22/313 variables, 13/26 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 133 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 2/28 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 55/368 variables, 15/43 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 5/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/369 variables, 1/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 799/1168 variables, 369/418 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1168 variables, 72/490 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem MAX2 is UNSAT
Problem MIN2 is UNSAT
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :7384 after 26628
Problem MIN3 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/1168 variables, 5/495 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1168 variables, 0/495 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1170 variables, 2/497 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1170 variables, 1/498 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1170 variables, 0/498 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1170 variables, 0/498 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 498 constraints, problems are : Problem set: 5 solved, 2 unsolved in 3116 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 371/371 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 8/8 constraints]
After SMT, in 5242ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 661 ms.
Support contains 12 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 369 transition count 809
Applied a total of 4 rules in 20 ms. Remains 369 /371 variables (removed 2) and now considering 809/811 (removed 2) transitions.
Running 807 sub problems to find dead transitions.
[2024-05-28 17:00:16] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
// Phase 1: matrix 797 rows 369 cols
[2024-05-28 17:00:16] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 17:00:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-28 17:00:21] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:00:21] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:00:21] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:00:21] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:00:21] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:00:21] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:00:21] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
[2024-05-28 17:00:21] [INFO ] Deduced a trap composed of 49 places in 28 ms of which 0 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 2 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 2 ms to minimize.
[2024-05-28 17:00:25] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 2 ms to minimize.
[2024-05-28 17:00:26] [INFO ] Deduced a trap composed of 132 places in 198 ms of which 3 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :26628 after 40295
[2024-05-28 17:00:26] [INFO ] Deduced a trap composed of 143 places in 174 ms of which 3 ms to minimize.
[2024-05-28 17:00:27] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:00:27] [INFO ] Deduced a trap composed of 135 places in 198 ms of which 3 ms to minimize.
[2024-05-28 17:00:27] [INFO ] Deduced a trap composed of 145 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 807 unsolved
SMT process timed out in 21399ms, After SMT, problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 21414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21437 ms. Remains : 369/371 places, 809/811 transitions.
RANDOM walk for 40000 steps (18 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (9 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (11 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :40295 after 202427
Interrupted probabilistic random walk after 156847 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 156847 steps, saw 91693 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-28 17:00:40] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2024-05-28 17:00:40] [INFO ] Invariant cache hit.
[2024-05-28 17:00:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 276/288 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 32/320 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/367 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 797/1164 variables, 367/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 72/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/1166 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1166 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1166 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1166 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1166/1166 variables, and 483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 369/369 constraints, ReadFeed: 72/72 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 276/288 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/320 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/367 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:00:41] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:00:41] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:00:41] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 797/1164 variables, 367/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 72/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:00:43] [INFO ] Deduced a trap composed of 147 places in 239 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/1166 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1166 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:00:44] [INFO ] Deduced a trap composed of 138 places in 260 ms of which 3 ms to minimize.
[2024-05-28 17:00:44] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1166 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1166 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1166/1166 variables, and 491 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3647 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 369/369 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 4549ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 634 ms.
Support contains 12 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 809/809 transitions.
Applied a total of 0 rules in 20 ms. Remains 369 /369 variables (removed 0) and now considering 809/809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 369/369 places, 809/809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 809/809 transitions.
Applied a total of 0 rules in 19 ms. Remains 369 /369 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-28 17:00:45] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2024-05-28 17:00:45] [INFO ] Invariant cache hit.
[2024-05-28 17:00:46] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-28 17:00:46] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2024-05-28 17:00:46] [INFO ] Invariant cache hit.
[2024-05-28 17:00:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:00:49] [INFO ] Implicit Places using invariants and state equation in 2971 ms returned []
Implicit Place search using SMT with State Equation took 3433 ms to find 0 implicit places.
[2024-05-28 17:00:49] [INFO ] Redundant transitions in 24 ms returned []
Running 807 sub problems to find dead transitions.
[2024-05-28 17:00:49] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2024-05-28 17:00:49] [INFO ] Invariant cache hit.
[2024-05-28 17:00:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:00:55] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:00:55] [INFO ] Deduced a trap composed of 114 places in 209 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 17:00:57] [INFO ] Flatten gal took : 88 ms
[2024-05-28 17:00:57] [INFO ] Applying decomposition
[2024-05-28 17:00:57] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4772945553701661071.txt' '-o' '/tmp/graph4772945553701661071.bin' '-w' '/tmp/graph4772945553701661071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4772945553701661071.bin' '-l' '-1' '-v' '-w' '/tmp/graph4772945553701661071.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:00:57] [INFO ] Decomposing Gal with order
[2024-05-28 17:00:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:00:58] [INFO ] Removed a total of 563 redundant transitions.
[2024-05-28 17:00:58] [INFO ] Flatten gal took : 378 ms
[2024-05-28 17:00:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 392 labels/synchronizations in 120 ms.
[2024-05-28 17:00:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18290050945495096199.gal : 9 ms
[2024-05-28 17:00:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2191953777496467681.prop : 0 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/ReachabilityCardinality18290050945495096199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2191953777496467681.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/ReachabilityCardinality2191953777496467681.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 80
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :80 after 530
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :530 after 715
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :715 after 748
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :748 after 1044
[2024-05-28 17:00:59] [INFO ] Deduced a trap composed of 75 places in 310 ms of which 11 ms to minimize.
[2024-05-28 17:00:59] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1044 after 1518
[2024-05-28 17:00:59] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 3 ms to minimize.
[2024-05-28 17:00:59] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 2 ms to minimize.
[2024-05-28 17:01:00] [INFO ] Deduced a trap composed of 120 places in 182 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1518 after 2618
[2024-05-28 17:01:01] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 3 ms to minimize.
[2024-05-28 17:01:01] [INFO ] Deduced a trap composed of 143 places in 148 ms of which 3 ms to minimize.
[2024-05-28 17:01:01] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 2 ms to minimize.
[2024-05-28 17:01:01] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 2 ms to minimize.
[2024-05-28 17:01:01] [INFO ] Deduced a trap composed of 145 places in 136 ms of which 2 ms to minimize.
[2024-05-28 17:01:02] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 807 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2618 after 13668
[2024-05-28 17:01:06] [INFO ] Deduced a trap composed of 258 places in 177 ms of which 2 ms to minimize.
[2024-05-28 17:01:06] [INFO ] Deduced a trap composed of 237 places in 165 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :31596 after 38806
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 807 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :38806 after 91076
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Problem TDEAD724 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/369 variables, 2/63 constraints. Problems are: Problem set: 66 solved, 741 unsolved
[2024-05-28 17:01:18] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-05-28 17:01:19] [INFO ] Deduced a trap composed of 112 places in 186 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/1166 variables, and 65 constraints, problems are : Problem set: 66 solved, 741 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 66 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 66 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 25/40 constraints. Problems are: Problem set: 66 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 21/61 constraints. Problems are: Problem set: 66 solved, 741 unsolved
[2024-05-28 17:01:26] [INFO ] Deduced a trap composed of 231 places in 197 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :91076 after 157095
[2024-05-28 17:01:31] [INFO ] Deduced a trap composed of 154 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 2/63 constraints. Problems are: Problem set: 66 solved, 741 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/63 constraints. Problems are: Problem set: 66 solved, 741 unsolved
Detected timeout of ITS tools.
At refinement iteration 5 (OVERLAPS) 2/369 variables, 2/65 constraints. Problems are: Problem set: 66 solved, 741 unsolved
SMT process timed out in 61230ms, After SMT, problems are : Problem set: 66 solved, 741 unsolved
Search for dead transitions found 66 dead transitions in 61245ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 369/369 places, 743/809 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 367 transition count 731
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 355 transition count 719
Applied a total of 14 rules in 39 ms. Remains 355 /369 variables (removed 14) and now considering 719/743 (removed 24) transitions.
[2024-05-28 17:01:50] [INFO ] Flow matrix only has 707 transitions (discarded 12 similar events)
// Phase 1: matrix 707 rows 355 cols
[2024-05-28 17:01:50] [INFO ] Computed 42 invariants in 10 ms
[2024-05-28 17:01:51] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-28 17:01:51] [INFO ] Flow matrix only has 707 transitions (discarded 12 similar events)
[2024-05-28 17:01:51] [INFO ] Invariant cache hit.
[2024-05-28 17:01:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:01:54] [INFO ] Implicit Places using invariants and state equation in 3033 ms returned []
Implicit Place search using SMT with State Equation took 3407 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 355/369 places, 719/809 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68176 ms. Remains : 355/369 places, 719/809 transitions.
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-11 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[2, 2] Max Struct:[+inf, 798]
Starting property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-00
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-28 17:01:54] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
// Phase 1: matrix 799 rows 371 cols
[2024-05-28 17:01:54] [INFO ] Computed 42 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (5 resets) in 88 ms. (112 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 17:01:54] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 17:01:54] [INFO ] Invariant cache hit.
[2024-05-28 17:01:54] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 17:01:54] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 17:01:54] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2024-05-28 17:01:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:01:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-28 17:01:55] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-28 17:01:55] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2024-05-28 17:01:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:01:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:01:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 586 ms returned sat
[2024-05-28 17:01:56] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 3 ms to minimize.
[2024-05-28 17:01:56] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 3 ms to minimize.
[2024-05-28 17:01:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 584 ms
[2024-05-28 17:01:56] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 65 ms.
[2024-05-28 17:01:57] [INFO ] Added : 56 causal constraints over 12 iterations in 1197 ms. Result :sat
Minimization took 590 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 6 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 371 transition count 805
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 365 transition count 805
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 363 transition count 803
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 363 transition count 797
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 357 transition count 797
Applied a total of 28 rules in 73 ms. Remains 357 /371 variables (removed 14) and now considering 797/811 (removed 14) transitions.
Running 795 sub problems to find dead transitions.
[2024-05-28 17:01:58] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
// Phase 1: matrix 785 rows 357 cols
[2024-05-28 17:01:58] [INFO ] Computed 42 invariants in 22 ms
[2024-05-28 17:01:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 17:02:03] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:02:03] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:02:03] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:02:04] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:02:04] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:02:04] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:02:05] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:02:07] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 5 ms to minimize.
[2024-05-28 17:02:08] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 3 ms to minimize.
[2024-05-28 17:02:09] [INFO ] Deduced a trap composed of 218 places in 199 ms of which 2 ms to minimize.
[2024-05-28 17:02:09] [INFO ] Deduced a trap composed of 114 places in 218 ms of which 2 ms to minimize.
[2024-05-28 17:02:09] [INFO ] Deduced a trap composed of 133 places in 225 ms of which 2 ms to minimize.
[2024-05-28 17:02:10] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 2 ms to minimize.
[2024-05-28 17:02:10] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 2 ms to minimize.
[2024-05-28 17:02:11] [INFO ] Deduced a trap composed of 129 places in 179 ms of which 3 ms to minimize.
[2024-05-28 17:02:11] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 17:02:17] [INFO ] Deduced a trap composed of 146 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1142 variables, and 57 constraints, problems are : Problem set: 0 solved, 795 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1142 variables, and 57 constraints, problems are : Problem set: 0 solved, 795 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/795 constraints, Known Traps: 17/17 constraints]
After SMT, in 41232ms problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 41242ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41318 ms. Remains : 357/371 places, 797/811 transitions.
[2024-05-28 17:02:39] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 17:04:46] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 17:04:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (563 resets) in 3935 ms. (254 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 1697 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 17:04:52] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 17:04:52] [INFO ] Invariant cache hit.
[2024-05-28 17:04:52] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 17:04:52] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 28 ms returned sat
[2024-05-28 17:04:53] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2024-05-28 17:04:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:04:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 17:04:53] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 17:04:54] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2024-05-28 17:04:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:04:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 438 ms returned sat
[2024-05-28 17:04:54] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 3 ms to minimize.
[2024-05-28 17:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2024-05-28 17:04:54] [INFO ] Computed and/alt/rep : 447/1992/441 causal constraints (skipped 342 transitions) in 75 ms.
[2024-05-28 17:04:56] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:04:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-28 17:04:56] [INFO ] Added : 105 causal constraints over 22 iterations in 1942 ms. Result :sat
Minimization took 4026 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 6 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 797/797 transitions.
Applied a total of 0 rules in 15 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 357/357 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 797/797 transitions.
Applied a total of 0 rules in 14 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2024-05-28 17:05:01] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 17:05:01] [INFO ] Invariant cache hit.
[2024-05-28 17:05:02] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-28 17:05:02] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 17:05:02] [INFO ] Invariant cache hit.
[2024-05-28 17:05:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:05:05] [INFO ] Implicit Places using invariants and state equation in 3441 ms returned []
Implicit Place search using SMT with State Equation took 3889 ms to find 0 implicit places.
[2024-05-28 17:05:05] [INFO ] Redundant transitions in 16 ms returned []
Running 795 sub problems to find dead transitions.
[2024-05-28 17:05:05] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 17:05:05] [INFO ] Invariant cache hit.
[2024-05-28 17:05:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 17:05:11] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:05:11] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:05:11] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 2 ms to minimize.
[2024-05-28 17:05:11] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:05:11] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 0 ms to minimize.
[2024-05-28 17:05:11] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:05:14] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
[2024-05-28 17:05:14] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:05:16] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2024-05-28 17:05:16] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 2 ms to minimize.
[2024-05-28 17:05:16] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 2 ms to minimize.
[2024-05-28 17:05:17] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 2 ms to minimize.
[2024-05-28 17:05:17] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 2 ms to minimize.
[2024-05-28 17:05:17] [INFO ] Deduced a trap composed of 150 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:05:17] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:05:17] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 2 ms to minimize.
[2024-05-28 17:05:17] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 17:05:19] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:05:24] [INFO ] Deduced a trap composed of 133 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 17:05:32] [INFO ] Deduced a trap composed of 210 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1142 variables, and 60 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/357 variables, 2/62 constraints. Problems are: Problem set: 66 solved, 729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1142 variables, and 62 constraints, problems are : Problem set: 66 solved, 729 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/795 constraints, Known Traps: 20/20 constraints]
After SMT, in 61082ms problems are : Problem set: 66 solved, 729 unsolved
Search for dead transitions found 66 dead transitions in 61093ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/357 places, 731/797 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 355 transition count 719
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 343 transition count 707
Applied a total of 14 rules in 18 ms. Remains 343 /357 variables (removed 14) and now considering 707/731 (removed 24) transitions.
[2024-05-28 17:06:06] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
// Phase 1: matrix 695 rows 343 cols
[2024-05-28 17:06:06] [INFO ] Computed 42 invariants in 8 ms
[2024-05-28 17:06:07] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-28 17:06:07] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
[2024-05-28 17:06:07] [INFO ] Invariant cache hit.
[2024-05-28 17:06:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:06:09] [INFO ] Implicit Places using invariants and state equation in 2633 ms returned []
Implicit Place search using SMT with State Equation took 2987 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 343/357 places, 707/797 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68029 ms. Remains : 343/357 places, 707/797 transitions.
[2024-05-28 17:06:09] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 17:07:22] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
[2024-05-28 17:07:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[78]
RANDOM walk for 1000000 steps (568 resets) in 2733 ms. (365 steps per ms)
BEST_FIRST walk for 1000000 steps (200 resets) in 1302 ms. (767 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[78]
[2024-05-28 17:07:26] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
[2024-05-28 17:07:26] [INFO ] Invariant cache hit.
[2024-05-28 17:07:27] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-28 17:07:27] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-28 17:07:27] [INFO ] Flatten gal took : 40 ms
[2024-05-28 17:07:27] [INFO ] Flatten gal took : 41 ms
[2024-05-28 17:07:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1584921465827676902.gal : 7 ms
[2024-05-28 17:07:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17233270800280224743.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/ReachabilityCardinality1584921465827676902.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17233270800280224743.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
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-00 in 333114 ms.
Starting property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-01
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:[798]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[798]
[2024-05-28 17:07:27] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
// Phase 1: matrix 799 rows 371 cols
[2024-05-28 17:07:27] [INFO ] Computed 42 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[798]
RANDOM walk for 10000 steps (2 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[798]
[2024-05-28 17:07:27] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 17:07:27] [INFO ] Invariant cache hit.
[2024-05-28 17:07:27] [INFO ] [Real]Absence check using 15 positive place invariants in 106 ms returned sat
[2024-05-28 17:07:27] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 186 ms returned sat
[2024-05-28 17:07:28] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-28 17:07:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:07:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 17:07:28] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 17:07:29] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2024-05-28 17:07:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:07:29] [INFO ] [Nat]Added 72 Read/Feed constraints in 338 ms returned sat
[2024-05-28 17:07:29] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 2 ms to minimize.
[2024-05-28 17:07:30] [INFO ] Deduced a trap composed of 128 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:07:30] [INFO ] Deduced a trap composed of 142 places in 211 ms of which 3 ms to minimize.
[2024-05-28 17:07:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1428 ms
[2024-05-28 17:07:30] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 59 ms.
[2024-05-28 17:07:32] [INFO ] Added : 49 causal constraints over 10 iterations in 1174 ms. Result :sat
Minimization took 594 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[798]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[798]
Support contains 6 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 363 transition count 803
Applied a total of 16 rules in 42 ms. Remains 363 /371 variables (removed 8) and now considering 803/811 (removed 8) transitions.
Running 801 sub problems to find dead transitions.
[2024-05-28 17:07:32] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
// Phase 1: matrix 791 rows 363 cols
[2024-05-28 17:07:32] [INFO ] Computed 42 invariants in 20 ms
[2024-05-28 17:07:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-28 17:07:38] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-28 17:07:38] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:07:38] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:07:38] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-28 17:07:38] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:07:38] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:07:39] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:07:39] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-05-28 17:07:39] [INFO ] Deduced a trap composed of 155 places in 181 ms of which 2 ms to minimize.
[2024-05-28 17:07:39] [INFO ] Deduced a trap composed of 114 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:07:40] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-05-28 17:07:40] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:07:42] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:07:44] [INFO ] Deduced a trap composed of 145 places in 173 ms of which 2 ms to minimize.
[2024-05-28 17:07:44] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:07:44] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 801 unsolved
SMT process timed out in 21067ms, After SMT, problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 21080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21127 ms. Remains : 363/371 places, 803/811 transitions.
[2024-05-28 17:07:53] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 17:07:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[78]
RANDOM walk for 1000000 steps (543 resets) in 3209 ms. (311 steps per ms)
BEST_FIRST walk for 1000001 steps (221 resets) in 1882 ms. (531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[78]
[2024-05-28 17:07:58] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 17:07:58] [INFO ] Invariant cache hit.
[2024-05-28 17:07:58] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-28 17:07:58] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 24 ms returned sat
[2024-05-28 17:07:59] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-05-28 17:07:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:07:59] [INFO ] [Real]Added 72 Read/Feed constraints in 97 ms returned sat
[2024-05-28 17:07:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:07:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-28 17:07:59] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 26 ms returned sat
[2024-05-28 17:08:00] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2024-05-28 17:08:00] [INFO ] [Nat]Added 72 Read/Feed constraints in 251 ms returned sat
[2024-05-28 17:08:00] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 131 places in 240 ms of which 3 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 913 ms
[2024-05-28 17:08:01] [INFO ] Computed and/alt/rep : 417/1920/411 causal constraints (skipped 378 transitions) in 72 ms.
[2024-05-28 17:08:03] [INFO ] Added : 75 causal constraints over 15 iterations in 1719 ms. Result :sat
Minimization took 4590 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[78]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[78]
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 803/803 transitions.
Applied a total of 0 rules in 28 ms. Remains 363 /363 variables (removed 0) and now considering 803/803 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 363/363 places, 803/803 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 803/803 transitions.
Applied a total of 0 rules in 22 ms. Remains 363 /363 variables (removed 0) and now considering 803/803 (removed 0) transitions.
[2024-05-28 17:08:07] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 17:08:07] [INFO ] Invariant cache hit.
[2024-05-28 17:08:08] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-28 17:08:08] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 17:08:08] [INFO ] Invariant cache hit.
[2024-05-28 17:08:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:08:12] [INFO ] Implicit Places using invariants and state equation in 4369 ms returned []
Implicit Place search using SMT with State Equation took 4801 ms to find 0 implicit places.
[2024-05-28 17:08:12] [INFO ] Redundant transitions in 22 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-28 17:08:12] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 17:08:12] [INFO ] Invariant cache hit.
[2024-05-28 17:08:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:08:18] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:08:19] [INFO ] Deduced a trap composed of 114 places in 184 ms of which 3 ms to minimize.
[2024-05-28 17:08:19] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:08:19] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:08:22] [INFO ] Deduced a trap composed of 135 places in 183 ms of which 3 ms to minimize.
[2024-05-28 17:08:23] [INFO ] Deduced a trap composed of 149 places in 177 ms of which 3 ms to minimize.
[2024-05-28 17:08:23] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:08:23] [INFO ] Deduced a trap composed of 145 places in 152 ms of which 3 ms to minimize.
[2024-05-28 17:08:24] [INFO ] Deduced a trap composed of 142 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 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 TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/363 variables, 10/59 constraints. Problems are: Problem set: 66 solved, 735 unsolved
[2024-05-28 17:08:38] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 3 ms to minimize.
[2024-05-28 17:08:38] [INFO ] Deduced a trap composed of 112 places in 201 ms of which 3 ms to minimize.
[2024-05-28 17:08:42] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:08:42] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
[2024-05-28 17:08:43] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/1154 variables, and 64 constraints, problems are : Problem set: 66 solved, 735 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 66 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 66 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 14/32 constraints. Problems are: Problem set: 66 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 19/51 constraints. Problems are: Problem set: 66 solved, 735 unsolved
[2024-05-28 17:08:48] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:08:48] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:08:48] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:08:50] [INFO ] Deduced a trap composed of 195 places in 219 ms of which 3 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 205 places in 187 ms of which 3 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 192 places in 219 ms of which 2 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 189 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 192 places in 190 ms of which 2 ms to minimize.
[2024-05-28 17:08:52] [INFO ] Deduced a trap composed of 192 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:08:52] [INFO ] Deduced a trap composed of 183 places in 187 ms of which 3 ms to minimize.
[2024-05-28 17:08:52] [INFO ] Deduced a trap composed of 192 places in 183 ms of which 2 ms to minimize.
[2024-05-28 17:08:52] [INFO ] Deduced a trap composed of 192 places in 188 ms of which 3 ms to minimize.
[2024-05-28 17:08:52] [INFO ] Deduced a trap composed of 186 places in 191 ms of which 3 ms to minimize.
[2024-05-28 17:08:53] [INFO ] Deduced a trap composed of 183 places in 187 ms of which 3 ms to minimize.
[2024-05-28 17:08:53] [INFO ] Deduced a trap composed of 189 places in 195 ms of which 3 ms to minimize.
[2024-05-28 17:08:53] [INFO ] Deduced a trap composed of 202 places in 166 ms of which 3 ms to minimize.
[2024-05-28 17:08:53] [INFO ] Deduced a trap composed of 196 places in 153 ms of which 2 ms to minimize.
[2024-05-28 17:08:53] [INFO ] Deduced a trap composed of 192 places in 168 ms of which 3 ms to minimize.
[2024-05-28 17:08:54] [INFO ] Deduced a trap composed of 182 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:08:54] [INFO ] Deduced a trap composed of 196 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/71 constraints. Problems are: Problem set: 66 solved, 735 unsolved
[2024-05-28 17:09:06] [INFO ] Deduced a trap composed of 117 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1154 variables, and 72 constraints, problems are : Problem set: 66 solved, 735 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 14/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/801 constraints, Known Traps: 40/43 constraints]
After SMT, in 61135ms problems are : Problem set: 66 solved, 735 unsolved
Search for dead transitions found 66 dead transitions in 61149ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 363/363 places, 737/803 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 361 transition count 725
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 349 transition count 713
Applied a total of 14 rules in 13 ms. Remains 349 /363 variables (removed 14) and now considering 713/737 (removed 24) transitions.
[2024-05-28 17:09:13] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2024-05-28 17:09:13] [INFO ] Computed 42 invariants in 7 ms
[2024-05-28 17:09:14] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-28 17:09:14] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2024-05-28 17:09:14] [INFO ] Invariant cache hit.
[2024-05-28 17:09:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:09:17] [INFO ] Implicit Places using invariants and state equation in 2800 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 349/363 places, 713/803 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69192 ms. Remains : 349/363 places, 713/803 transitions.
[2024-05-28 17:09:17] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2024-05-28 17:09:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[78]
RANDOM walk for 1000000 steps (506 resets) in 2941 ms. (339 steps per ms)
BEST_FIRST walk for 1000000 steps (212 resets) in 1370 ms. (729 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[78]
[2024-05-28 17:09:21] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2024-05-28 17:09:21] [INFO ] Invariant cache hit.
[2024-05-28 17:09:21] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-28 17:09:21] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-28 17:09:21] [INFO ] Flatten gal took : 53 ms
[2024-05-28 17:09:21] [INFO ] Flatten gal took : 42 ms
[2024-05-28 17:09:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12886377356731991538.gal : 6 ms
[2024-05-28 17:09:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7309141469714085411.prop : 0 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/ReachabilityCardinality12886377356731991538.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7309141469714085411.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-01 in 114382 ms.
[2024-05-28 17:09:21] [INFO ] Flatten gal took : 37 ms
Total runtime 966396 ms.

BK_STOP 1716916161741

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-S02J06T06"
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-S02J06T06, 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-171654446700245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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