About the Execution of GreatSPN+red for BugTracking-PT-q8m002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12663.836 | 446698.00 | 545009.00 | 143.20 | 0 0 0 0 0 2 0 0 0 0 0 ? 1 1 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398100389.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 greatspnxred
Input is BugTracking-PT-q8m002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100389
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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:23 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-q8m002-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716296393667
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:59:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 12:59:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:59:56] [INFO ] Load time of PNML (sax parser for PT used): 1014 ms
[2024-05-21 12:59:56] [INFO ] Transformed 754 places.
[2024-05-21 12:59:57] [INFO ] Transformed 27370 transitions.
[2024-05-21 12:59:57] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1444 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Deduced a syphon composed of 474 places in 92 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m002-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 12:59:57] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 12:59:57] [INFO ] Computed 10 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 2, +inf, 1, +inf, +inf, 1]
FORMULA BugTracking-PT-q8m002-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (207 resets) in 184 ms. (54 steps per ms)
FORMULA BugTracking-PT-q8m002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (329 resets) in 289 ms. (206 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 3] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 12:59:58] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 12:59:58] [INFO ] Invariant cache hit.
[2024-05-21 12:59:58] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 12:59:59] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2024-05-21 12:59:59] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 12:59:59] [INFO ] [Real]Added 303 Read/Feed constraints in 108 ms returned sat
[2024-05-21 12:59:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:59:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 13:00:00] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2024-05-21 13:00:00] [INFO ] [Nat]Added 303 Read/Feed constraints in 219 ms returned sat
[2024-05-21 13:00:01] [INFO ] Deduced a trap composed of 34 places in 735 ms of which 40 ms to minimize.
[2024-05-21 13:00:02] [INFO ] Deduced a trap composed of 36 places in 1053 ms of which 3 ms to minimize.
[2024-05-21 13:00:03] [INFO ] Deduced a trap composed of 20 places in 550 ms of which 3 ms to minimize.
[2024-05-21 13:00:04] [INFO ] Deduced a trap composed of 14 places in 698 ms of which 3 ms to minimize.
[2024-05-21 13:00:04] [INFO ] Deduced a trap composed of 55 places in 637 ms of which 2 ms to minimize.
[2024-05-21 13:00:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 13:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 13:00:05] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2024-05-21 13:00:05] [INFO ] [Real]Added 303 Read/Feed constraints in 80 ms returned sat
[2024-05-21 13:00:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:00:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 13:00:06] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2024-05-21 13:00:06] [INFO ] [Nat]Added 303 Read/Feed constraints in 267 ms returned sat
[2024-05-21 13:00:06] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2024-05-21 13:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2024-05-21 13:00:07] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 419 ms.
[2024-05-21 13:00:08] [INFO ] Added : 12 causal constraints over 3 iterations in 1282 ms. Result :sat
Minimization took 1292 ms.
[2024-05-21 13:00:09] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 13:00:10] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2024-05-21 13:00:10] [INFO ] [Real]Added 303 Read/Feed constraints in 110 ms returned sat
[2024-05-21 13:00:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:00:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 13:00:11] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2024-05-21 13:00:11] [INFO ] [Nat]Added 303 Read/Feed constraints in 277 ms returned sat
[2024-05-21 13:00:12] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 668 ms.
[2024-05-21 13:00:13] [INFO ] Added : 6 causal constraints over 2 iterations in 1349 ms. Result :sat
Minimization took 1199 ms.
[2024-05-21 13:00:14] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 13:00:15] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2024-05-21 13:00:15] [INFO ] [Real]Added 303 Read/Feed constraints in 78 ms returned sat
[2024-05-21 13:00:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:00:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 13:00:16] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2024-05-21 13:00:16] [INFO ] [Nat]Added 303 Read/Feed constraints in 64 ms returned sat
[2024-05-21 13:00:16] [INFO ] Deduced a trap composed of 11 places in 447 ms of which 2 ms to minimize.
[2024-05-21 13:00:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 627 ms
[2024-05-21 13:00:17] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 415 ms.
[2024-05-21 13:00:17] [INFO ] Added : 3 causal constraints over 2 iterations in 982 ms. Result :sat
Minimization took 1342 ms.
[2024-05-21 13:00:19] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-21 13:00:20] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-21 13:00:20] [INFO ] [Real]Added 303 Read/Feed constraints in 107 ms returned sat
[2024-05-21 13:00:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:00:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 13:00:21] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2024-05-21 13:00:21] [INFO ] [Nat]Added 303 Read/Feed constraints in 191 ms returned sat
[2024-05-21 13:00:22] [INFO ] Deduced a trap composed of 40 places in 766 ms of which 3 ms to minimize.
[2024-05-21 13:00:22] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 0 ms to minimize.
[2024-05-21 13:00:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1528 ms
[2024-05-21 13:00:23] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 346 ms.
[2024-05-21 13:00:23] [INFO ] Added : 5 causal constraints over 1 iterations in 827 ms. Result :sat
Minimization took 1406 ms.
[2024-05-21 13:00:25] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 13:00:25] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-05-21 13:00:25] [INFO ] [Real]Added 303 Read/Feed constraints in 89 ms returned sat
[2024-05-21 13:00:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:00:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 13:00:26] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2024-05-21 13:00:26] [INFO ] [Nat]Added 303 Read/Feed constraints in 69 ms returned sat
[2024-05-21 13:00:27] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 313 ms.
[2024-05-21 13:00:27] [INFO ] Added : 2 causal constraints over 1 iterations in 716 ms. Result :sat
Minimization took 1652 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 3] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 3] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
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.33 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 847 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 899 ms. Remains : 269/280 places, 3871/3904 transitions.
[2024-05-21 13:00:30] [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 12 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 242 ms. (steps per millisecond=41 ) 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, 1, 3] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 13:00:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-21 13:00:32] [INFO ] Computed 8 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 3] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 7034 ms. (142 steps per ms)
BEST_FIRST walk for 6000005 steps (21 resets) in 12140 ms. (494 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 13:00:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:00:51] [INFO ] Invariant cache hit.
[2024-05-21 13:00:51] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-05-21 13:00:52] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2024-05-21 13:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:00:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 13:00:52] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-05-21 13:00:52] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:00:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 201 ms returned sat
[2024-05-21 13:00:53] [INFO ] Deduced a trap composed of 41 places in 555 ms of which 2 ms to minimize.
[2024-05-21 13:00:54] [INFO ] Deduced a trap composed of 36 places in 619 ms of which 2 ms to minimize.
[2024-05-21 13:00:55] [INFO ] Deduced a trap composed of 28 places in 799 ms of which 1 ms to minimize.
[2024-05-21 13:00:56] [INFO ] Deduced a trap composed of 48 places in 696 ms of which 2 ms to minimize.
[2024-05-21 13:00:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3184 ms
[2024-05-21 13:00:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 315 ms.
[2024-05-21 13:00:57] [INFO ] Added : 1 causal constraints over 1 iterations in 751 ms. Result :sat
Minimization took 3579 ms.
[2024-05-21 13:01:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 13:01:01] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2024-05-21 13:01:02] [INFO ] [Real]Added 283 Read/Feed constraints in 88 ms returned sat
[2024-05-21 13:01:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:01:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:01:02] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2024-05-21 13:01:03] [INFO ] [Nat]Added 283 Read/Feed constraints in 141 ms returned sat
[2024-05-21 13:01:03] [INFO ] Deduced a trap composed of 22 places in 428 ms of which 3 ms to minimize.
[2024-05-21 13:01:04] [INFO ] Deduced a trap composed of 55 places in 464 ms of which 1 ms to minimize.
[2024-05-21 13:01:04] [INFO ] Deduced a trap composed of 18 places in 676 ms of which 1 ms to minimize.
[2024-05-21 13:01:07] [INFO ] Deduced a trap composed of 59 places in 2031 ms of which 27 ms to minimize.
[2024-05-21 13:01:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4096 ms
[2024-05-21 13:01:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 308 ms.
[2024-05-21 13:01:07] [INFO ] Added : 5 causal constraints over 1 iterations in 732 ms. Result :sat
Minimization took 3839 ms.
[2024-05-21 13:01:11] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:01:12] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-21 13:01:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:01:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:01:13] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2024-05-21 13:01:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 278 ms returned sat
[2024-05-21 13:01:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 569 ms.
[2024-05-21 13:01:14] [INFO ] Added : 4 causal constraints over 1 iterations in 1020 ms. Result :sat
Minimization took 3455 ms.
[2024-05-21 13:01:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:01:19] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2024-05-21 13:01:19] [INFO ] [Real]Added 283 Read/Feed constraints in 56 ms returned sat
[2024-05-21 13:01:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:01:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 13:01:20] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2024-05-21 13:01:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 61 ms returned sat
[2024-05-21 13:01:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 363 ms.
[2024-05-21 13:01:21] [INFO ] Added : 2 causal constraints over 1 iterations in 761 ms. Result :sat
Minimization took 3575 ms.
[2024-05-21 13:01:24] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 13:01:25] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2024-05-21 13:01:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:01:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:01:26] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2024-05-21 13:01:26] [INFO ] [Nat]Added 283 Read/Feed constraints in 228 ms returned sat
[2024-05-21 13:01:27] [INFO ] Deduced a trap composed of 10 places in 547 ms of which 2 ms to minimize.
[2024-05-21 13:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 754 ms
[2024-05-21 13:01:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 316 ms.
[2024-05-21 13:01:28] [INFO ] Deduced a trap composed of 33 places in 420 ms of which 1 ms to minimize.
[2024-05-21 13:01:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 725 ms
[2024-05-21 13:01:29] [INFO ] Added : 7 causal constraints over 3 iterations in 1993 ms. Result :sat
Minimization took 4731 ms.
[2024-05-21 13:01:34] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 13:01:35] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2024-05-21 13:01:35] [INFO ] [Real]Added 283 Read/Feed constraints in 155 ms returned sat
[2024-05-21 13:01:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:01:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 13:01:36] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2024-05-21 13:01:36] [INFO ] [Nat]Added 283 Read/Feed constraints in 99 ms returned sat
[2024-05-21 13:01:36] [INFO ] Deduced a trap composed of 47 places in 565 ms of which 2 ms to minimize.
[2024-05-21 13:01:37] [INFO ] Deduced a trap composed of 60 places in 511 ms of which 2 ms to minimize.
[2024-05-21 13:01:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1451 ms
[2024-05-21 13:01:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 534 ms.
[2024-05-21 13:01:38] [INFO ] Added : 1 causal constraints over 1 iterations in 950 ms. Result :sat
Minimization took 3406 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
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 80 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 80 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 155 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-21 13:01:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:01:42] [INFO ] Invariant cache hit.
[2024-05-21 13:01:43] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-21 13:01:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:01:43] [INFO ] Invariant cache hit.
[2024-05-21 13:01:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:01:46] [INFO ] Implicit Places using invariants and state equation in 2844 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
[2024-05-21 13:01:46] [INFO ] Redundant transitions in 306 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-05-21 13:01:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:01:46] [INFO ] Invariant cache hit.
[2024-05-21 13:01:46] [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-05-21 13:02:59] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
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 30122 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-05-21 13:03:18] [INFO ] Deduced a trap composed of 8 places in 140 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-05-21 13:03:18] [INFO ] Deduced a trap composed of 10 places in 136 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-05-21 13:03:18] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
[2024-05-21 13:03:18] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
[2024-05-21 13:03:19] [INFO ] Deduced a trap composed of 19 places in 135 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-05-21 13:03:23] [INFO ] Deduced a trap composed of 17 places in 94 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-05-21 13:03:30] [INFO ] Deduced a trap composed of 24 places in 100 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
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 7/16 constraints. Problems are: Problem set: 789 solved, 3081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 16 constraints, problems are : Problem set: 789 solved, 3081 unsolved in 30098 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 104125ms problems are : Problem set: 789 solved, 3081 unsolved
Search for dead transitions found 789 dead transitions in 104210ms
Found 789 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 789 transitions
Dead transitions reduction (with SMT) removed 789 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3082/3871 transitions.
Graph (complete) has 3704 edges and 269 vertex of which 254 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 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 221 transition count 2122
Reduce places removed 20 places and 405 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 54 place count 201 transition count 1717
Reduce places removed 11 places and 171 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 65 place count 190 transition count 1546
Reduce places removed 7 places and 64 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 72 place count 183 transition count 1482
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 181 transition count 1430
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 75 place count 180 transition count 1411
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 76 place count 179 transition count 1395
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 89 place count 166 transition count 1263
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 7 with 13 rules applied. Total rules applied 102 place count 166 transition count 1263
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 106 place count 162 transition count 1199
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 110 place count 162 transition count 1199
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 110 rules in 105 ms. Remains 162 /269 variables (removed 107) and now considering 1199/3082 (removed 1883) transitions.
[2024-05-21 13:03:30] [INFO ] Flow matrix only has 1092 transitions (discarded 107 similar events)
// Phase 1: matrix 1092 rows 162 cols
[2024-05-21 13:03:30] [INFO ] Computed 9 invariants in 11 ms
[2024-05-21 13:03:31] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-21 13:03:31] [INFO ] Flow matrix only has 1092 transitions (discarded 107 similar events)
[2024-05-21 13:03:31] [INFO ] Invariant cache hit.
[2024-05-21 13:03:31] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-21 13:03:31] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 162/269 places, 1199/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 109425 ms. Remains : 162/269 places, 1199/3871 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m002-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:03:31] [INFO ] Flow matrix only has 1092 transitions (discarded 107 similar events)
Found an invariant !
This invariant on transitions {5=1, 896=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 896=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :[0, 0, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 2, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 3
[2024-05-21 13:03:32] [INFO ] Flow matrix only has 1092 transitions (discarded 107 similar events)
// Phase 1: matrix 1092 rows 160 cols
[2024-05-21 13:03:32] [INFO ] Computed 7 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 3
RANDOM walk for 1000000 steps (2 resets) in 2576 ms. (388 steps per ms)
BEST_FIRST walk for 4000003 steps (13 resets) in 4134 ms. (967 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 9, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 3
[2024-05-21 13:03:39] [INFO ] Flow matrix only has 1092 transitions (discarded 107 similar events)
[2024-05-21 13:03:39] [INFO ] Invariant cache hit.
[2024-05-21 13:03:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 13:03:39] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-05-21 13:03:39] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-21 13:03:39] [INFO ] [Real]Added 125 Read/Feed constraints in 28 ms returned sat
[2024-05-21 13:03:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:03:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:03:39] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2024-05-21 13:03:39] [INFO ] [Nat]Added 125 Read/Feed constraints in 57 ms returned sat
[2024-05-21 13:03:40] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 2 ms to minimize.
[2024-05-21 13:03:40] [INFO ] Deduced a trap composed of 29 places in 253 ms of which 1 ms to minimize.
[2024-05-21 13:03:40] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2024-05-21 13:03:40] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 1 ms to minimize.
[2024-05-21 13:03:41] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 2 ms to minimize.
[2024-05-21 13:03:41] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 2 ms to minimize.
[2024-05-21 13:03:41] [INFO ] Deduced a trap composed of 61 places in 205 ms of which 1 ms to minimize.
[2024-05-21 13:03:41] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 2 ms to minimize.
[2024-05-21 13:03:42] [INFO ] Deduced a trap composed of 60 places in 191 ms of which 1 ms to minimize.
[2024-05-21 13:03:42] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 2 ms to minimize.
[2024-05-21 13:03:42] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 2 ms to minimize.
[2024-05-21 13:03:43] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 1 ms to minimize.
[2024-05-21 13:03:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3436 ms
[2024-05-21 13:03:43] [INFO ] Computed and/alt/rep : 408/1678/408 causal constraints (skipped 683 transitions) in 111 ms.
[2024-05-21 13:03:43] [INFO ] Added : 10 causal constraints over 3 iterations in 344 ms. Result :sat
Minimization took 462 ms.
[2024-05-21 13:03:44] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 13:03:44] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2024-05-21 13:03:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:03:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:03:44] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-05-21 13:03:44] [INFO ] [Nat]Added 125 Read/Feed constraints in 128 ms returned sat
[2024-05-21 13:03:44] [INFO ] Computed and/alt/rep : 408/1678/408 causal constraints (skipped 683 transitions) in 108 ms.
[2024-05-21 13:03:45] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 1 ms to minimize.
[2024-05-21 13:03:45] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2024-05-21 13:03:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 519 ms
[2024-05-21 13:03:46] [INFO ] Added : 20 causal constraints over 4 iterations in 1233 ms. Result :sat
Minimization took 550 ms.
[2024-05-21 13:03:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:03:46] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-05-21 13:03:46] [INFO ] [Real]Added 125 Read/Feed constraints in 20 ms returned sat
[2024-05-21 13:03:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:03:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:03:47] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-21 13:03:47] [INFO ] [Nat]Added 125 Read/Feed constraints in 40 ms returned sat
[2024-05-21 13:03:47] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 2 ms to minimize.
[2024-05-21 13:03:47] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2024-05-21 13:03:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2024-05-21 13:03:47] [INFO ] Computed and/alt/rep : 408/1678/408 causal constraints (skipped 683 transitions) in 101 ms.
[2024-05-21 13:03:47] [INFO ] Added : 6 causal constraints over 2 iterations in 250 ms. Result :sat
Minimization took 484 ms.
[2024-05-21 13:03:48] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 13:03:48] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-21 13:03:48] [INFO ] [Real]Added 125 Read/Feed constraints in 28 ms returned sat
[2024-05-21 13:03:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:03:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:03:49] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-05-21 13:03:49] [INFO ] [Nat]Added 125 Read/Feed constraints in 34 ms returned sat
[2024-05-21 13:03:49] [INFO ] Computed and/alt/rep : 408/1678/408 causal constraints (skipped 683 transitions) in 83 ms.
[2024-05-21 13:03:49] [INFO ] Added : 2 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 468 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 9, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 3
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 9, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 3
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1199/1199 transitions.
Applied a total of 0 rules in 16 ms. Remains 160 /160 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 160/160 places, 1199/1199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1199/1199 transitions.
Applied a total of 0 rules in 16 ms. Remains 160 /160 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-05-21 13:03:50] [INFO ] Flow matrix only has 1092 transitions (discarded 107 similar events)
[2024-05-21 13:03:50] [INFO ] Invariant cache hit.
[2024-05-21 13:03:50] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 13:03:50] [INFO ] Flow matrix only has 1092 transitions (discarded 107 similar events)
[2024-05-21 13:03:50] [INFO ] Invariant cache hit.
[2024-05-21 13:03:50] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-21 13:03:51] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2024-05-21 13:03:51] [INFO ] Redundant transitions in 23 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-21 13:03:51] [INFO ] Flow matrix only has 1092 transitions (discarded 107 similar events)
[2024-05-21 13:03:51] [INFO ] Invariant cache hit.
[2024-05-21 13:03:51] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-21 13:03:58] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-21 13:04:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
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 TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 2/9 constraints. Problems are: Problem set: 88 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/9 constraints. Problems are: Problem set: 88 solved, 1110 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1252 variables, 160/169 constraints. Problems are: Problem set: 88 solved, 1110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1252 variables, 125/294 constraints. Problems are: Problem set: 88 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 294 constraints, problems are : Problem set: 88 solved, 1110 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 88 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 88 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 2/9 constraints. Problems are: Problem set: 88 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/9 constraints. Problems are: Problem set: 88 solved, 1110 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1252 variables, 160/169 constraints. Problems are: Problem set: 88 solved, 1110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1252 variables, 125/294 constraints. Problems are: Problem set: 88 solved, 1110 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 TDEAD759 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1184 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1252 variables, 1110/1404 constraints. Problems are: Problem set: 241 solved, 957 unsolved
[2024-05-21 13:04:53] [INFO ] Deduced a trap composed of 21 places in 96 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 1252/1252 variables, and 1405 constraints, problems are : Problem set: 311 solved, 887 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 1110/1198 constraints, Known Traps: 3/3 constraints]
After SMT, in 64361ms problems are : Problem set: 311 solved, 887 unsolved
Search for dead transitions found 311 dead transitions in 64375ms
Found 311 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 311 transitions
Dead transitions reduction (with SMT) removed 311 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/160 places, 888/1199 transitions.
Graph (complete) has 1222 edges and 160 vertex of which 157 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 29 places and 349 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 128 transition count 539
Reduce places removed 12 places and 86 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 42 place count 116 transition count 453
Reduce places removed 5 places and 40 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 47 place count 111 transition count 413
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 109 transition count 397
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 108 transition count 392
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 54 place count 104 transition count 364
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 58 place count 104 transition count 364
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 103 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 103 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 60 rules in 24 ms. Remains 103 /160 variables (removed 57) and now considering 358/888 (removed 530) transitions.
[2024-05-21 13:04:55] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
// Phase 1: matrix 339 rows 103 cols
[2024-05-21 13:04:55] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 13:04:55] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 13:04:55] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
[2024-05-21 13:04:55] [INFO ] Invariant cache hit.
[2024-05-21 13:04:55] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 13:04:55] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/160 places, 358/1199 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65968 ms. Remains : 103/160 places, 358/1199 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m002-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:04:55] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {5=1, 264=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 264=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 9, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 3
[2024-05-21 13:04:56] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
// Phase 1: matrix 339 rows 101 cols
[2024-05-21 13:04:56] [INFO ] Computed 7 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 9, 1, 12] Max Struct:[+inf, 1, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 3
RANDOM walk for 1000000 steps (2 resets) in 1929 ms. (518 steps per ms)
FORMULA BugTracking-PT-q8m002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 593 ms. (1683 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
[2024-05-21 13:04:58] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
[2024-05-21 13:04:58] [INFO ] Invariant cache hit.
[2024-05-21 13:04:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:04:58] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-21 13:04:58] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 13:04:58] [INFO ] [Real]Added 64 Read/Feed constraints in 8 ms returned sat
[2024-05-21 13:04:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:04:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 13:04:58] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-21 13:04:58] [INFO ] [Nat]Added 64 Read/Feed constraints in 11 ms returned sat
[2024-05-21 13:04:59] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-21 13:04:59] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-21 13:04:59] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-05-21 13:04:59] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2024-05-21 13:04:59] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-21 13:04:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 686 ms
[2024-05-21 13:04:59] [INFO ] Computed and/alt/rep : 216/1011/216 causal constraints (skipped 122 transitions) in 29 ms.
[2024-05-21 13:04:59] [INFO ] Added : 7 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 358/358 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 101/101 places, 358/358 transitions.
[2024-05-21 13:04:59] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {5=1, 264=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 264=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
[2024-05-21 13:05:00] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
[2024-05-21 13:05:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 1000000 steps (6 resets) in 1716 ms. (582 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 695 ms. (1436 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
[2024-05-21 13:05:02] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
[2024-05-21 13:05:02] [INFO ] Invariant cache hit.
[2024-05-21 13:05:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:05:02] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 13:05:02] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 13:05:02] [INFO ] [Real]Added 64 Read/Feed constraints in 7 ms returned sat
[2024-05-21 13:05:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:05:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:05:02] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-21 13:05:02] [INFO ] [Nat]Added 64 Read/Feed constraints in 11 ms returned sat
[2024-05-21 13:05:02] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-21 13:05:03] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-21 13:05:03] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-21 13:05:03] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 14 ms to minimize.
[2024-05-21 13:05:03] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-21 13:05:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 555 ms
[2024-05-21 13:05:03] [INFO ] Computed and/alt/rep : 216/1011/216 causal constraints (skipped 122 transitions) in 14 ms.
[2024-05-21 13:05:03] [INFO ] Added : 7 causal constraints over 2 iterations in 79 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 358/358 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 358/358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 358/358 transitions.
Applied a total of 0 rules in 18 ms. Remains 101 /101 variables (removed 0) and now considering 358/358 (removed 0) transitions.
[2024-05-21 13:05:03] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
[2024-05-21 13:05:03] [INFO ] Invariant cache hit.
[2024-05-21 13:05:03] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 13:05:03] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
[2024-05-21 13:05:03] [INFO ] Invariant cache hit.
[2024-05-21 13:05:03] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 13:05:04] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-21 13:05:04] [INFO ] Redundant transitions in 1 ms returned []
Running 357 sub problems to find dead transitions.
[2024-05-21 13:05:04] [INFO ] Flow matrix only has 339 transitions (discarded 19 similar events)
[2024-05-21 13:05:04] [INFO ] Invariant cache hit.
[2024-05-21 13:05:04] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 2 (OVERLAPS) 339/440 variables, 101/108 constraints. Problems are: Problem set: 3 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 64/172 constraints. Problems are: Problem set: 3 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 354 unsolved
[2024-05-21 13:05:08] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/440 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 354 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 354 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 173 constraints, problems are : Problem set: 3 solved, 354 unsolved in 10960 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 354 unsolved
At refinement iteration 3 (OVERLAPS) 339/440 variables, 101/109 constraints. Problems are: Problem set: 3 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 64/173 constraints. Problems are: Problem set: 3 solved, 354 unsolved
Problem TDEAD186 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 354/527 constraints. Problems are: Problem set: 5 solved, 352 unsolved
[2024-05-21 13:05:20] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/528 constraints. Problems are: Problem set: 5 solved, 352 unsolved
[2024-05-21 13:05:24] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 13:05:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 2/530 constraints. Problems are: Problem set: 5 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/530 constraints. Problems are: Problem set: 5 solved, 352 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/530 constraints. Problems are: Problem set: 5 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 530 constraints, problems are : Problem set: 5 solved, 352 unsolved in 25092 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 354/357 constraints, Known Traps: 4/4 constraints]
After SMT, in 36638ms problems are : Problem set: 5 solved, 352 unsolved
Search for dead transitions found 5 dead transitions in 36643ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 353/358 transitions.
Reduce places removed 1 places and 11 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 342
Applied a total of 1 rules in 13 ms. Remains 100 /101 variables (removed 1) and now considering 342/353 (removed 11) transitions.
[2024-05-21 13:05:40] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
// Phase 1: matrix 324 rows 100 cols
[2024-05-21 13:05:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 13:05:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 13:05:40] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 13:05:40] [INFO ] Invariant cache hit.
[2024-05-21 13:05:40] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 13:05:41] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 100/101 places, 342/358 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37394 ms. Remains : 100/101 places, 342/358 transitions.
[2024-05-21 13:05:41] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
Found an invariant !
This invariant on transitions {4=1, 249=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 249=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
[2024-05-21 13:05:41] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 13:05:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 1000000 steps (2 resets) in 1703 ms. (586 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 709 ms. (1408 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
[2024-05-21 13:05:43] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 13:05:43] [INFO ] Invariant cache hit.
[2024-05-21 13:05:43] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 13:05:43] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-21 13:05:43] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 13:05:43] [INFO ] [Real]Added 63 Read/Feed constraints in 8 ms returned sat
[2024-05-21 13:05:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:05:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:05:43] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-21 13:05:43] [INFO ] [Nat]Added 63 Read/Feed constraints in 13 ms returned sat
[2024-05-21 13:05:43] [INFO ] Computed and/alt/rep : 202/958/202 causal constraints (skipped 121 transitions) in 20 ms.
[2024-05-21 13:05:44] [INFO ] Added : 36 causal constraints over 8 iterations in 174 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/100 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-05-21 13:05:44] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 13:05:44] [INFO ] Invariant cache hit.
[2024-05-21 13:05:44] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 13:05:44] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 13:05:44] [INFO ] Invariant cache hit.
[2024-05-21 13:05:44] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 13:05:44] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-21 13:05:44] [INFO ] Redundant transitions in 2 ms returned []
Running 341 sub problems to find dead transitions.
[2024-05-21 13:05:44] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 13:05:44] [INFO ] Invariant cache hit.
[2024-05-21 13:05:44] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 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 TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 2 (OVERLAPS) 324/424 variables, 100/107 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 63/170 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/170 constraints. Problems are: Problem set: 60 solved, 281 unsolved
[2024-05-21 13:05:48] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/424 variables, 1/171 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/171 constraints. Problems are: Problem set: 60 solved, 281 unsolved
[2024-05-21 13:05:53] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/424 variables, 1/172 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/172 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/172 constraints. Problems are: Problem set: 60 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 172 constraints, problems are : Problem set: 60 solved, 281 unsolved in 13451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 60 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/9 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 324/422 variables, 98/107 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 63/170 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 215/385 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/385 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 2/424 variables, 2/387 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 66/453 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/453 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/424 variables, 0/453 constraints. Problems are: Problem set: 60 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 453 constraints, problems are : Problem set: 60 solved, 281 unsolved in 14161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 281/341 constraints, Known Traps: 2/2 constraints]
After SMT, in 28061ms problems are : Problem set: 60 solved, 281 unsolved
Search for dead transitions found 60 dead transitions in 28066ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/100 places, 282/342 transitions.
Graph (complete) has 508 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 96 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 96 transition count 272
Applied a total of 5 rules in 6 ms. Remains 96 /100 variables (removed 4) and now considering 272/282 (removed 10) transitions.
[2024-05-21 13:06:12] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
// Phase 1: matrix 252 rows 96 cols
[2024-05-21 13:06:12] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 13:06:12] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 13:06:12] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:12] [INFO ] Invariant cache hit.
[2024-05-21 13:06:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:06:13] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/100 places, 272/342 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 28835 ms. Remains : 96/100 places, 272/342 transitions.
[2024-05-21 13:06:13] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
[2024-05-21 13:06:13] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 1000000 steps (2 resets) in 1615 ms. (618 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 665 ms. (1501 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
[2024-05-21 13:06:15] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:15] [INFO ] Invariant cache hit.
[2024-05-21 13:06:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:06:15] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-21 13:06:15] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:06:15] [INFO ] [Real]Added 55 Read/Feed constraints in 6 ms returned sat
[2024-05-21 13:06:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:06:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 13:06:15] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-21 13:06:15] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2024-05-21 13:06:15] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-21 13:06:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-21 13:06:15] [INFO ] Computed and/alt/rep : 211/1047/211 causal constraints (skipped 40 transitions) in 29 ms.
[2024-05-21 13:06:16] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-21 13:06:16] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-05-21 13:06:16] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-21 13:06:16] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-21 13:06:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 452 ms
[2024-05-21 13:06:16] [INFO ] Added : 98 causal constraints over 21 iterations in 897 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-21 13:06:16] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:16] [INFO ] Invariant cache hit.
[2024-05-21 13:06:17] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 13:06:17] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:17] [INFO ] Invariant cache hit.
[2024-05-21 13:06:17] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:06:17] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-21 13:06:17] [INFO ] Redundant transitions in 0 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-21 13:06:17] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:17] [INFO ] Invariant cache hit.
[2024-05-21 13:06:17] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/348 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 13:06:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7580 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 252/348 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 430 constraints, problems are : Problem set: 0 solved, 271 unsolved in 9921 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
After SMT, in 17712ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 17716ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18088 ms. Remains : 96/96 places, 272/272 transitions.
[2024-05-21 13:06:35] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 40000 steps (11 resets) in 617 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (14 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 30265 steps, run visited all 1 properties in 122 ms. (steps per millisecond=248 )
Probabilistic random walk after 30265 steps, saw 12850 distinct states, run finished after 130 ms. (steps per millisecond=232 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 9, 1, 12] Max Struct:[+inf, +inf, 1, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 2
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 13:06:35] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (4 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (6 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 13:06:35] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:35] [INFO ] Invariant cache hit.
[2024-05-21 13:06:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 13:06:35] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 13:06:35] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:06:35] [INFO ] [Real]Added 55 Read/Feed constraints in 6 ms returned sat
[2024-05-21 13:06:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:06:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 13:06:35] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 13:06:35] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-05-21 13:06:35] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-21 13:06:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-21 13:06:35] [INFO ] Computed and/alt/rep : 211/1047/211 causal constraints (skipped 40 transitions) in 19 ms.
[2024-05-21 13:06:36] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-21 13:06:36] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-21 13:06:36] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-21 13:06:36] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-21 13:06:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 452 ms
[2024-05-21 13:06:36] [INFO ] Added : 98 causal constraints over 21 iterations in 845 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 272/272 transitions.
[2024-05-21 13:06:37] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 13:06:37] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1780 ms. (561 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 664 ms. (1503 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-21 13:06:39] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:39] [INFO ] Invariant cache hit.
[2024-05-21 13:06:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 13:06:39] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-21 13:06:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:06:39] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-05-21 13:06:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:06:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 13:06:39] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-21 13:06:39] [INFO ] [Nat]Added 55 Read/Feed constraints in 14 ms returned sat
[2024-05-21 13:06:39] [INFO ] Computed and/alt/rep : 211/1047/211 causal constraints (skipped 40 transitions) in 18 ms.
[2024-05-21 13:06:40] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-21 13:06:40] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 13:06:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2024-05-21 13:06:40] [INFO ] Added : 79 causal constraints over 17 iterations in 481 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 96/96 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-21 13:06:40] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:40] [INFO ] Invariant cache hit.
[2024-05-21 13:06:40] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 13:06:40] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:40] [INFO ] Invariant cache hit.
[2024-05-21 13:06:40] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:06:40] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-21 13:06:40] [INFO ] Redundant transitions in 1 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-21 13:06:40] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:40] [INFO ] Invariant cache hit.
[2024-05-21 13:06:40] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/348 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 13:06:43] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 252/348 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 430 constraints, problems are : Problem set: 0 solved, 271 unsolved in 9250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
After SMT, in 16672ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 16677ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17006 ms. Remains : 96/96 places, 272/272 transitions.
[2024-05-21 13:06:57] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-21 13:06:57] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:06:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1581 ms. (632 steps per ms)
BEST_FIRST walk for 1000001 steps (4 resets) in 820 ms. (1218 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-21 13:07:00] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:07:00] [INFO ] Invariant cache hit.
[2024-05-21 13:07:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:07:00] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-21 13:07:00] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:07:00] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-05-21 13:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:07:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:07:00] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-21 13:07:00] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2024-05-21 13:07:00] [INFO ] Computed and/alt/rep : 211/1047/211 causal constraints (skipped 40 transitions) in 17 ms.
[2024-05-21 13:07:00] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-21 13:07:00] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 13:07:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-05-21 13:07:00] [INFO ] Added : 79 causal constraints over 17 iterations in 478 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 9 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 96/96 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-21 13:07:01] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:07:01] [INFO ] Invariant cache hit.
[2024-05-21 13:07:01] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 13:07:01] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:07:01] [INFO ] Invariant cache hit.
[2024-05-21 13:07:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:07:01] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-21 13:07:01] [INFO ] Redundant transitions in 0 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-21 13:07:01] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 13:07:01] [INFO ] Invariant cache hit.
[2024-05-21 13:07:01] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/348 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 13:07:04] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7184 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 252/348 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 430 constraints, problems are : Problem set: 0 solved, 271 unsolved in 9555 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
After SMT, in 17013ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 17018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17388 ms. Remains : 96/96 places, 272/272 transitions.
[2024-05-21 13:07:18] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40001 steps (18 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (18 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 32179 steps, run visited all 1 properties in 146 ms. (steps per millisecond=220 )
Probabilistic random walk after 32179 steps, saw 13543 distinct states, run finished after 147 ms. (steps per millisecond=218 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-11 in 43263 ms.
[2024-05-21 13:07:19] [INFO ] Flatten gal took : 75 ms
[2024-05-21 13:07:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-05-21 13:07:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 272 transitions and 1295 arcs took 8 ms.
Total runtime 443591 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BugTracking-PT-q8m002
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 96
TRANSITIONS: 272
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]
SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1174
MODEL NAME: /home/mcc/execution/419/model
96 places, 272 transitions.
Enabling coverability test.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 3 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716296840365
--------------------
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-q8m002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BugTracking-PT-q8m002, 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 r047-tajo-171620398100389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m002.tgz
mv BugTracking-PT-q8m002 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;