Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419400797.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400797
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 15K Feb 26 03:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 03:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 03:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 03:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.3M Mar 5 18:22 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 MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679616539068

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 00:09:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 00:09:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 00:09:00] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2023-03-24 00:09:00] [INFO ] Transformed 6876 places.
[2023-03-24 00:09:01] [INFO ] Transformed 9571 transitions.
[2023-03-24 00:09:01] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Normalized transition count is 9299 out of 9571 initially.
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-24 00:09:01] [INFO ] Computed 649 place invariants in 614 ms
Incomplete random walk after 10000 steps, including 121 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 16) seen :7
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :4
[2023-03-24 00:09:02] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-24 00:09:02] [INFO ] Computed 649 place invariants in 346 ms
[2023-03-24 00:09:04] [INFO ] [Real]Absence check using 54 positive place invariants in 92 ms returned sat
[2023-03-24 00:09:04] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 234 ms returned unsat
[2023-03-24 00:09:05] [INFO ] [Real]Absence check using 54 positive place invariants in 92 ms returned sat
[2023-03-24 00:09:05] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 243 ms returned unsat
[2023-03-24 00:09:06] [INFO ] [Real]Absence check using 54 positive place invariants in 80 ms returned sat
[2023-03-24 00:09:06] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 227 ms returned unsat
[2023-03-24 00:09:07] [INFO ] [Real]Absence check using 54 positive place invariants in 84 ms returned sat
[2023-03-24 00:09:07] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 226 ms returned unsat
[2023-03-24 00:09:08] [INFO ] [Real]Absence check using 54 positive place invariants in 93 ms returned sat
[2023-03-24 00:09:08] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 252 ms returned sat
[2023-03-24 00:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:09:12] [INFO ] [Real]Absence check using state equation in 3995 ms returned unknown
[2023-03-24 00:09:12] [INFO ] [Real]Absence check using 54 positive place invariants in 85 ms returned sat
[2023-03-24 00:09:13] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 263 ms returned sat
[2023-03-24 00:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:09:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:09:18] [INFO ] [Real]Absence check using 54 positive place invariants in 94 ms returned sat
[2023-03-24 00:09:18] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 224 ms returned unsat
[2023-03-24 00:09:19] [INFO ] [Real]Absence check using 54 positive place invariants in 88 ms returned sat
[2023-03-24 00:09:19] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 239 ms returned unsat
[2023-03-24 00:09:20] [INFO ] [Real]Absence check using 54 positive place invariants in 86 ms returned sat
[2023-03-24 00:09:20] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 231 ms returned unsat
[2023-03-24 00:09:21] [INFO ] [Real]Absence check using 54 positive place invariants in 83 ms returned sat
[2023-03-24 00:09:21] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 236 ms returned unsat
[2023-03-24 00:09:22] [INFO ] [Real]Absence check using 54 positive place invariants in 98 ms returned sat
[2023-03-24 00:09:22] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 251 ms returned sat
[2023-03-24 00:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:09:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:09:26] [INFO ] [Real]Absence check using 54 positive place invariants in 95 ms returned sat
[2023-03-24 00:09:27] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 226 ms returned unsat
[2023-03-24 00:09:27] [INFO ] [Real]Absence check using 54 positive place invariants in 79 ms returned sat
[2023-03-24 00:09:28] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 250 ms returned sat
[2023-03-24 00:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:09:32] [INFO ] [Real]Absence check using state equation in 4102 ms returned unknown
[2023-03-24 00:09:32] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-24 00:09:33] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 222 ms returned unsat
[2023-03-24 00:09:33] [INFO ] [Real]Absence check using 54 positive place invariants in 76 ms returned sat
[2023-03-24 00:09:34] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 252 ms returned sat
[2023-03-24 00:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:09:38] [INFO ] [Real]Absence check using state equation in 4120 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 51, 1, 1, 1, 1, 17, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.25 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2174 transitions
Trivial Post-agglo rules discarded 2174 transitions
Performed 2174 trivial Post agglomeration. Transition count delta: 2174
Iterating post reduction 0 with 2174 rules applied. Total rules applied 2175 place count 6840 transition count 7397
Reduce places removed 2174 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4350 place count 4666 transition count 7396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 7 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1902 places :
Symmetric choice reduction at 3 with 1902 rule applications. Total rules 6797 place count 2491 transition count 5222
Iterating global reduction 3 with 1902 rules applied. Total rules applied 8699 place count 2491 transition count 5222
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 8699 place count 2491 transition count 5208
Deduced a syphon composed of 14 places in 6 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 8727 place count 2477 transition count 5208
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 8963 place count 2241 transition count 3320
Iterating global reduction 3 with 236 rules applied. Total rules applied 9199 place count 2241 transition count 3320
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9233 place count 2224 transition count 3303
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 9394 place count 2224 transition count 4794
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 9555 place count 2063 transition count 4794
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 9589 place count 2063 transition count 4794
Applied a total of 9589 rules in 1928 ms. Remains 2063 /6876 variables (removed 4813) and now considering 4794/9571 (removed 4777) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1929 ms. Remains : 2063/6876 places, 4794/9571 transitions.
Normalized transition count is 4397 out of 4794 initially.
// Phase 1: matrix 4397 rows 2063 cols
[2023-03-24 00:09:40] [INFO ] Computed 613 place invariants in 77 ms
Incomplete random walk after 1000000 steps, including 20075 resets, run finished after 19194 ms. (steps per millisecond=52 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4466 ms. (steps per millisecond=223 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4378 ms. (steps per millisecond=228 ) properties (out of 5) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4410 ms. (steps per millisecond=226 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4375 ms. (steps per millisecond=228 ) properties (out of 4) seen :1
[2023-03-24 00:10:17] [INFO ] Flow matrix only has 4397 transitions (discarded 397 similar events)
// Phase 1: matrix 4397 rows 2063 cols
[2023-03-24 00:10:17] [INFO ] Computed 613 place invariants in 74 ms
[2023-03-24 00:10:17] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2023-03-24 00:10:17] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 109 ms returned sat
[2023-03-24 00:10:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:10:18] [INFO ] [Real]Absence check using state equation in 1426 ms returned sat
[2023-03-24 00:10:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:10:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 41 ms returned sat
[2023-03-24 00:10:19] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 111 ms returned sat
[2023-03-24 00:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:10:20] [INFO ] [Nat]Absence check using state equation in 1429 ms returned sat
[2023-03-24 00:10:20] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:10:23] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2069 ms returned sat
[2023-03-24 00:10:24] [INFO ] Deduced a trap composed of 482 places in 1645 ms of which 7 ms to minimize.
[2023-03-24 00:10:26] [INFO ] Deduced a trap composed of 211 places in 2015 ms of which 3 ms to minimize.
[2023-03-24 00:10:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4144 ms
[2023-03-24 00:10:27] [INFO ] Computed and/alt/rep : 1681/4436/1681 causal constraints (skipped 2699 transitions) in 424 ms.
[2023-03-24 00:10:29] [INFO ] Added : 22 causal constraints over 5 iterations in 2237 ms. Result :sat
[2023-03-24 00:10:29] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-24 00:10:29] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 51 ms returned unsat
[2023-03-24 00:10:30] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2023-03-24 00:10:30] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 110 ms returned sat
[2023-03-24 00:10:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:10:31] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2023-03-24 00:10:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:10:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2023-03-24 00:10:31] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 112 ms returned sat
[2023-03-24 00:10:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:10:33] [INFO ] [Nat]Absence check using state equation in 1438 ms returned sat
[2023-03-24 00:10:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 00:10:38] [INFO ] [Nat]Added 2722 Read/Feed constraints in 4836 ms returned sat
[2023-03-24 00:10:40] [INFO ] Deduced a trap composed of 407 places in 1720 ms of which 12 ms to minimize.
[2023-03-24 00:10:42] [INFO ] Deduced a trap composed of 253 places in 1859 ms of which 4 ms to minimize.
[2023-03-24 00:10:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3984 ms
[2023-03-24 00:10:43] [INFO ] Computed and/alt/rep : 1681/4436/1681 causal constraints (skipped 2699 transitions) in 937 ms.
[2023-03-24 00:10:44] [INFO ] Added : 22 causal constraints over 5 iterations in 2397 ms. Result :sat
[2023-03-24 00:10:44] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2023-03-24 00:10:45] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 107 ms returned sat
[2023-03-24 00:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:10:46] [INFO ] [Real]Absence check using state equation in 1543 ms returned sat
[2023-03-24 00:10:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:10:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-24 00:10:47] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 100 ms returned sat
[2023-03-24 00:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:10:48] [INFO ] [Nat]Absence check using state equation in 1409 ms returned sat
[2023-03-24 00:10:49] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1349 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 0] Max seen :[0, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 2063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2063/2063 places, 4794/4794 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2063 transition count 4793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2062 transition count 4793
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2062 transition count 4791
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 2060 transition count 4791
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 2058 transition count 4789
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 2058 transition count 4789
Applied a total of 10 rules in 385 ms. Remains 2058 /2063 variables (removed 5) and now considering 4789/4794 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 2058/2063 places, 4789/4794 transitions.
Normalized transition count is 4392 out of 4789 initially.
// Phase 1: matrix 4392 rows 2058 cols
[2023-03-24 00:10:50] [INFO ] Computed 613 place invariants in 71 ms
Incomplete random walk after 1000000 steps, including 20081 resets, run finished after 19162 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4329 ms. (steps per millisecond=231 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3878 resets, run finished after 4377 ms. (steps per millisecond=228 ) properties (out of 2) seen :0
[2023-03-24 00:11:18] [INFO ] Flow matrix only has 4392 transitions (discarded 397 similar events)
// Phase 1: matrix 4392 rows 2058 cols
[2023-03-24 00:11:18] [INFO ] Computed 613 place invariants in 73 ms
[2023-03-24 00:11:18] [INFO ] [Real]Absence check using 33 positive place invariants in 42 ms returned sat
[2023-03-24 00:11:18] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2023-03-24 00:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:11:20] [INFO ] [Real]Absence check using state equation in 1399 ms returned sat
[2023-03-24 00:11:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:11:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2023-03-24 00:11:20] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2023-03-24 00:11:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:11:22] [INFO ] [Nat]Absence check using state equation in 1427 ms returned sat
[2023-03-24 00:11:22] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:11:24] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2484 ms returned sat
[2023-03-24 00:11:26] [INFO ] Deduced a trap composed of 293 places in 1697 ms of which 4 ms to minimize.
[2023-03-24 00:11:28] [INFO ] Deduced a trap composed of 181 places in 1910 ms of which 2 ms to minimize.
[2023-03-24 00:11:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4051 ms
[2023-03-24 00:11:29] [INFO ] Computed and/alt/rep : 1678/4431/1678 causal constraints (skipped 2697 transitions) in 292 ms.
[2023-03-24 00:11:30] [INFO ] Added : 22 causal constraints over 5 iterations in 1908 ms. Result :sat
[2023-03-24 00:11:31] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2023-03-24 00:11:31] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 109 ms returned sat
[2023-03-24 00:11:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:11:32] [INFO ] [Real]Absence check using state equation in 1441 ms returned sat
[2023-03-24 00:11:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:11:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2023-03-24 00:11:33] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 116 ms returned sat
[2023-03-24 00:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:11:34] [INFO ] [Nat]Absence check using state equation in 1408 ms returned sat
[2023-03-24 00:11:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 00:11:40] [INFO ] [Nat]Added 2722 Read/Feed constraints in 6167 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 2058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2058/2058 places, 4789/4789 transitions.
Applied a total of 0 rules in 143 ms. Remains 2058 /2058 variables (removed 0) and now considering 4789/4789 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 2058/2058 places, 4789/4789 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2058/2058 places, 4789/4789 transitions.
Applied a total of 0 rules in 145 ms. Remains 2058 /2058 variables (removed 0) and now considering 4789/4789 (removed 0) transitions.
[2023-03-24 00:11:41] [INFO ] Flow matrix only has 4392 transitions (discarded 397 similar events)
[2023-03-24 00:11:41] [INFO ] Invariant cache hit.
[2023-03-24 00:11:46] [INFO ] Implicit Places using invariants in 5187 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 326, 327, 329, 331, 335, 341, 349, 359, 370, 380, 381, 382, 383, 384, 385, 386, 387, 388, 396, 402, 406, 408, 410, 412, 431, 437, 439, 440, 441, 442, 443, 444, 445, 446, 447, 449, 451, 453, 457, 463, 471, 480, 488, 489, 490, 491, 492, 493, 494, 495, 496, 502, 506, 508, 510, 512, 514, 533, 539, 541, 542, 543, 544, 545, 546, 547, 548, 549, 551, 553, 555, 557, 561, 567, 574, 580, 581, 582, 583, 584, 585, 586, 587, 588, 592, 594, 596, 598, 600, 602, 621, 627, 629, 630, 631, 632, 633, 634, 635, 636, 637, 639, 641, 643, 645, 647, 651, 656, 660, 661, 662, 663, 664, 665, 666, 667, 668, 670, 672, 674, 676, 678, 680, 699, 705, 707, 708, 709, 710, 711, 712, 713, 714, 715, 717, 719, 721, 723, 725, 727, 730, 732, 733, 734, 735, 736, 737, 738, 739, 740, 742, 744, 746, 748, 750, 752, 771, 777, 779, 780, 781, 782, 783, 784, 785, 786, 787, 789, 791, 793, 795, 797, 799, 801, 803, 804, 805, 806, 807, 808, 809, 810, 811, 813, 815, 817, 819, 821, 823, 842, 844, 847, 849, 850, 851, 852, 853, 854, 855, 856, 857, 859, 861, 863, 865, 867, 869, 871, 873, 874, 875, 876, 877, 878, 879, 880, 881, 883, 885, 887, 889, 891, 893, 912, 918, 920, 921, 922, 923, 924, 925, 926, 927, 928, 930, 932, 934, 936, 938, 940, 942, 944, 945, 946, 947, 948, 949, 950, 951, 952, 954, 956, 958, 960, 962, 964, 983, 989, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1001, 1003, 1005, 1007, 1009, 1011, 1013, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1026, 1028, 1030, 1032, 1034, 1036, 1055, 1061, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1073, 1075, 1077, 1079, 1081, 1083, 1087, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1104, 1106, 1108, 1110, 1112, 1114, 1133, 1139, 1141, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1151, 1153, 1155, 1157, 1159, 1163, 1169, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1190, 1194, 1196, 1198, 1200, 1202, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1288, 1294, 1298, 1301, 1303, 1305, 1324, 1330, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1342, 1344, 1346, 1350, 1356, 1364, 1374, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1403, 1411, 1417, 1421, 1423, 1425, 1444, 1450, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1462, 1464, 1468, 1474, 1482, 1492, 1504, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1537, 1547, 1555, 1561, 1565, 1567, 1586, 1588, 1591, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1603, 1607, 1613, 1621, 1631, 1643, 1657, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1694, 1706, 1716, 1724, 1730, 1734, 1753]
Discarding 564 places :
Implicit Place search using SMT only with invariants took 5206 ms to find 564 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1494/2058 places, 4789/4789 transitions.
Discarding 256 places :
Symmetric choice reduction at 0 with 256 rule applications. Total rules 256 place count 1238 transition count 4533
Iterating global reduction 0 with 256 rules applied. Total rules applied 512 place count 1238 transition count 4533
Discarding 256 places :
Symmetric choice reduction at 0 with 256 rule applications. Total rules 768 place count 982 transition count 4277
Iterating global reduction 0 with 256 rules applied. Total rules applied 1024 place count 982 transition count 4277
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1027 place count 982 transition count 4274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1030 place count 979 transition count 4274
Applied a total of 1030 rules in 320 ms. Remains 979 /1494 variables (removed 515) and now considering 4274/4789 (removed 515) transitions.
[2023-03-24 00:11:46] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:11:46] [INFO ] Computed 49 place invariants in 29 ms
[2023-03-24 00:11:47] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2023-03-24 00:11:47] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-24 00:11:47] [INFO ] Invariant cache hit.
[2023-03-24 00:11:48] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:12:10] [INFO ] Implicit Places using invariants and state equation in 22874 ms returned []
Implicit Place search using SMT with State Equation took 24101 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/2058 places, 4274/4789 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29772 ms. Remains : 979/2058 places, 4274/4789 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:12:10] [INFO ] Computed 49 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 21030 resets, run finished after 17200 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3020 resets, run finished after 3098 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3018 resets, run finished after 3109 ms. (steps per millisecond=321 ) properties (out of 2) seen :0
[2023-03-24 00:12:34] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:12:34] [INFO ] Computed 49 place invariants in 34 ms
[2023-03-24 00:12:34] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-24 00:12:34] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:12:35] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2023-03-24 00:12:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:12:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-24 00:12:35] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-24 00:12:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:12:36] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2023-03-24 00:12:36] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:12:37] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1681 ms returned sat
[2023-03-24 00:12:38] [INFO ] Deduced a trap composed of 205 places in 469 ms of which 1 ms to minimize.
[2023-03-24 00:12:39] [INFO ] Deduced a trap composed of 100 places in 591 ms of which 1 ms to minimize.
[2023-03-24 00:12:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1343 ms
[2023-03-24 00:12:39] [INFO ] Computed and/alt/rep : 1340/1931/1340 causal constraints (skipped 2475 transitions) in 208 ms.
[2023-03-24 00:12:40] [INFO ] Added : 17 causal constraints over 4 iterations in 958 ms. Result :sat
[2023-03-24 00:12:40] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-24 00:12:40] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-24 00:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:12:41] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2023-03-24 00:12:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:12:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-24 00:12:41] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:12:42] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2023-03-24 00:12:44] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2146 ms returned sat
[2023-03-24 00:12:45] [INFO ] Deduced a trap composed of 276 places in 462 ms of which 0 ms to minimize.
[2023-03-24 00:12:45] [INFO ] Deduced a trap composed of 82 places in 540 ms of which 0 ms to minimize.
[2023-03-24 00:12:46] [INFO ] Deduced a trap composed of 97 places in 542 ms of which 1 ms to minimize.
[2023-03-24 00:12:47] [INFO ] Deduced a trap composed of 91 places in 526 ms of which 1 ms to minimize.
[2023-03-24 00:12:48] [INFO ] Deduced a trap composed of 91 places in 531 ms of which 1 ms to minimize.
[2023-03-24 00:12:49] [INFO ] Deduced a trap composed of 121 places in 574 ms of which 0 ms to minimize.
[2023-03-24 00:12:49] [INFO ] Deduced a trap composed of 129 places in 542 ms of which 1 ms to minimize.
[2023-03-24 00:12:50] [INFO ] Deduced a trap composed of 121 places in 555 ms of which 1 ms to minimize.
[2023-03-24 00:12:51] [INFO ] Deduced a trap composed of 103 places in 556 ms of which 1 ms to minimize.
[2023-03-24 00:12:52] [INFO ] Deduced a trap composed of 92 places in 599 ms of which 1 ms to minimize.
[2023-03-24 00:12:52] [INFO ] Deduced a trap composed of 104 places in 549 ms of which 1 ms to minimize.
[2023-03-24 00:12:53] [INFO ] Deduced a trap composed of 97 places in 551 ms of which 4 ms to minimize.
[2023-03-24 00:12:54] [INFO ] Deduced a trap composed of 101 places in 567 ms of which 1 ms to minimize.
[2023-03-24 00:12:54] [INFO ] Deduced a trap composed of 112 places in 560 ms of which 1 ms to minimize.
[2023-03-24 00:12:56] [INFO ] Deduced a trap composed of 108 places in 569 ms of which 1 ms to minimize.
[2023-03-24 00:12:56] [INFO ] Deduced a trap composed of 276 places in 482 ms of which 1 ms to minimize.
[2023-03-24 00:12:57] [INFO ] Deduced a trap composed of 359 places in 551 ms of which 0 ms to minimize.
[2023-03-24 00:12:58] [INFO ] Deduced a trap composed of 82 places in 543 ms of which 1 ms to minimize.
[2023-03-24 00:12:59] [INFO ] Deduced a trap composed of 87 places in 553 ms of which 17 ms to minimize.
[2023-03-24 00:12:59] [INFO ] Deduced a trap composed of 222 places in 465 ms of which 1 ms to minimize.
[2023-03-24 00:13:00] [INFO ] Deduced a trap composed of 97 places in 587 ms of which 1 ms to minimize.
[2023-03-24 00:13:01] [INFO ] Deduced a trap composed of 96 places in 558 ms of which 1 ms to minimize.
[2023-03-24 00:13:02] [INFO ] Deduced a trap composed of 82 places in 554 ms of which 1 ms to minimize.
[2023-03-24 00:13:02] [INFO ] Deduced a trap composed of 97 places in 568 ms of which 1 ms to minimize.
[2023-03-24 00:13:03] [INFO ] Deduced a trap composed of 83 places in 549 ms of which 1 ms to minimize.
[2023-03-24 00:13:04] [INFO ] Deduced a trap composed of 87 places in 543 ms of which 4 ms to minimize.
[2023-03-24 00:13:05] [INFO ] Deduced a trap composed of 85 places in 571 ms of which 3 ms to minimize.
[2023-03-24 00:13:05] [INFO ] Deduced a trap composed of 199 places in 463 ms of which 1 ms to minimize.
[2023-03-24 00:13:06] [INFO ] Deduced a trap composed of 96 places in 552 ms of which 1 ms to minimize.
[2023-03-24 00:13:07] [INFO ] Deduced a trap composed of 94 places in 556 ms of which 1 ms to minimize.
[2023-03-24 00:13:08] [INFO ] Deduced a trap composed of 87 places in 538 ms of which 1 ms to minimize.
[2023-03-24 00:13:09] [INFO ] Deduced a trap composed of 84 places in 578 ms of which 0 ms to minimize.
[2023-03-24 00:13:10] [INFO ] Deduced a trap composed of 95 places in 572 ms of which 1 ms to minimize.
[2023-03-24 00:13:10] [INFO ] Deduced a trap composed of 82 places in 552 ms of which 0 ms to minimize.
[2023-03-24 00:13:11] [INFO ] Deduced a trap composed of 85 places in 572 ms of which 1 ms to minimize.
[2023-03-24 00:13:13] [INFO ] Deduced a trap composed of 108 places in 578 ms of which 1 ms to minimize.
[2023-03-24 00:13:14] [INFO ] Deduced a trap composed of 92 places in 587 ms of which 1 ms to minimize.
[2023-03-24 00:13:15] [INFO ] Deduced a trap composed of 101 places in 557 ms of which 1 ms to minimize.
[2023-03-24 00:13:16] [INFO ] Deduced a trap composed of 97 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:13:16] [INFO ] Deduced a trap composed of 88 places in 552 ms of which 1 ms to minimize.
[2023-03-24 00:13:17] [INFO ] Deduced a trap composed of 84 places in 566 ms of which 1 ms to minimize.
[2023-03-24 00:13:18] [INFO ] Deduced a trap composed of 95 places in 600 ms of which 1 ms to minimize.
[2023-03-24 00:13:18] [INFO ] Deduced a trap composed of 83 places in 588 ms of which 3 ms to minimize.
[2023-03-24 00:13:19] [INFO ] Deduced a trap composed of 286 places in 457 ms of which 0 ms to minimize.
[2023-03-24 00:13:20] [INFO ] Deduced a trap composed of 99 places in 566 ms of which 1 ms to minimize.
[2023-03-24 00:13:20] [INFO ] Deduced a trap composed of 88 places in 540 ms of which 1 ms to minimize.
[2023-03-24 00:13:21] [INFO ] Deduced a trap composed of 293 places in 534 ms of which 1 ms to minimize.
[2023-03-24 00:13:22] [INFO ] Deduced a trap composed of 103 places in 564 ms of which 3 ms to minimize.
[2023-03-24 00:13:22] [INFO ] Deduced a trap composed of 110 places in 519 ms of which 1 ms to minimize.
[2023-03-24 00:13:23] [INFO ] Deduced a trap composed of 95 places in 505 ms of which 1 ms to minimize.
[2023-03-24 00:13:24] [INFO ] Deduced a trap composed of 108 places in 579 ms of which 1 ms to minimize.
[2023-03-24 00:13:24] [INFO ] Deduced a trap composed of 91 places in 567 ms of which 1 ms to minimize.
[2023-03-24 00:13:25] [INFO ] Deduced a trap composed of 86 places in 590 ms of which 1 ms to minimize.
[2023-03-24 00:13:26] [INFO ] Deduced a trap composed of 70 places in 558 ms of which 1 ms to minimize.
[2023-03-24 00:13:26] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 41943 ms
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 105 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 106 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2023-03-24 00:13:26] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-24 00:13:26] [INFO ] Invariant cache hit.
[2023-03-24 00:13:28] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2023-03-24 00:13:28] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-24 00:13:28] [INFO ] Invariant cache hit.
[2023-03-24 00:13:29] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:13:49] [INFO ] Implicit Places using invariants and state equation in 21257 ms returned []
Implicit Place search using SMT with State Equation took 22480 ms to find 0 implicit places.
[2023-03-24 00:13:49] [INFO ] Redundant transitions in 319 ms returned []
[2023-03-24 00:13:49] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-24 00:13:49] [INFO ] Invariant cache hit.
[2023-03-24 00:13:51] [INFO ] Dead Transitions using invariants and state equation in 1550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24471 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:13:51] [INFO ] Computed 49 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
[2023-03-24 00:13:51] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:13:51] [INFO ] Computed 49 place invariants in 29 ms
[2023-03-24 00:13:51] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-24 00:13:51] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-24 00:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:13:52] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2023-03-24 00:13:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:13:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-24 00:13:52] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:13:53] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2023-03-24 00:13:53] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:13:55] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1802 ms returned sat
[2023-03-24 00:13:56] [INFO ] Deduced a trap composed of 205 places in 503 ms of which 1 ms to minimize.
[2023-03-24 00:13:56] [INFO ] Deduced a trap composed of 100 places in 572 ms of which 1 ms to minimize.
[2023-03-24 00:13:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1385 ms
[2023-03-24 00:13:57] [INFO ] Computed and/alt/rep : 1340/1931/1340 causal constraints (skipped 2475 transitions) in 219 ms.
[2023-03-24 00:13:58] [INFO ] Deduced a trap composed of 2 places in 701 ms of which 1 ms to minimize.
[2023-03-24 00:13:58] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 979 transition count 4273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 4273
Applied a total of 2 rules in 211 ms. Remains 978 /979 variables (removed 1) and now considering 4273/4274 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 978/979 places, 4273/4274 transitions.
Normalized transition count is 3875 out of 4273 initially.
// Phase 1: matrix 3875 rows 978 cols
[2023-03-24 00:13:58] [INFO ] Computed 49 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 21031 resets, run finished after 16951 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3014 resets, run finished after 3252 ms. (steps per millisecond=307 ) properties (out of 1) seen :0
[2023-03-24 00:14:18] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2023-03-24 00:14:18] [INFO ] Computed 49 place invariants in 28 ms
[2023-03-24 00:14:18] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-24 00:14:19] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-24 00:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:14:19] [INFO ] [Real]Absence check using state equation in 815 ms returned sat
[2023-03-24 00:14:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:14:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-24 00:14:20] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:14:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:14:20] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2023-03-24 00:14:21] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:14:21] [INFO ] [Nat]Added 2722 Read/Feed constraints in 613 ms returned sat
[2023-03-24 00:14:22] [INFO ] Deduced a trap composed of 145 places in 476 ms of which 1 ms to minimize.
[2023-03-24 00:14:22] [INFO ] Deduced a trap composed of 111 places in 585 ms of which 0 ms to minimize.
[2023-03-24 00:14:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1347 ms
[2023-03-24 00:14:23] [INFO ] Computed and/alt/rep : 1338/1928/1338 causal constraints (skipped 2475 transitions) in 230 ms.
[2023-03-24 00:14:23] [INFO ] Added : 17 causal constraints over 4 iterations in 1007 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 106 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 103 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2023-03-24 00:14:24] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2023-03-24 00:14:24] [INFO ] Invariant cache hit.
[2023-03-24 00:14:25] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2023-03-24 00:14:25] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2023-03-24 00:14:25] [INFO ] Invariant cache hit.
[2023-03-24 00:14:26] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:14:49] [INFO ] Implicit Places using invariants and state equation in 23659 ms returned []
Implicit Place search using SMT with State Equation took 24887 ms to find 0 implicit places.
[2023-03-24 00:14:49] [INFO ] Redundant transitions in 242 ms returned []
[2023-03-24 00:14:49] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2023-03-24 00:14:49] [INFO ] Invariant cache hit.
[2023-03-24 00:14:51] [INFO ] Dead Transitions using invariants and state equation in 1548 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26792 ms. Remains : 978/978 places, 4273/4273 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 in 59816 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:14:51] [INFO ] Computed 49 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 209 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
[2023-03-24 00:14:51] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:14:51] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-24 00:14:51] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-24 00:14:51] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:14:52] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2023-03-24 00:14:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:14:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-24 00:14:52] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:14:53] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2023-03-24 00:14:53] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:14:55] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2133 ms returned sat
[2023-03-24 00:14:56] [INFO ] Deduced a trap composed of 276 places in 522 ms of which 11 ms to minimize.
[2023-03-24 00:14:57] [INFO ] Deduced a trap composed of 82 places in 591 ms of which 1 ms to minimize.
[2023-03-24 00:14:57] [INFO ] Deduced a trap composed of 97 places in 572 ms of which 1 ms to minimize.
[2023-03-24 00:14:57] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 112 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 979/979 places, 4274/4274 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:14:57] [INFO ] Computed 49 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 21033 resets, run finished after 17202 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3013 resets, run finished after 3109 ms. (steps per millisecond=321 ) properties (out of 1) seen :0
[2023-03-24 00:15:18] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-24 00:15:18] [INFO ] Computed 49 place invariants in 27 ms
[2023-03-24 00:15:18] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-24 00:15:18] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:15:19] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2023-03-24 00:15:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:15:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-24 00:15:19] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:15:20] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2023-03-24 00:15:20] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:15:22] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2336 ms returned sat
[2023-03-24 00:15:23] [INFO ] Deduced a trap composed of 276 places in 507 ms of which 1 ms to minimize.
[2023-03-24 00:15:23] [INFO ] Deduced a trap composed of 82 places in 575 ms of which 1 ms to minimize.
[2023-03-24 00:15:24] [INFO ] Deduced a trap composed of 97 places in 560 ms of which 1 ms to minimize.
[2023-03-24 00:15:25] [INFO ] Deduced a trap composed of 91 places in 602 ms of which 1 ms to minimize.
[2023-03-24 00:15:26] [INFO ] Deduced a trap composed of 91 places in 567 ms of which 1 ms to minimize.
[2023-03-24 00:15:27] [INFO ] Deduced a trap composed of 121 places in 580 ms of which 1 ms to minimize.
[2023-03-24 00:15:28] [INFO ] Deduced a trap composed of 129 places in 547 ms of which 1 ms to minimize.
[2023-03-24 00:15:29] [INFO ] Deduced a trap composed of 121 places in 584 ms of which 2 ms to minimize.
[2023-03-24 00:15:29] [INFO ] Deduced a trap composed of 103 places in 598 ms of which 1 ms to minimize.
[2023-03-24 00:15:30] [INFO ] Deduced a trap composed of 92 places in 605 ms of which 1 ms to minimize.
[2023-03-24 00:15:31] [INFO ] Deduced a trap composed of 104 places in 609 ms of which 1 ms to minimize.
[2023-03-24 00:15:32] [INFO ] Deduced a trap composed of 97 places in 565 ms of which 1 ms to minimize.
[2023-03-24 00:15:32] [INFO ] Deduced a trap composed of 101 places in 591 ms of which 1 ms to minimize.
[2023-03-24 00:15:33] [INFO ] Deduced a trap composed of 112 places in 546 ms of which 1 ms to minimize.
[2023-03-24 00:15:34] [INFO ] Deduced a trap composed of 108 places in 589 ms of which 1 ms to minimize.
[2023-03-24 00:15:35] [INFO ] Deduced a trap composed of 276 places in 505 ms of which 1 ms to minimize.
[2023-03-24 00:15:36] [INFO ] Deduced a trap composed of 359 places in 566 ms of which 1 ms to minimize.
[2023-03-24 00:15:37] [INFO ] Deduced a trap composed of 82 places in 568 ms of which 1 ms to minimize.
[2023-03-24 00:15:38] [INFO ] Deduced a trap composed of 87 places in 557 ms of which 1 ms to minimize.
[2023-03-24 00:15:38] [INFO ] Deduced a trap composed of 222 places in 475 ms of which 1 ms to minimize.
[2023-03-24 00:15:39] [INFO ] Deduced a trap composed of 97 places in 608 ms of which 1 ms to minimize.
[2023-03-24 00:15:40] [INFO ] Deduced a trap composed of 96 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:15:41] [INFO ] Deduced a trap composed of 82 places in 609 ms of which 1 ms to minimize.
[2023-03-24 00:15:42] [INFO ] Deduced a trap composed of 97 places in 597 ms of which 1 ms to minimize.
[2023-03-24 00:15:43] [INFO ] Deduced a trap composed of 83 places in 566 ms of which 1 ms to minimize.
[2023-03-24 00:15:44] [INFO ] Deduced a trap composed of 87 places in 567 ms of which 1 ms to minimize.
[2023-03-24 00:15:44] [INFO ] Deduced a trap composed of 85 places in 562 ms of which 1 ms to minimize.
[2023-03-24 00:15:45] [INFO ] Deduced a trap composed of 199 places in 514 ms of which 1 ms to minimize.
[2023-03-24 00:15:46] [INFO ] Deduced a trap composed of 96 places in 609 ms of which 1 ms to minimize.
[2023-03-24 00:15:46] [INFO ] Deduced a trap composed of 94 places in 576 ms of which 1 ms to minimize.
[2023-03-24 00:15:48] [INFO ] Deduced a trap composed of 87 places in 600 ms of which 1 ms to minimize.
[2023-03-24 00:15:48] [INFO ] Deduced a trap composed of 84 places in 598 ms of which 1 ms to minimize.
[2023-03-24 00:15:49] [INFO ] Deduced a trap composed of 95 places in 571 ms of which 1 ms to minimize.
[2023-03-24 00:15:50] [INFO ] Deduced a trap composed of 82 places in 603 ms of which 1 ms to minimize.
[2023-03-24 00:15:50] [INFO ] Deduced a trap composed of 85 places in 613 ms of which 1 ms to minimize.
[2023-03-24 00:15:52] [INFO ] Deduced a trap composed of 108 places in 612 ms of which 1 ms to minimize.
[2023-03-24 00:15:54] [INFO ] Deduced a trap composed of 92 places in 613 ms of which 0 ms to minimize.
[2023-03-24 00:15:55] [INFO ] Deduced a trap composed of 101 places in 603 ms of which 1 ms to minimize.
[2023-03-24 00:15:55] [INFO ] Deduced a trap composed of 97 places in 550 ms of which 0 ms to minimize.
[2023-03-24 00:15:56] [INFO ] Deduced a trap composed of 88 places in 612 ms of which 1 ms to minimize.
[2023-03-24 00:15:57] [INFO ] Deduced a trap composed of 84 places in 617 ms of which 1 ms to minimize.
[2023-03-24 00:15:58] [INFO ] Deduced a trap composed of 95 places in 594 ms of which 1 ms to minimize.
[2023-03-24 00:15:58] [INFO ] Deduced a trap composed of 83 places in 611 ms of which 1 ms to minimize.
[2023-03-24 00:15:59] [INFO ] Deduced a trap composed of 286 places in 512 ms of which 0 ms to minimize.
[2023-03-24 00:16:00] [INFO ] Deduced a trap composed of 99 places in 591 ms of which 1 ms to minimize.
[2023-03-24 00:16:01] [INFO ] Deduced a trap composed of 88 places in 572 ms of which 1 ms to minimize.
[2023-03-24 00:16:01] [INFO ] Deduced a trap composed of 293 places in 612 ms of which 1 ms to minimize.
[2023-03-24 00:16:02] [INFO ] Deduced a trap composed of 103 places in 591 ms of which 1 ms to minimize.
[2023-03-24 00:16:03] [INFO ] Deduced a trap composed of 110 places in 592 ms of which 1 ms to minimize.
[2023-03-24 00:16:04] [INFO ] Deduced a trap composed of 95 places in 590 ms of which 1 ms to minimize.
[2023-03-24 00:16:04] [INFO ] Deduced a trap composed of 108 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:16: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 121 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 118 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2023-03-24 00:16:04] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-24 00:16:04] [INFO ] Invariant cache hit.
[2023-03-24 00:16:06] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2023-03-24 00:16:06] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-24 00:16:06] [INFO ] Invariant cache hit.
[2023-03-24 00:16:07] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:16:28] [INFO ] Implicit Places using invariants and state equation in 22035 ms returned []
Implicit Place search using SMT with State Equation took 23236 ms to find 0 implicit places.
[2023-03-24 00:16:28] [INFO ] Redundant transitions in 211 ms returned []
[2023-03-24 00:16:28] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-24 00:16:28] [INFO ] Invariant cache hit.
[2023-03-24 00:16:29] [INFO ] Dead Transitions using invariants and state equation in 1557 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25138 ms. Remains : 979/979 places, 4274/4274 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 98893 ms.
[2023-03-24 00:16:30] [INFO ] Flatten gal took : 320 ms
[2023-03-24 00:16:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-24 00:16:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 979 places, 4274 transitions and 21307 arcs took 24 ms.
Total runtime 449995 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1021/ub_0_ --maxsum=/tmp/1021/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14956864 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086592 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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="MultiCrashLeafsetExtension-PT-S16C08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, 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 r233-tall-167856419400797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;