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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717224012258

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-q8m004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:40:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:40:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:40:14] [INFO ] Load time of PNML (sax parser for PT used): 819 ms
[2024-06-01 06:40:14] [INFO ] Transformed 754 places.
[2024-06-01 06:40:14] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:40:14] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1078 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 474 places in 107 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:40:15] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-06-01 06:40:15] [INFO ] Computed 10 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1]
RANDOM walk for 10000 steps (113 resets) in 110 ms. (90 steps per ms)
FORMULA BugTracking-PT-q8m004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (157 resets) in 212 ms. (281 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
[2024-06-01 06:40:15] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-06-01 06:40:15] [INFO ] Invariant cache hit.
[2024-06-01 06:40:15] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 06:40:16] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2024-06-01 06:40:16] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 06:40:16] [INFO ] [Real]Added 303 Read/Feed constraints in 75 ms returned sat
[2024-06-01 06:40:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:40:17] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2024-06-01 06:40:17] [INFO ] [Nat]Added 303 Read/Feed constraints in 240 ms returned sat
[2024-06-01 06:40:17] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 464 ms.
[2024-06-01 06:40:18] [INFO ] Added : 6 causal constraints over 2 iterations in 1039 ms. Result :sat
Minimization took 1460 ms.
[2024-06-01 06:40:20] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 06:40:20] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2024-06-01 06:40:20] [INFO ] [Real]Added 303 Read/Feed constraints in 73 ms returned sat
[2024-06-01 06:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:40:21] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2024-06-01 06:40:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:40:22] [INFO ] [Nat]Added 303 Read/Feed constraints in 668 ms returned sat
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 30 places in 631 ms of which 17 ms to minimize.
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 58 places in 532 ms of which 3 ms to minimize.
[2024-06-01 06:40:24] [INFO ] Deduced a trap composed of 57 places in 596 ms of which 3 ms to minimize.
[2024-06-01 06:40:24] [INFO ] Deduced a trap composed of 59 places in 515 ms of which 2 ms to minimize.
[2024-06-01 06:40:25] [INFO ] Deduced a trap composed of 27 places in 565 ms of which 10 ms to minimize.
[2024-06-01 06:40:26] [INFO ] Deduced a trap composed of 12 places in 571 ms of which 3 ms to minimize.
[2024-06-01 06:40:26] [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 1
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:40:26] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:40:27] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2024-06-01 06:40:27] [INFO ] [Real]Added 303 Read/Feed constraints in 148 ms returned sat
[2024-06-01 06:40:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:40:28] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2024-06-01 06:40:28] [INFO ] [Nat]Added 303 Read/Feed constraints in 235 ms returned sat
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 2 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 20 places in 397 ms of which 3 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 1 ms to minimize.
[2024-06-01 06:40:30] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 2 ms to minimize.
[2024-06-01 06:40:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2014 ms
[2024-06-01 06:40:30] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 329 ms.
[2024-06-01 06:40:31] [INFO ] Added : 11 causal constraints over 3 iterations in 1070 ms. Result :sat
Minimization took 858 ms.
[2024-06-01 06:40:32] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 06:40:33] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2024-06-01 06:40:33] [INFO ] [Real]Added 303 Read/Feed constraints in 122 ms returned sat
[2024-06-01 06:40:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:40:34] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2024-06-01 06:40:34] [INFO ] [Nat]Added 303 Read/Feed constraints in 107 ms returned sat
[2024-06-01 06:40:34] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 375 ms.
[2024-06-01 06:40:35] [INFO ] Added : 2 causal constraints over 1 iterations in 777 ms. Result :sat
Minimization took 1688 ms.
[2024-06-01 06:40:37] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 06:40:37] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2024-06-01 06:40:37] [INFO ] [Real]Added 303 Read/Feed constraints in 67 ms returned sat
[2024-06-01 06:40:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:40:38] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2024-06-01 06:40:38] [INFO ] [Nat]Added 303 Read/Feed constraints in 145 ms returned sat
[2024-06-01 06:40:39] [INFO ] Deduced a trap composed of 15 places in 389 ms of which 2 ms to minimize.
[2024-06-01 06:40:39] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 2 ms to minimize.
[2024-06-01 06:40:40] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 2 ms to minimize.
[2024-06-01 06:40:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1463 ms
[2024-06-01 06:40:40] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 314 ms.
[2024-06-01 06:40:41] [INFO ] Added : 5 causal constraints over 1 iterations in 747 ms. Result :sat
Minimization took 1472 ms.
[2024-06-01 06:40:42] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:40:43] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2024-06-01 06:40:43] [INFO ] [Real]Added 303 Read/Feed constraints in 90 ms returned sat
[2024-06-01 06:40:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:40:44] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2024-06-01 06:40:44] [INFO ] [Nat]Added 303 Read/Feed constraints in 243 ms returned sat
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 52 places in 772 ms of which 2 ms to minimize.
[2024-06-01 06:40:46] [INFO ] Deduced a trap composed of 42 places in 688 ms of which 3 ms to minimize.
[2024-06-01 06:40:47] [INFO ] Deduced a trap composed of 14 places in 971 ms of which 2 ms to minimize.
[2024-06-01 06:40:47] [INFO ] Deduced a trap composed of 61 places in 649 ms of which 2 ms to minimize.
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 58 places in 588 ms of which 2 ms to minimize.
[2024-06-01 06:40:48] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
Support contains 6 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.36 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 4 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 577 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 593 ms. Remains : 269/280 places, 3871/3904 transitions.
[2024-06-01 06:40:49] [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 0 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 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
[2024-06-01 06:40:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-06-01 06:40:51] [INFO ] Computed 8 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
RANDOM walk for 1000001 steps (4 resets) in 7191 ms. (139 steps per ms)
BEST_FIRST walk for 6000006 steps (14 resets) in 12711 ms. (471 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
[2024-06-01 06:41:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:41:11] [INFO ] Invariant cache hit.
[2024-06-01 06:41:11] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-01 06:41:11] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2024-06-01 06:41:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:41:12] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2024-06-01 06:41:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:41:12] [INFO ] [Nat]Added 283 Read/Feed constraints in 276 ms returned sat
[2024-06-01 06:41:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 289 ms.
[2024-06-01 06:41:13] [INFO ] Added : 4 causal constraints over 1 iterations in 753 ms. Result :sat
Minimization took 4503 ms.
[2024-06-01 06:41:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:41:18] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2024-06-01 06:41:19] [INFO ] [Real]Added 283 Read/Feed constraints in 87 ms returned sat
[2024-06-01 06:41:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:41:19] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2024-06-01 06:41:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 173 ms returned sat
[2024-06-01 06:41:20] [INFO ] Deduced a trap composed of 39 places in 613 ms of which 2 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 38 places in 614 ms of which 2 ms to minimize.
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 38 places in 625 ms of which 2 ms to minimize.
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 19 places in 549 ms of which 3 ms to minimize.
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 33 places in 514 ms of which 2 ms to minimize.
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 40 places in 368 ms of which 1 ms to minimize.
[2024-06-01 06:41:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3950 ms
[2024-06-01 06:41:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 352 ms.
[2024-06-01 06:41:25] [INFO ] Deduced a trap composed of 60 places in 351 ms of which 2 ms to minimize.
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 62 places in 336 ms of which 3 ms to minimize.
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 2 ms to minimize.
[2024-06-01 06:41:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1578 ms
[2024-06-01 06:41:26] [INFO ] Added : 12 causal constraints over 3 iterations in 2890 ms. Result :sat
Minimization took 4599 ms.
[2024-06-01 06:41:31] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:41:32] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2024-06-01 06:41:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-06-01 06:41:33] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2024-06-01 06:41:33] [INFO ] [Nat]Added 283 Read/Feed constraints in 224 ms returned sat
[2024-06-01 06:41:33] [INFO ] Deduced a trap composed of 9 places in 610 ms of which 3 ms to minimize.
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 30 places in 347 ms of which 1 ms to minimize.
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 55 places in 357 ms of which 3 ms to minimize.
[2024-06-01 06:41:35] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 2 ms to minimize.
[2024-06-01 06:41:35] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 1 ms to minimize.
[2024-06-01 06:41:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2539 ms
[2024-06-01 06:41:36] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 332 ms.
[2024-06-01 06:41:37] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 2 ms to minimize.
[2024-06-01 06:41:37] [INFO ] Deduced a trap composed of 55 places in 332 ms of which 2 ms to minimize.
[2024-06-01 06:41:37] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 2 ms to minimize.
[2024-06-01 06:41:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1455 ms
[2024-06-01 06:41:38] [INFO ] Added : 8 causal constraints over 2 iterations in 2580 ms. Result :sat
Minimization took 4738 ms.
[2024-06-01 06:41:43] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:41:43] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2024-06-01 06:41:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:41:44] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2024-06-01 06:41:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 127 ms returned sat
[2024-06-01 06:41:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 354 ms.
[2024-06-01 06:41:45] [INFO ] Added : 2 causal constraints over 1 iterations in 719 ms. Result :sat
Minimization took 4505 ms.
[2024-06-01 06:41:50] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:41:51] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2024-06-01 06:41:51] [INFO ] [Real]Added 283 Read/Feed constraints in 68 ms returned sat
[2024-06-01 06:41:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:41:52] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2024-06-01 06:41:52] [INFO ] [Nat]Added 283 Read/Feed constraints in 171 ms returned sat
[2024-06-01 06:41:52] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 2 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 2 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 45 places in 385 ms of which 2 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 62 places in 421 ms of which 1 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 61 places in 403 ms of which 2 ms to minimize.
[2024-06-01 06:41:55] [INFO ] Deduced a trap composed of 32 places in 428 ms of which 2 ms to minimize.
[2024-06-01 06:41:55] [INFO ] Deduced a trap composed of 31 places in 391 ms of which 2 ms to minimize.
[2024-06-01 06:41:56] [INFO ] Deduced a trap composed of 61 places in 398 ms of which 2 ms to minimize.
[2024-06-01 06:41:56] [INFO ] Deduced a trap composed of 17 places in 368 ms of which 2 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 86 places in 405 ms of which 2 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 59 places in 418 ms of which 2 ms to minimize.
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 57 places in 421 ms of which 2 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 61 places in 401 ms of which 3 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 62 places in 430 ms of which 2 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 44 places in 454 ms of which 2 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 8239 ms
[2024-06-01 06:42:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 369 ms.
[2024-06-01 06:42:01] [INFO ] Added : 6 causal constraints over 2 iterations in 942 ms. Result :sat
Minimization took 4501 ms.
[2024-06-01 06:42:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:42:06] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-06-01 06:42:06] [INFO ] [Real]Added 283 Read/Feed constraints in 108 ms returned sat
[2024-06-01 06:42:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:42:07] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2024-06-01 06:42:07] [INFO ] [Nat]Added 283 Read/Feed constraints in 230 ms returned sat
[2024-06-01 06:42:07] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 2 ms to minimize.
[2024-06-01 06:42:08] [INFO ] Deduced a trap composed of 107 places in 472 ms of which 3 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 99 places in 472 ms of which 2 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 92 places in 450 ms of which 2 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 57 places in 432 ms of which 1 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 1 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3038 ms
[2024-06-01 06:42:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 317 ms.
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 96 places in 472 ms of which 2 ms to minimize.
[2024-06-01 06:42:12] [INFO ] Deduced a trap composed of 40 places in 468 ms of which 1 ms to minimize.
[2024-06-01 06:42:12] [INFO ] Deduced a trap composed of 14 places in 404 ms of which 1 ms to minimize.
[2024-06-01 06:42:13] [INFO ] Deduced a trap composed of 96 places in 427 ms of which 2 ms to minimize.
[2024-06-01 06:42:13] [INFO ] Deduced a trap composed of 26 places in 329 ms of which 2 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 56 places in 416 ms of which 2 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 2 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4016 ms
[2024-06-01 06:42:15] [INFO ] Added : 5 causal constraints over 1 iterations in 4819 ms. Result :sat
Minimization took 4095 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
Support contains 6 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 89 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 89 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 72 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-06-01 06:42:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:42:19] [INFO ] Invariant cache hit.
[2024-06-01 06:42:20] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-06-01 06:42:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:42:20] [INFO ] Invariant cache hit.
[2024-06-01 06:42:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:42:22] [INFO ] Implicit Places using invariants and state equation in 2469 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
[2024-06-01 06:42:23] [INFO ] Redundant transitions in 340 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-06-01 06:42:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:42:23] [INFO ] Invariant cache hit.
[2024-06-01 06:42:23] [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:43:43] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 timeout
1.0) 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 30078 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:44:03] [INFO ] Deduced a trap composed of 8 places in 80 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:44:03] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 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:44:03] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
[2024-06-01 06:44:03] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
[2024-06-01 06:44:03] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 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:44:08] [INFO ] Deduced a trap composed of 17 places in 100 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
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
Problem TDEAD3830 is UNSAT
Problem TDEAD3831 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3843 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3868 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 16 constraints, problems are : Problem set: 629 solved, 3241 unsolved in 30055 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: 8/8 constraints]
After SMT, in 112653ms problems are : Problem set: 629 solved, 3241 unsolved
Search for dead transitions found 629 dead transitions in 112785ms
Found 629 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 629 transitions
Dead transitions reduction (with SMT) removed 629 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3242/3871 transitions.
Graph (complete) has 3852 edges and 269 vertex of which 255 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 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 2282
Reduce places removed 21 places and 405 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 55 place count 201 transition count 1877
Reduce places removed 10 places and 195 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 65 place count 191 transition count 1682
Reduce places removed 6 places and 81 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 71 place count 185 transition count 1601
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 73 place count 183 transition count 1549
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 74 place count 182 transition count 1530
Reduce places removed 1 places and 23 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 75 place count 181 transition count 1507
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 84 place count 172 transition count 1383
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 93 place count 172 transition count 1383
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 93 rules in 146 ms. Remains 172 /269 variables (removed 97) and now considering 1383/3242 (removed 1859) transitions.
[2024-06-01 06:44:16] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
// Phase 1: matrix 1284 rows 172 cols
[2024-06-01 06:44:16] [INFO ] Computed 10 invariants in 5 ms
[2024-06-01 06:44:16] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-06-01 06:44:16] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-06-01 06:44:16] [INFO ] Invariant cache hit.
[2024-06-01 06:44:16] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-06-01 06:44:17] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 172/269 places, 1383/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 117811 ms. Remains : 172/269 places, 1383/3871 transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:44:17] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
Found an invariant !
This invariant on transitions {0=1, 1080=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 1080=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
[2024-06-01 06:44:18] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
// Phase 1: matrix 1284 rows 169 cols
[2024-06-01 06:44:18] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2629 ms. (380 steps per ms)
BEST_FIRST walk for 3000001 steps (11 resets) in 2922 ms. (1026 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
[2024-06-01 06:44:23] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-06-01 06:44:23] [INFO ] Invariant cache hit.
[2024-06-01 06:44:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:23] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-06-01 06:44:23] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-06-01 06:44:24] [INFO ] [Real]Added 140 Read/Feed constraints in 19 ms returned sat
[2024-06-01 06:44:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-01 06:44:24] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-06-01 06:44:24] [INFO ] [Nat]Added 140 Read/Feed constraints in 53 ms returned sat
[2024-06-01 06:44:24] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2024-06-01 06:44:24] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:44:24] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2024-06-01 06:44:24] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2024-06-01 06:44:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 588 ms
[2024-06-01 06:44:24] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 69 ms.
[2024-06-01 06:44:25] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2024-06-01 06:44:25] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2024-06-01 06:44:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2024-06-01 06:44:25] [INFO ] Added : 13 causal constraints over 3 iterations in 690 ms. Result :sat
Minimization took 546 ms.
[2024-06-01 06:44:26] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:26] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-06-01 06:44:26] [INFO ] [Real]Added 140 Read/Feed constraints in 22 ms returned sat
[2024-06-01 06:44:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:26] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-01 06:44:26] [INFO ] [Nat]Added 140 Read/Feed constraints in 39 ms returned sat
[2024-06-01 06:44:26] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-06-01 06:44:27] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2024-06-01 06:44:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2024-06-01 06:44:27] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 71 ms.
[2024-06-01 06:44:27] [INFO ] Added : 5 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 502 ms.
[2024-06-01 06:44:27] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:44:28] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-06-01 06:44:28] [INFO ] [Real]Added 140 Read/Feed constraints in 24 ms returned sat
[2024-06-01 06:44:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:44:28] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-01 06:44:28] [INFO ] [Nat]Added 140 Read/Feed constraints in 50 ms returned sat
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 1 ms to minimize.
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 1 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 1 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 1 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 1 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1258 ms
[2024-06-01 06:44:29] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 72 ms.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 1 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 638 ms
[2024-06-01 06:44:30] [INFO ] Added : 7 causal constraints over 2 iterations in 933 ms. Result :sat
Minimization took 565 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 1383/1383 transitions.
Applied a total of 0 rules in 25 ms. Remains 169 /169 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 169/169 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 1383/1383 transitions.
Applied a total of 0 rules in 22 ms. Remains 169 /169 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-06-01 06:44:31] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-06-01 06:44:31] [INFO ] Invariant cache hit.
[2024-06-01 06:44:31] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 06:44:31] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-06-01 06:44:31] [INFO ] Invariant cache hit.
[2024-06-01 06:44:32] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-06-01 06:44:32] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
[2024-06-01 06:44:32] [INFO ] Redundant transitions in 29 ms returned []
Running 1382 sub problems to find dead transitions.
[2024-06-01 06:44:32] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-06-01 06:44:32] [INFO ] Invariant cache hit.
[2024-06-01 06:44:32] [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, 1382 unsolved
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 10 places in 57 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 TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 2/9 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 3 (OVERLAPS) 1284/1452 variables, 168/177 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 140/317 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
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 1452/1453 variables, and 317 constraints, problems are : Problem set: 228 solved, 1154 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/169 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 1382/1382 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 228 solved, 1154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 2/9 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 3 (OVERLAPS) 1284/1452 variables, 168/177 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 140/317 constraints. Problems are: Problem set: 228 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 TDEAD1364 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1452 variables, 936/1253 constraints. Problems are: Problem set: 341 solved, 1041 unsolved
[2024-06-01 06:45:35] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:45:38] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 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 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 TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/1453 variables, and 1255 constraints, problems are : Problem set: 411 solved, 971 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/169 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 936/1382 constraints, Known Traps: 4/4 constraints]
After SMT, in 67301ms problems are : Problem set: 411 solved, 971 unsolved
Search for dead transitions found 411 dead transitions in 67324ms
Found 411 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 411 transitions
Dead transitions reduction (with SMT) removed 411 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 169/169 places, 972/1383 transitions.
Graph (complete) has 1364 edges and 169 vertex of which 166 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 23 places and 264 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 143 transition count 708
Reduce places removed 10 places and 25 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 34 place count 133 transition count 683
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 132 transition count 681
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 40 place count 127 transition count 629
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 45 place count 127 transition count 629
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 126 transition count 623
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 126 transition count 623
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 47 rules in 39 ms. Remains 126 /169 variables (removed 43) and now considering 623/972 (removed 349) transitions.
[2024-06-01 06:45:39] [INFO ] Flow matrix only has 574 transitions (discarded 49 similar events)
// Phase 1: matrix 574 rows 126 cols
[2024-06-01 06:45:40] [INFO ] Computed 8 invariants in 8 ms
[2024-06-01 06:45:40] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 06:45:40] [INFO ] Flow matrix only has 574 transitions (discarded 49 similar events)
[2024-06-01 06:45:40] [INFO ] Invariant cache hit.
[2024-06-01 06:45:40] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 06:45:41] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/169 places, 623/1383 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69648 ms. Remains : 126/169 places, 623/1383 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:45:41] [INFO ] Flow matrix only has 574 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {2=1, 398=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 398=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
[2024-06-01 06:45:41] [INFO ] Flow matrix only has 574 transitions (discarded 49 similar events)
// Phase 1: matrix 574 rows 125 cols
[2024-06-01 06:45:41] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
RANDOM walk for 1000002 steps (2 resets) in 2032 ms. (491 steps per ms)
BEST_FIRST walk for 2000001 steps (5 resets) in 1640 ms. (1218 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
[2024-06-01 06:45:45] [INFO ] Flow matrix only has 574 transitions (discarded 49 similar events)
[2024-06-01 06:45:45] [INFO ] Invariant cache hit.
[2024-06-01 06:45:45] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:45:45] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-01 06:45:45] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 06:45:45] [INFO ] [Real]Added 86 Read/Feed constraints in 10 ms returned sat
[2024-06-01 06:45:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:45:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:45:45] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-01 06:45:45] [INFO ] [Nat]Added 86 Read/Feed constraints in 16 ms returned sat
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2024-06-01 06:45:45] [INFO ] Computed and/alt/rep : 235/910/235 causal constraints (skipped 338 transitions) in 32 ms.
[2024-06-01 06:45:45] [INFO ] Added : 18 causal constraints over 4 iterations in 136 ms. Result :sat
Minimization took 123 ms.
[2024-06-01 06:45:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:45:46] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-01 06:45:46] [INFO ] [Real]Added 86 Read/Feed constraints in 11 ms returned sat
[2024-06-01 06:45:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:45:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:45:46] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-01 06:45:46] [INFO ] [Nat]Added 86 Read/Feed constraints in 25 ms returned sat
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 580 ms
[2024-06-01 06:45:46] [INFO ] Computed and/alt/rep : 235/910/235 causal constraints (skipped 338 transitions) in 26 ms.
[2024-06-01 06:45:46] [INFO ] Added : 14 causal constraints over 3 iterations in 104 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 623/623 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 623/623 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 125/125 places, 623/623 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 623/623 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 623/623 (removed 0) transitions.
[2024-06-01 06:45:47] [INFO ] Flow matrix only has 574 transitions (discarded 49 similar events)
[2024-06-01 06:45:47] [INFO ] Invariant cache hit.
[2024-06-01 06:45:47] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 06:45:47] [INFO ] Flow matrix only has 574 transitions (discarded 49 similar events)
[2024-06-01 06:45:47] [INFO ] Invariant cache hit.
[2024-06-01 06:45:47] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 06:45:47] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-06-01 06:45:47] [INFO ] Redundant transitions in 3 ms returned []
Running 622 sub problems to find dead transitions.
[2024-06-01 06:45:47] [INFO ] Flow matrix only has 574 transitions (discarded 49 similar events)
[2024-06-01 06:45:47] [INFO ] Invariant cache hit.
[2024-06-01 06:45:47] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-06-01 06:45:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
Problem TDEAD398 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 6 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 616 unsolved
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
At refinement iteration 3 (OVERLAPS) 574/699 variables, 125/133 constraints. Problems are: Problem set: 9 solved, 613 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 86/219 constraints. Problems are: Problem set: 9 solved, 613 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/219 constraints. Problems are: Problem set: 9 solved, 613 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/699 variables, 0/219 constraints. Problems are: Problem set: 9 solved, 613 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 219 constraints, problems are : Problem set: 9 solved, 613 unsolved in 27242 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 613 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 613 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 9 solved, 613 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 613 unsolved
At refinement iteration 3 (OVERLAPS) 574/699 variables, 125/133 constraints. Problems are: Problem set: 9 solved, 613 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 86/219 constraints. Problems are: Problem set: 9 solved, 613 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 613/832 constraints. Problems are: Problem set: 47 solved, 575 unsolved
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
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
[2024-06-01 06:46:29] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 4/836 constraints. Problems are: Problem set: 83 solved, 539 unsolved
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/699 variables, and 842 constraints, problems are : Problem set: 83 solved, 539 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 613/622 constraints, Known Traps: 11/11 constraints]
After SMT, in 58331ms problems are : Problem set: 83 solved, 539 unsolved
Search for dead transitions found 83 dead transitions in 58339ms
Found 83 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 83 transitions
Dead transitions reduction (with SMT) removed 83 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/125 places, 540/623 transitions.
Graph (complete) has 811 edges and 125 vertex of which 122 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 123 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 110 transition count 417
Reduce places removed 6 places and 57 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 104 transition count 360
Reduce places removed 2 places and 22 transitions.
Graph (complete) has 544 edges and 102 vertex of which 2 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 338 output transitions
Drop transitions (Output transitions of discarded places.) removed 338 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 22 rules in 21 ms. Remains 2 /125 variables (removed 123) and now considering 0/540 (removed 540) transitions.
[2024-06-01 06:46:46] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:46:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 06:46:46] [INFO ] Invariant cache hit.
[2024-06-01 06:46:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/125 places, 0/623 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58998 ms. Remains : 2/125 places, 0/623 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 392460 ms.
ITS solved all properties within timeout

BK_STOP 1717224406265

--------------------
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-q8m004"
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-q8m004, 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-171620399400397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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