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.r472-tajo-171620399400405.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q8m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399400405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q8m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717224095371

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:41:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:41:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:41:37] [INFO ] Load time of PNML (sax parser for PT used): 763 ms
[2024-06-01 06:41:37] [INFO ] Transformed 754 places.
[2024-06-01 06:41:37] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:41:37] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 980 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 42 ms.
Deduced a syphon composed of 474 places in 93 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:41:37] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-06-01 06:41:38] [INFO ] Computed 10 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
RANDOM walk for 10000 steps (54 resets) in 101 ms. (98 steps per ms)
BEST_FIRST walk for 110007 steps (135 resets) in 393 ms. (279 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
[2024-06-01 06:41:38] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-06-01 06:41:38] [INFO ] Invariant cache hit.
[2024-06-01 06:41:38] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:41:39] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2024-06-01 06:41:39] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 06:41:39] [INFO ] [Real]Added 303 Read/Feed constraints in 110 ms returned sat
[2024-06-01 06:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:41:40] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2024-06-01 06:41:40] [INFO ] [Nat]Added 303 Read/Feed constraints in 241 ms returned sat
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 98 places in 524 ms of which 20 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 54 places in 463 ms of which 2 ms to minimize.
[2024-06-01 06:41:42] [INFO ] Deduced a trap composed of 85 places in 437 ms of which 1 ms to minimize.
[2024-06-01 06:41:42] [INFO ] Deduced a trap composed of 62 places in 438 ms of which 2 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 14 places in 394 ms of which 2 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 7 places in 481 ms of which 9 ms to minimize.
[2024-06-01 06:41:44] [INFO ] Deduced a trap composed of 60 places in 439 ms of which 2 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 61 places in 429 ms of which 3 ms to minimize.
[2024-06-01 06:41:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:41:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:41:45] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-06-01 06:41:45] [INFO ] [Real]Added 303 Read/Feed constraints in 77 ms returned sat
[2024-06-01 06:41:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:41:46] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2024-06-01 06:41:46] [INFO ] [Nat]Added 303 Read/Feed constraints in 171 ms returned sat
[2024-06-01 06:41:47] [INFO ] Deduced a trap composed of 23 places in 440 ms of which 2 ms to minimize.
[2024-06-01 06:41:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 637 ms
[2024-06-01 06:41:47] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 369 ms.
[2024-06-01 06:41:48] [INFO ] Added : 9 causal constraints over 2 iterations in 941 ms. Result :sat
Minimization took 1136 ms.
[2024-06-01 06:41:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:41:49] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2024-06-01 06:41:50] [INFO ] [Real]Added 303 Read/Feed constraints in 93 ms returned sat
[2024-06-01 06:41:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:41:50] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2024-06-01 06:41:51] [INFO ] [Nat]Added 303 Read/Feed constraints in 322 ms returned sat
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 2 ms to minimize.
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 22 places in 403 ms of which 2 ms to minimize.
[2024-06-01 06:41:52] [INFO ] Deduced a trap composed of 102 places in 357 ms of which 2 ms to minimize.
[2024-06-01 06:41:52] [INFO ] Deduced a trap composed of 96 places in 293 ms of which 1 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 15 places in 378 ms of which 2 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 92 places in 341 ms of which 2 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 99 places in 369 ms of which 2 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 65 places in 357 ms of which 2 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3379 ms
[2024-06-01 06:41:54] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 414 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 06:41:55] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:41:55] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2024-06-01 06:41:56] [INFO ] [Real]Added 303 Read/Feed constraints in 75 ms returned sat
[2024-06-01 06:41:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:41:56] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-06-01 06:41:56] [INFO ] [Nat]Added 303 Read/Feed constraints in 134 ms returned sat
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 22 places in 390 ms of which 2 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 1 ms to minimize.
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 24 places in 367 ms of which 1 ms to minimize.
[2024-06-01 06:41:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1690 ms
[2024-06-01 06:41:58] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 276 ms.
[2024-06-01 06:41:59] [INFO ] Added : 10 causal constraints over 3 iterations in 1063 ms. Result :sat
Minimization took 1280 ms.
[2024-06-01 06:42:00] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:42:01] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-06-01 06:42:01] [INFO ] [Real]Added 303 Read/Feed constraints in 66 ms returned sat
[2024-06-01 06:42:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:42:02] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-06-01 06:42:02] [INFO ] [Nat]Added 303 Read/Feed constraints in 159 ms returned sat
[2024-06-01 06:42:03] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 287 ms.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 26 places in 699 ms of which 3 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 2 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1392 ms
[2024-06-01 06:42:06] [INFO ] Added : 18 causal constraints over 6 iterations in 3329 ms. Result :sat
Minimization took 725 ms.
[2024-06-01 06:42:06] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:42:07] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2024-06-01 06:42:07] [INFO ] [Real]Added 303 Read/Feed constraints in 90 ms returned sat
[2024-06-01 06:42:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:42:08] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2024-06-01 06:42:08] [INFO ] [Nat]Added 303 Read/Feed constraints in 186 ms returned sat
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 62 places in 492 ms of which 11 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 89 places in 460 ms of which 1 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 72 places in 498 ms of which 2 ms to minimize.
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 57 places in 604 ms of which 2 ms to minimize.
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 19 places in 466 ms of which 2 ms to minimize.
[2024-06-01 06:42:12] [INFO ] Deduced a trap composed of 49 places in 592 ms of which 2 ms to minimize.
[2024-06-01 06:42:12] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 2 ms to minimize.
[2024-06-01 06:42:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:42:13] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 06:42:13] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2024-06-01 06:42:13] [INFO ] [Real]Added 303 Read/Feed constraints in 68 ms returned sat
[2024-06-01 06:42:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:42:14] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-06-01 06:42:14] [INFO ] [Nat]Added 303 Read/Feed constraints in 124 ms returned sat
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 129 places in 607 ms of which 2 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 56 places in 475 ms of which 1 ms to minimize.
[2024-06-01 06:42:16] [INFO ] Deduced a trap composed of 120 places in 566 ms of which 2 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 57 places in 589 ms of which 2 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 142 places in 600 ms of which 3 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 38 places in 618 ms of which 5 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 120 places in 587 ms of which 2 ms to minimize.
[2024-06-01 06:42:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:42:19] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:42:20] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2024-06-01 06:42:20] [INFO ] [Real]Added 303 Read/Feed constraints in 54 ms returned sat
[2024-06-01 06:42:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:42:20] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-06-01 06:42:21] [INFO ] [Nat]Added 303 Read/Feed constraints in 326 ms returned sat
[2024-06-01 06:42:21] [INFO ] Deduced a trap composed of 23 places in 482 ms of which 2 ms to minimize.
[2024-06-01 06:42:22] [INFO ] Deduced a trap composed of 44 places in 400 ms of which 2 ms to minimize.
[2024-06-01 06:42:22] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 2 ms to minimize.
[2024-06-01 06:42:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1479 ms
[2024-06-01 06:42:22] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 242 ms.
[2024-06-01 06:42:23] [INFO ] Added : 10 causal constraints over 2 iterations in 834 ms. Result :sat
Minimization took 1140 ms.
[2024-06-01 06:42:24] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:42:25] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2024-06-01 06:42:25] [INFO ] [Real]Added 303 Read/Feed constraints in 69 ms returned sat
[2024-06-01 06:42:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:42:26] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2024-06-01 06:42:26] [INFO ] [Nat]Added 303 Read/Feed constraints in 157 ms returned sat
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 59 places in 285 ms of which 2 ms to minimize.
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 62 places in 336 ms of which 1 ms to minimize.
[2024-06-01 06:42:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 903 ms
[2024-06-01 06:42:27] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 305 ms.
[2024-06-01 06:42:27] [INFO ] Added : 6 causal constraints over 2 iterations in 816 ms. Result :sat
Minimization took 1179 ms.
[2024-06-01 06:42:29] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:42:29] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2024-06-01 06:42:30] [INFO ] [Real]Added 303 Read/Feed constraints in 77 ms returned sat
[2024-06-01 06:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:42:30] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2024-06-01 06:42:30] [INFO ] [Nat]Added 303 Read/Feed constraints in 312 ms returned sat
[2024-06-01 06:42:31] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 1 ms to minimize.
[2024-06-01 06:42:31] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-06-01 06:42:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 796 ms
[2024-06-01 06:42:32] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 294 ms.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 2 ms to minimize.
[2024-06-01 06:42:34] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2024-06-01 06:42:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 817 ms
[2024-06-01 06:42:34] [INFO ] Added : 22 causal constraints over 5 iterations in 2636 ms. Result :sat
Minimization took 644 ms.
[2024-06-01 06:42:35] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:42:35] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2024-06-01 06:42:35] [INFO ] [Real]Added 303 Read/Feed constraints in 111 ms returned sat
[2024-06-01 06:42:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:42:36] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-06-01 06:42:37] [INFO ] [Nat]Added 303 Read/Feed constraints in 366 ms returned sat
[2024-06-01 06:42:37] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 193 ms.
[2024-06-01 06:42:37] [INFO ] Added : 10 causal constraints over 2 iterations in 752 ms. Result :sat
Minimization took 1189 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
Support contains 11 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 431 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 ms. Remains : 269/280 places, 3871/3904 transitions.
[2024-06-01 06:42:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 11) seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
[2024-06-01 06:42:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-06-01 06:42:41] [INFO ] Computed 8 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
RANDOM walk for 1000002 steps (2 resets) in 3984 ms. (250 steps per ms)
BEST_FIRST walk for 11000008 steps (23 resets) in 22505 ms. (488 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
[2024-06-01 06:43:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:43:07] [INFO ] Invariant cache hit.
[2024-06-01 06:43:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:43:08] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2024-06-01 06:43:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:43:09] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2024-06-01 06:43:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:43:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 581 ms returned sat
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-06-01 06:43:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 274 ms.
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 1 ms to minimize.
[2024-06-01 06:43:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2024-06-01 06:43:11] [INFO ] Added : 10 causal constraints over 3 iterations in 1575 ms. Result :sat
Minimization took 3552 ms.
[2024-06-01 06:43:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:43:15] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2024-06-01 06:43:15] [INFO ] [Real]Added 283 Read/Feed constraints in 73 ms returned sat
[2024-06-01 06:43:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:43:16] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2024-06-01 06:43:16] [INFO ] [Nat]Added 283 Read/Feed constraints in 277 ms returned sat
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 34 places in 361 ms of which 1 ms to minimize.
[2024-06-01 06:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2024-06-01 06:43:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 289 ms.
[2024-06-01 06:43:18] [INFO ] Added : 3 causal constraints over 1 iterations in 726 ms. Result :sat
Minimization took 3822 ms.
[2024-06-01 06:43:22] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:43:22] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2024-06-01 06:43:22] [INFO ] [Real]Added 283 Read/Feed constraints in 72 ms returned sat
[2024-06-01 06:43:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:43:23] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2024-06-01 06:43:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 220 ms returned sat
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 503 ms
[2024-06-01 06:43:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 287 ms.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 70 places in 401 ms of which 2 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 670 ms
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 60 places in 375 ms of which 2 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 2 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1173 ms
[2024-06-01 06:43:27] [INFO ] Added : 5 causal constraints over 2 iterations in 3089 ms. Result :sat
Minimization took 3572 ms.
[2024-06-01 06:43:31] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:43:31] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-06-01 06:43:31] [INFO ] [Real]Added 283 Read/Feed constraints in 56 ms returned sat
[2024-06-01 06:43:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:43:32] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2024-06-01 06:43:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 154 ms returned sat
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 74 places in 443 ms of which 2 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 573 ms
[2024-06-01 06:43:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 273 ms.
[2024-06-01 06:43:33] [INFO ] Added : 3 causal constraints over 1 iterations in 690 ms. Result :sat
Minimization took 3721 ms.
[2024-06-01 06:43:37] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:43:38] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-06-01 06:43:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:43:39] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2024-06-01 06:43:39] [INFO ] [Nat]Added 283 Read/Feed constraints in 187 ms returned sat
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 13 places in 572 ms of which 2 ms to minimize.
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 133 places in 506 ms of which 2 ms to minimize.
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 62 places in 406 ms of which 2 ms to minimize.
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 41 places in 487 ms of which 2 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 33 places in 522 ms of which 2 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 2 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 18 places in 405 ms of which 2 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3868 ms
[2024-06-01 06:43:43] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 242 ms.
[2024-06-01 06:43:43] [INFO ] Added : 2 causal constraints over 1 iterations in 628 ms. Result :sat
Minimization took 3750 ms.
[2024-06-01 06:43:47] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:43:48] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-06-01 06:43:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:43:49] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2024-06-01 06:43:49] [INFO ] [Nat]Added 283 Read/Feed constraints in 159 ms returned sat
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 2 ms to minimize.
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 63 places in 459 ms of which 2 ms to minimize.
[2024-06-01 06:43:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1206 ms
[2024-06-01 06:43:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 220 ms.
[2024-06-01 06:43:51] [INFO ] Added : 2 causal constraints over 1 iterations in 606 ms. Result :sat
Minimization took 3507 ms.
[2024-06-01 06:43:54] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:43:55] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2024-06-01 06:43:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:43:56] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2024-06-01 06:43:56] [INFO ] [Nat]Added 283 Read/Feed constraints in 198 ms returned sat
[2024-06-01 06:43:56] [INFO ] Deduced a trap composed of 26 places in 451 ms of which 1 ms to minimize.
[2024-06-01 06:43:57] [INFO ] Deduced a trap composed of 52 places in 378 ms of which 1 ms to minimize.
[2024-06-01 06:43:57] [INFO ] Deduced a trap composed of 14 places in 432 ms of which 1 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 64 places in 395 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 46 places in 375 ms of which 2 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 62 places in 370 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 59 places in 426 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 23 places in 369 ms of which 2 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4195 ms
[2024-06-01 06:44:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 306 ms.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 91 places in 511 ms of which 2 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 760 ms
[2024-06-01 06:44:02] [INFO ] Added : 5 causal constraints over 2 iterations in 1827 ms. Result :sat
Minimization took 3585 ms.
[2024-06-01 06:44:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:44:06] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2024-06-01 06:44:06] [INFO ] [Real]Added 283 Read/Feed constraints in 53 ms returned sat
[2024-06-01 06:44:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:44:07] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2024-06-01 06:44:07] [INFO ] [Nat]Added 283 Read/Feed constraints in 223 ms returned sat
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 26 places in 558 ms of which 1 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 79 places in 389 ms of which 2 ms to minimize.
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 64 places in 420 ms of which 2 ms to minimize.
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 1 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 1 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 1 ms to minimize.
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2024-06-01 06:44:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3308 ms
[2024-06-01 06:44:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 279 ms.
[2024-06-01 06:44:12] [INFO ] Deduced a trap composed of 56 places in 346 ms of which 2 ms to minimize.
[2024-06-01 06:44:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 610 ms
[2024-06-01 06:44:12] [INFO ] Added : 4 causal constraints over 1 iterations in 1446 ms. Result :sat
Minimization took 3571 ms.
[2024-06-01 06:44:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:44:16] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2024-06-01 06:44:17] [INFO ] [Real]Added 283 Read/Feed constraints in 44 ms returned sat
[2024-06-01 06:44:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:44:17] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2024-06-01 06:44:17] [INFO ] [Nat]Added 283 Read/Feed constraints in 143 ms returned sat
[2024-06-01 06:44:18] [INFO ] Deduced a trap composed of 54 places in 352 ms of which 1 ms to minimize.
[2024-06-01 06:44:18] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 2 ms to minimize.
[2024-06-01 06:44:18] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 2 ms to minimize.
[2024-06-01 06:44:19] [INFO ] Deduced a trap composed of 54 places in 344 ms of which 1 ms to minimize.
[2024-06-01 06:44:19] [INFO ] Deduced a trap composed of 55 places in 350 ms of which 1 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 1 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 58 places in 356 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 36 places in 322 ms of which 2 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 1 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 55 places in 361 ms of which 2 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4708 ms
[2024-06-01 06:44:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 303 ms.
[2024-06-01 06:44:23] [INFO ] Added : 3 causal constraints over 1 iterations in 696 ms. Result :sat
Minimization took 3574 ms.
[2024-06-01 06:44:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:44:27] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2024-06-01 06:44:27] [INFO ] [Real]Added 283 Read/Feed constraints in 86 ms returned sat
[2024-06-01 06:44:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:44:28] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2024-06-01 06:44:28] [INFO ] [Nat]Added 283 Read/Feed constraints in 182 ms returned sat
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 1 ms to minimize.
[2024-06-01 06:44:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 462 ms
[2024-06-01 06:44:29] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 323 ms.
[2024-06-01 06:44:30] [INFO ] Added : 10 causal constraints over 3 iterations in 1142 ms. Result :sat
Minimization took 3602 ms.
[2024-06-01 06:44:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:44:34] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-06-01 06:44:34] [INFO ] [Real]Added 283 Read/Feed constraints in 64 ms returned sat
[2024-06-01 06:44:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:44:35] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2024-06-01 06:44:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 159 ms returned sat
[2024-06-01 06:44:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 290 ms.
[2024-06-01 06:44:36] [INFO ] Added : 9 causal constraints over 3 iterations in 1071 ms. Result :sat
Minimization took 3464 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
Support contains 11 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-06-01 06:44:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:44:40] [INFO ] Invariant cache hit.
[2024-06-01 06:44:41] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-06-01 06:44:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:44:41] [INFO ] Invariant cache hit.
[2024-06-01 06:44:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:44:43] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2435 ms to find 0 implicit places.
[2024-06-01 06:44:43] [INFO ] Redundant transitions in 447 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-06-01 06:44:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:44:43] [INFO ] Invariant cache hit.
[2024-06-01 06:44:43] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2024-06-01 06:45:59] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 9 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 3862 unsolved
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
[2024-06-01 06:46:20] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
[2024-06-01 06:46:20] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
[2024-06-01 06:46:20] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
Problem TDEAD2933 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2935 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2937 is UNSAT
Problem TDEAD2938 is UNSAT
Problem TDEAD2939 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2941 is UNSAT
Problem TDEAD2942 is UNSAT
Problem TDEAD2943 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2945 is UNSAT
Problem TDEAD2946 is UNSAT
Problem TDEAD2947 is UNSAT
Problem TDEAD2948 is UNSAT
Problem TDEAD2949 is UNSAT
Problem TDEAD2950 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2953 is UNSAT
Problem TDEAD2954 is UNSAT
Problem TDEAD2955 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD2957 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD2960 is UNSAT
Problem TDEAD2961 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2963 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2969 is UNSAT
Problem TDEAD2970 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD2973 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3132 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 15 constraints, problems are : Problem set: 621 solved, 3249 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 7/7 constraints]
After SMT, in 107949ms problems are : Problem set: 621 solved, 3249 unsolved
Search for dead transitions found 621 dead transitions in 108016ms
Found 621 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 621 transitions
Dead transitions reduction (with SMT) removed 621 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3250/3871 transitions.
Graph (complete) has 3864 edges and 269 vertex of which 255 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 0 output transitions
Reduce places removed 33 places and 960 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 222 transition count 2290
Reduce places removed 19 places and 405 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 53 place count 203 transition count 1885
Reduce places removed 10 places and 195 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 63 place count 193 transition count 1690
Reduce places removed 7 places and 81 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 70 place count 186 transition count 1609
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 184 transition count 1557
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 183 transition count 1538
Reduce places removed 1 places and 23 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 74 place count 182 transition count 1515
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 83 place count 173 transition count 1391
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 92 place count 173 transition count 1391
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 92 rules in 76 ms. Remains 173 /269 variables (removed 96) and now considering 1391/3250 (removed 1859) transitions.
[2024-06-01 06:46:31] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
// Phase 1: matrix 1288 rows 173 cols
[2024-06-01 06:46:31] [INFO ] Computed 11 invariants in 9 ms
[2024-06-01 06:46:32] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 06:46:32] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
[2024-06-01 06:46:32] [INFO ] Invariant cache hit.
[2024-06-01 06:46:32] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-06-01 06:46:33] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 173/269 places, 1391/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 112311 ms. Remains : 173/269 places, 1391/3871 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:46:33] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
Found an invariant !
This invariant on transitions {3=1, 1080=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 1080=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :[0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1, 1, 1, 1]
[2024-06-01 06:46:33] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
// Phase 1: matrix 1288 rows 169 cols
[2024-06-01 06:46:33] [INFO ] Computed 7 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 1000003 steps (2 resets) in 1913 ms. (522 steps per ms)
FORMULA BugTracking-PT-q8m008-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000005 steps (12 resets) in 5205 ms. (1152 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, 1, 1, 1, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2024-06-01 06:46:40] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
[2024-06-01 06:46:40] [INFO ] Invariant cache hit.
[2024-06-01 06:46:40] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:46:40] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-06-01 06:46:40] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-06-01 06:46:40] [INFO ] [Real]Added 140 Read/Feed constraints in 31 ms returned sat
[2024-06-01 06:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:46:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:46:41] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-06-01 06:46:41] [INFO ] [Nat]Added 140 Read/Feed constraints in 111 ms returned sat
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 1 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1390 ms
[2024-06-01 06:46:42] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 73 ms.
[2024-06-01 06:46:42] [INFO ] Added : 12 causal constraints over 3 iterations in 267 ms. Result :sat
Minimization took 557 ms.
[2024-06-01 06:46:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2024-06-01 06:46:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:46:43] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-06-01 06:46:43] [INFO ] [Real]Added 140 Read/Feed constraints in 18 ms returned sat
[2024-06-01 06:46:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:46:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:46:44] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-01 06:46:44] [INFO ] [Nat]Added 140 Read/Feed constraints in 63 ms returned sat
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 1 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 1 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1133 ms
[2024-06-01 06:46:45] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 83 ms.
[2024-06-01 06:46:45] [INFO ] Added : 11 causal constraints over 3 iterations in 279 ms. Result :sat
Minimization took 519 ms.
[2024-06-01 06:46:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:46:46] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-06-01 06:46:46] [INFO ] [Real]Added 140 Read/Feed constraints in 19 ms returned sat
[2024-06-01 06:46:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:46:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:46:46] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-06-01 06:46:46] [INFO ] [Nat]Added 140 Read/Feed constraints in 85 ms returned sat
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-06-01 06:46:47] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 100 ms.
[2024-06-01 06:46:47] [INFO ] Added : 6 causal constraints over 2 iterations in 356 ms. Result :sat
Minimization took 605 ms.
[2024-06-01 06:46:48] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:46:48] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-06-01 06:46:48] [INFO ] [Real]Added 140 Read/Feed constraints in 19 ms returned sat
[2024-06-01 06:46:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:46:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:46:48] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2024-06-01 06:46:48] [INFO ] [Nat]Added 140 Read/Feed constraints in 36 ms returned sat
[2024-06-01 06:46:48] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 79 ms.
[2024-06-01 06:46:48] [INFO ] Added : 4 causal constraints over 1 iterations in 208 ms. Result :sat
Minimization took 514 ms.
[2024-06-01 06:46:49] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:46:49] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-06-01 06:46:49] [INFO ] [Real]Added 140 Read/Feed constraints in 23 ms returned sat
[2024-06-01 06:46:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:46:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:46:50] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-01 06:46:50] [INFO ] [Nat]Added 140 Read/Feed constraints in 72 ms returned sat
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 54 places in 245 ms of which 2 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 2 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 1 ms to minimize.
[2024-06-01 06:46:51] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2024-06-01 06:46:51] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2024-06-01 06:46:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1294 ms
[2024-06-01 06:46:51] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 107 ms.
[2024-06-01 06:46:51] [INFO ] Added : 13 causal constraints over 3 iterations in 443 ms. Result :sat
Minimization took 677 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 1, 1, +inf, 1, 1, 1, 1, 1]
FORMULA BugTracking-PT-q8m008-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1, 1, 1]
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 1391/1391 transitions.
Applied a total of 0 rules in 36 ms. Remains 169 /169 variables (removed 0) and now considering 1391/1391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 169/169 places, 1391/1391 transitions.
[2024-06-01 06:46:52] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
Found an invariant !
This invariant on transitions {3=1, 1080=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 1080=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1, 1, 1]
[2024-06-01 06:46:53] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
[2024-06-01 06:46:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2205 ms. (453 steps per ms)
BEST_FIRST walk for 5000003 steps (10 resets) in 4434 ms. (1127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1, 1, 1]
[2024-06-01 06:46:59] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
[2024-06-01 06:46:59] [INFO ] Invariant cache hit.
[2024-06-01 06:46:59] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 06:47:00] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-06-01 06:47:00] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-06-01 06:47:00] [INFO ] [Real]Added 140 Read/Feed constraints in 27 ms returned sat
[2024-06-01 06:47:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:00] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-06-01 06:47:00] [INFO ] [Nat]Added 140 Read/Feed constraints in 106 ms returned sat
[2024-06-01 06:47:00] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 1 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1461 ms
[2024-06-01 06:47:02] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 67 ms.
[2024-06-01 06:47:02] [INFO ] Added : 12 causal constraints over 3 iterations in 223 ms. Result :sat
Minimization took 498 ms.
[2024-06-01 06:47:02] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:47:03] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-06-01 06:47:03] [INFO ] [Real]Added 140 Read/Feed constraints in 17 ms returned sat
[2024-06-01 06:47:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:03] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2024-06-01 06:47:03] [INFO ] [Nat]Added 140 Read/Feed constraints in 89 ms returned sat
[2024-06-01 06:47:03] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 1 ms to minimize.
[2024-06-01 06:47:03] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 1 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1049 ms
[2024-06-01 06:47:04] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 86 ms.
[2024-06-01 06:47:04] [INFO ] Added : 11 causal constraints over 3 iterations in 307 ms. Result :sat
Minimization took 573 ms.
[2024-06-01 06:47:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:05] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-06-01 06:47:05] [INFO ] [Real]Added 140 Read/Feed constraints in 16 ms returned sat
[2024-06-01 06:47:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:05] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-06-01 06:47:05] [INFO ] [Nat]Added 140 Read/Feed constraints in 71 ms returned sat
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 1 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-06-01 06:47:06] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 81 ms.
[2024-06-01 06:47:06] [INFO ] Added : 6 causal constraints over 2 iterations in 235 ms. Result :sat
Minimization took 520 ms.
[2024-06-01 06:47:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:07] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-06-01 06:47:07] [INFO ] [Real]Added 140 Read/Feed constraints in 19 ms returned sat
[2024-06-01 06:47:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:07] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-06-01 06:47:07] [INFO ] [Nat]Added 140 Read/Feed constraints in 35 ms returned sat
[2024-06-01 06:47:07] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 89 ms.
[2024-06-01 06:47:07] [INFO ] Added : 4 causal constraints over 1 iterations in 202 ms. Result :sat
Minimization took 503 ms.
[2024-06-01 06:47:08] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:08] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-06-01 06:47:08] [INFO ] [Real]Added 140 Read/Feed constraints in 21 ms returned sat
[2024-06-01 06:47:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:47:08] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 06:47:08] [INFO ] [Nat]Added 140 Read/Feed constraints in 69 ms returned sat
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 2 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1288 ms
[2024-06-01 06:47:10] [INFO ] Computed and/alt/rep : 439/1957/438 causal constraints (skipped 849 transitions) in 79 ms.
[2024-06-01 06:47:10] [INFO ] Added : 13 causal constraints over 3 iterations in 359 ms. Result :sat
Minimization took 655 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1, 1, 1]
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 1391/1391 transitions.
Applied a total of 0 rules in 19 ms. Remains 169 /169 variables (removed 0) and now considering 1391/1391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 169/169 places, 1391/1391 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 1391/1391 transitions.
Applied a total of 0 rules in 20 ms. Remains 169 /169 variables (removed 0) and now considering 1391/1391 (removed 0) transitions.
[2024-06-01 06:47:11] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
[2024-06-01 06:47:11] [INFO ] Invariant cache hit.
[2024-06-01 06:47:11] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 06:47:11] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
[2024-06-01 06:47:11] [INFO ] Invariant cache hit.
[2024-06-01 06:47:12] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-06-01 06:47:12] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2024-06-01 06:47:12] [INFO ] Redundant transitions in 79 ms returned []
Running 1390 sub problems to find dead transitions.
[2024-06-01 06:47:12] [INFO ] Flow matrix only has 1288 transitions (discarded 103 similar events)
[2024-06-01 06:47:12] [INFO ] Invariant cache hit.
[2024-06-01 06:47:12] [INFO ] State equation strengthened by 140 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:47:24] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 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 TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 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 TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 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 TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 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 TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 2/9 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
At refinement iteration 3 (OVERLAPS) 1288/1456 variables, 168/177 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 140/317 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1456/1457 variables, and 317 constraints, problems are : Problem set: 236 solved, 1154 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/169 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 236 solved, 1154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 2/9 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
At refinement iteration 3 (OVERLAPS) 1288/1456 variables, 168/177 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 140/317 constraints. Problems are: Problem set: 236 solved, 1154 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1368 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 936/1253 constraints. Problems are: Problem set: 349 solved, 1041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1456/1457 variables, and 1253 constraints, problems are : Problem set: 349 solved, 1041 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/169 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 936/1390 constraints, Known Traps: 2/2 constraints]
After SMT, in 65438ms problems are : Problem set: 349 solved, 1041 unsolved
Search for dead transitions found 349 dead transitions in 65465ms
Found 349 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 349 transitions
Dead transitions reduction (with SMT) removed 349 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 169/169 places, 1042/1391 transitions.
Reduce places removed 20 places and 264 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 149 transition count 778
Reduce places removed 10 places and 25 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 30 place count 139 transition count 753
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 138 transition count 751
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 34 place count 135 transition count 727
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 135 transition count 727
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 134 transition count 721
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 134 transition count 721
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 39 rules in 31 ms. Remains 134 /169 variables (removed 35) and now considering 721/1042 (removed 321) transitions.
[2024-06-01 06:48:18] [INFO ] Flow matrix only has 674 transitions (discarded 47 similar events)
// Phase 1: matrix 674 rows 134 cols
[2024-06-01 06:48:18] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 06:48:18] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 06:48:18] [INFO ] Flow matrix only has 674 transitions (discarded 47 similar events)
[2024-06-01 06:48:18] [INFO ] Invariant cache hit.
[2024-06-01 06:48:18] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-01 06:48:18] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 134/169 places, 721/1391 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67427 ms. Remains : 134/169 places, 721/1391 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:48:18] [INFO ] Flow matrix only has 674 transitions (discarded 47 similar events)
Found an invariant !
This invariant on transitions {4=1, 46=1, 498=1, 653=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 498=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1, 1, 1]
[2024-06-01 06:48:19] [INFO ] Flow matrix only has 674 transitions (discarded 47 similar events)
// Phase 1: matrix 674 rows 130 cols
[2024-06-01 06:48:19] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, +inf, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (3 resets) in 1813 ms. (551 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 922 ms. (1083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, +inf, 1, 1, 1, 1, 1]
[2024-06-01 06:48:21] [INFO ] Flow matrix only has 674 transitions (discarded 47 similar events)
[2024-06-01 06:48:21] [INFO ] Invariant cache hit.
[2024-06-01 06:48:22] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:48:22] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-06-01 06:48:22] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-01 06:48:22] [INFO ] [Real]Added 93 Read/Feed constraints in 21 ms returned sat
[2024-06-01 06:48:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:48:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:48:22] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-06-01 06:48:22] [INFO ] [Nat]Added 93 Read/Feed constraints in 18 ms returned sat
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 368 ms
[2024-06-01 06:48:22] [INFO ] Computed and/alt/rep : 245/930/245 causal constraints (skipped 428 transitions) in 33 ms.
[2024-06-01 06:48:22] [INFO ] Added : 19 causal constraints over 4 iterations in 213 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, +inf, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, +inf, 1, 1, 1, 1, 1]
Support contains 1 out of 130 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place x2_MUST_FIX_q7) removed 16 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 705/705 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 130/130 places, 705/705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 705/705 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 705/705 (removed 0) transitions.
[2024-06-01 06:48:23] [INFO ] Flow matrix only has 660 transitions (discarded 45 similar events)
// Phase 1: matrix 660 rows 130 cols
[2024-06-01 06:48:23] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 06:48:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 06:48:23] [INFO ] Flow matrix only has 660 transitions (discarded 45 similar events)
[2024-06-01 06:48:23] [INFO ] Invariant cache hit.
[2024-06-01 06:48:23] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-01 06:48:23] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-06-01 06:48:23] [INFO ] Redundant transitions in 13 ms returned []
Running 704 sub problems to find dead transitions.
[2024-06-01 06:48:23] [INFO ] Flow matrix only has 660 transitions (discarded 45 similar events)
[2024-06-01 06:48:23] [INFO ] Invariant cache hit.
[2024-06-01 06:48:23] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
Problem TDEAD480 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD475 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/8 constraints. Problems are: Problem set: 6 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 698 unsolved
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 5 (OVERLAPS) 660/790 variables, 130/139 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 92/231 constraints. Problems are: Problem set: 9 solved, 695 unsolved
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 1/232 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/790 variables, 0/232 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 9 (OVERLAPS) 0/790 variables, 0/232 constraints. Problems are: Problem set: 9 solved, 695 unsolved
No progress, stopping.
After SMT solving in domain Real declared 790/790 variables, and 232 constraints, problems are : Problem set: 9 solved, 695 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 9 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 2/9 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/10 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 5 (OVERLAPS) 660/790 variables, 130/140 constraints. Problems are: Problem set: 9 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 92/232 constraints. Problems are: Problem set: 9 solved, 695 unsolved
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 695/927 constraints. Problems are: Problem set: 47 solved, 657 unsolved
[2024-06-01 06:49:10] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
[2024-06-01 06:49:13] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-06-01 06:49:17] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:49:17] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:49:17] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:49:17] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:49:20] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:49:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/790 variables, 8/935 constraints. Problems are: Problem set: 159 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/790 variables, and 935 constraints, problems are : Problem set: 159 solved, 545 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 695/704 constraints, Known Traps: 10/10 constraints]
After SMT, in 61576ms problems are : Problem set: 159 solved, 545 unsolved
Search for dead transitions found 159 dead transitions in 61589ms
Found 159 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 159 transitions
Dead transitions reduction (with SMT) removed 159 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/130 places, 546/705 transitions.
Graph (complete) has 836 edges and 130 vertex of which 124 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 141 transitions.
Graph (complete) has 633 edges and 109 vertex of which 1 are kept as prefixes of interest. Removing 108 places using SCC suffix rule.1 ms
Discarding 108 places :
Also discarding 405 output transitions
Drop transitions (Output transitions of discarded places.) removed 405 transitions
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 17 rules in 4 ms. Remains 1 /130 variables (removed 129) and now considering 0/546 (removed 546) transitions.
[2024-06-01 06:49:25] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:49:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 06:49:25] [INFO ] Invariant cache hit.
[2024-06-01 06:49:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/130 places, 0/705 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62335 ms. Remains : 1/130 places, 0/705 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 468964 ms.
ITS solved all properties within timeout

BK_STOP 1717224565673

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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